./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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_test22_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:27:03,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:27:03,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:27:03,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:27:03,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:27:03,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:27:03,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:27:03,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:27:03,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:27:03,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:27:03,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:27:03,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:27:03,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:27:03,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:27:03,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:27:03,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:27:03,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:27:03,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:27:03,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:27:03,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:27:03,432 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:27:03,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:27:03,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:27:03,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:27:03,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:27:03,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:27:03,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:27:03,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:27:03,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:27:03,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:27:03,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:27:03,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:27:03,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:27:03,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:27:03,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:27:03,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:27:03,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:27:03,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:27:03,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:27:03,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:27:03,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:27:03,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:27:03,455 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:27:03,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:27:03,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:27:03,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:27:03,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:27:03,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:27:03,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:27:03,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:27:03,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:27:03,482 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:27:03,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:27:03,483 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:27:03,484 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:27:03,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:27:03,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:27:03,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:27:03,484 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:27:03,484 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:27:03,485 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:27:03,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:27:03,485 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:27:03,485 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:27:03,485 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:27:03,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:27:03,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:27:03,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:27:03,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:27:03,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:27:03,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:27:03,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:27:03,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:27:03,487 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 -> beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d [2022-07-21 17:27:03,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:27:03,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:27:03,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:27:03,783 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:27:03,785 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:27:03,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-07-21 17:27:03,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba334ad49/30cb83acf4b54a5d822a39c575d0c772/FLAG0541519d6 [2022-07-21 17:27:04,248 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:27:04,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-07-21 17:27:04,265 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba334ad49/30cb83acf4b54a5d822a39c575d0c772/FLAG0541519d6 [2022-07-21 17:27:04,278 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba334ad49/30cb83acf4b54a5d822a39c575d0c772 [2022-07-21 17:27:04,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:27:04,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:27:04,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:27:04,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:27:04,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:27:04,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:27:04" (1/1) ... [2022-07-21 17:27:04,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12827045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:27:04, skipping insertion in model container [2022-07-21 17:27:04,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:27:04" (1/1) ... [2022-07-21 17:27:04,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:27:04,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:27:04,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:27:04,651 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-21 17:27:04,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4c648478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:27:04, skipping insertion in model container [2022-07-21 17:27:04,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:27:04,653 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-21 17:27:04,655 INFO L158 Benchmark]: Toolchain (without parser) took 372.64ms. Allocated memory is still 62.9MB. Free memory was 41.0MB in the beginning and 41.9MB in the end (delta: -961.8kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 17:27:04,655 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 62.9MB. Free memory was 44.1MB in the beginning and 44.1MB in the end (delta: 33.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:27:04,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.77ms. Allocated memory is still 62.9MB. Free memory was 40.7MB in the beginning and 41.9MB in the end (delta: -1.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 17:27:04,658 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.21ms. Allocated memory is still 62.9MB. Free memory was 44.1MB in the beginning and 44.1MB in the end (delta: 33.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.77ms. Allocated memory is still 62.9MB. Free memory was 40.7MB in the beginning and 41.9MB in the end (delta: -1.2MB). Peak memory consumption was 10.5MB. 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_test22_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:27:06,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:27:06,111 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:27:06,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:27:06,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:27:06,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:27:06,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:27:06,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:27:06,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:27:06,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:27:06,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:27:06,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:27:06,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:27:06,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:27:06,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:27:06,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:27:06,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:27:06,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:27:06,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:27:06,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:27:06,170 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:27:06,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:27:06,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:27:06,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:27:06,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:27:06,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:27:06,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:27:06,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:27:06,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:27:06,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:27:06,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:27:06,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:27:06,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:27:06,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:27:06,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:27:06,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:27:06,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:27:06,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:27:06,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:27:06,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:27:06,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:27:06,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:27:06,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-21 17:27:06,207 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:27:06,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:27:06,208 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:27:06,208 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:27:06,208 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:27:06,208 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:27:06,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:27:06,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:27:06,209 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:27:06,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:27:06,210 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:27:06,210 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:27:06,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:27:06,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:27:06,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:27:06,219 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:27:06,219 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:27:06,219 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:27:06,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:27:06,219 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:27:06,220 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 17:27:06,220 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 17:27:06,220 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:27:06,220 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:27:06,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:27:06,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:27:06,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:27:06,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:27:06,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:27:06,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:27:06,222 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 17:27:06,222 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 17:27:06,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 17:27:06,222 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 -> beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d [2022-07-21 17:27:06,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:27:06,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:27:06,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:27:06,450 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:27:06,451 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:27:06,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-07-21 17:27:06,490 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc477db8/56c550e805ec482eb983a1dd8feb94ce/FLAGfa17c1070 [2022-07-21 17:27:06,843 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:27:06,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-07-21 17:27:06,869 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc477db8/56c550e805ec482eb983a1dd8feb94ce/FLAGfa17c1070 [2022-07-21 17:27:07,223 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc477db8/56c550e805ec482eb983a1dd8feb94ce [2022-07-21 17:27:07,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:27:07,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:27:07,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:27:07,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:27:07,231 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:27:07,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:27:07" (1/1) ... [2022-07-21 17:27:07,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13bda7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:27:07, skipping insertion in model container [2022-07-21 17:27:07,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:27:07" (1/1) ... [2022-07-21 17:27:07,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:27:07,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:27:07,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:27:07,557 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-21 17:27:07,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:27:07,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:27:07,628 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:27:07,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:27:07,704 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:27:07,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:27:07 WrapperNode [2022-07-21 17:27:07,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:27:07,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:27:07,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:27:07,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:27:07,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:27:07" (1/1) ... [2022-07-21 17:27:07,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:27:07" (1/1) ... [2022-07-21 17:27:07,773 INFO L137 Inliner]: procedures = 165, calls = 71, calls flagged for inlining = 23, calls inlined = 17, statements flattened = 120 [2022-07-21 17:27:07,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:27:07,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:27:07,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:27:07,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:27:07,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:27:07" (1/1) ... [2022-07-21 17:27:07,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:27:07" (1/1) ... [2022-07-21 17:27:07,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:27:07" (1/1) ... [2022-07-21 17:27:07,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:27:07" (1/1) ... [2022-07-21 17:27:07,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:27:07" (1/1) ... [2022-07-21 17:27:07,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:27:07" (1/1) ... [2022-07-21 17:27:07,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:27:07" (1/1) ... [2022-07-21 17:27:07,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:27:07,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:27:07,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:27:07,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:27:07,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:27:07" (1/1) ... [2022-07-21 17:27:07,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:27:07,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:27:07,853 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-21 17:27:07,855 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-21 17:27:07,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 17:27:07,884 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-07-21 17:27:07,887 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-07-21 17:27:07,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 17:27:07,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 17:27:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-07-21 17:27:07,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-07-21 17:27:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:27:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:27:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:27:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:27:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 17:27:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:27:07,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 17:27:07,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:27:07,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:27:08,038 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:27:08,039 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:27:08,446 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:27:08,451 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:27:08,451 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 17:27:08,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:27:08 BoogieIcfgContainer [2022-07-21 17:27:08,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:27:08,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:27:08,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:27:08,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:27:08,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:27:07" (1/3) ... [2022-07-21 17:27:08,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e2d3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:27:08, skipping insertion in model container [2022-07-21 17:27:08,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:27:07" (2/3) ... [2022-07-21 17:27:08,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e2d3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:27:08, skipping insertion in model container [2022-07-21 17:27:08,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:27:08" (3/3) ... [2022-07-21 17:27:08,461 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-2.i [2022-07-21 17:27:08,470 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:27:08,472 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-07-21 17:27:08,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:27:08,513 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@7c1caf1d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b8f836f [2022-07-21 17:27:08,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-07-21 17:27:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:27:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 17:27:08,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:08,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:08,522 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:08,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:08,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1790059245, now seen corresponding path program 1 times [2022-07-21 17:27:08,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:08,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203007609] [2022-07-21 17:27:08,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:08,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:08,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:08,537 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-21 17:27:08,542 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-21 17:27:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:08,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:27:08,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:08,676 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-21 17:27:08,713 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-21 17:27:08,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:08,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:08,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203007609] [2022-07-21 17:27:08,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203007609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:08,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:08,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:27:08,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843268365] [2022-07-21 17:27:08,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:08,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:27:08,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:08,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:27:08,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:27:08,744 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-21 17:27:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:09,044 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2022-07-21 17:27:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:27:09,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2022-07-21 17:27:09,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:09,060 INFO L225 Difference]: With dead ends: 153 [2022-07-21 17:27:09,061 INFO L226 Difference]: Without dead ends: 151 [2022-07-21 17:27:09,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:27:09,069 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 94 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:09,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 373 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:27:09,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-21 17:27:09,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 93. [2022-07-21 17:27:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 85 states have internal predecessors, (94), 4 states have call successors, (4), 3 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-21 17:27:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2022-07-21 17:27:09,110 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 10 [2022-07-21 17:27:09,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:09,110 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2022-07-21 17:27:09,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-21 17:27:09,110 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-07-21 17:27:09,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 17:27:09,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:09,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:09,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 17:27:09,317 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-21 17:27:09,317 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:09,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:09,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1761430094, now seen corresponding path program 1 times [2022-07-21 17:27:09,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:09,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422144546] [2022-07-21 17:27:09,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:09,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:09,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:09,327 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-21 17:27:09,337 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-21 17:27:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:09,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:27:09,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:09,432 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-21 17:27:09,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:09,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:09,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422144546] [2022-07-21 17:27:09,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422144546] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:09,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:09,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:27:09,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187895122] [2022-07-21 17:27:09,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:09,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:27:09,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:09,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:27:09,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:27:09,438 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-21 17:27:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:09,477 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-07-21 17:27:09,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:27:09,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2022-07-21 17:27:09,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:09,478 INFO L225 Difference]: With dead ends: 110 [2022-07-21 17:27:09,478 INFO L226 Difference]: Without dead ends: 110 [2022-07-21 17:27:09,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-21 17:27:09,479 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 17 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:09,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 385 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:27:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-21 17:27:09,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2022-07-21 17:27:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 83 states have internal predecessors, (91), 4 states have call successors, (4), 3 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-21 17:27:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-07-21 17:27:09,487 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 10 [2022-07-21 17:27:09,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:09,488 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-07-21 17:27:09,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-21 17:27:09,488 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-07-21 17:27:09,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:27:09,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:09,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:09,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 17:27:09,699 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-21 17:27:09,700 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:09,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:09,700 INFO L85 PathProgramCache]: Analyzing trace with hash 342738302, now seen corresponding path program 1 times [2022-07-21 17:27:09,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:09,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452733463] [2022-07-21 17:27:09,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:09,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:09,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:09,702 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-21 17:27:09,711 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-21 17:27:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:09,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 17:27:09,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:09,765 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-21 17:27:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:27:09,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:09,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:09,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452733463] [2022-07-21 17:27:09,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452733463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:09,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:09,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:27:09,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762366276] [2022-07-21 17:27:09,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:09,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:27:09,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:09,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:27:09,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:27:09,848 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-21 17:27:10,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:10,134 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-07-21 17:27:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:27:10,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-21 17:27:10,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:10,137 INFO L225 Difference]: With dead ends: 128 [2022-07-21 17:27:10,137 INFO L226 Difference]: Without dead ends: 128 [2022-07-21 17:27:10,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:27:10,138 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 69 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:10,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 465 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:27:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-21 17:27:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 90. [2022-07-21 17:27:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 82 states have internal predecessors, (90), 4 states have call successors, (4), 3 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-21 17:27:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-07-21 17:27:10,144 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 11 [2022-07-21 17:27:10,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:10,144 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-07-21 17:27:10,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-21 17:27:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-07-21 17:27:10,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 17:27:10,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:10,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:10,155 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-21 17:27:10,351 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-21 17:27:10,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:10,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2034926041, now seen corresponding path program 1 times [2022-07-21 17:27:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:10,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733711815] [2022-07-21 17:27:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:10,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:10,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:10,354 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-21 17:27:10,356 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-21 17:27:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:10,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:27:10,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:10,429 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-21 17:27:10,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:10,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:10,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733711815] [2022-07-21 17:27:10,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733711815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:10,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:10,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:27:10,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590269611] [2022-07-21 17:27:10,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:10,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:27:10,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:10,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:27:10,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:27:10,431 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-21 17:27:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:10,449 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-07-21 17:27:10,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:27:10,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2022-07-21 17:27:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:10,451 INFO L225 Difference]: With dead ends: 109 [2022-07-21 17:27:10,451 INFO L226 Difference]: Without dead ends: 109 [2022-07-21 17:27:10,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-21 17:27:10,452 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 33 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:10,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 409 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:27:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-21 17:27:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2022-07-21 17:27:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 82 states have internal predecessors, (89), 4 states have call successors, (4), 3 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-21 17:27:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-07-21 17:27:10,457 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 12 [2022-07-21 17:27:10,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:10,457 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-07-21 17:27:10,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-21 17:27:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-07-21 17:27:10,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 17:27:10,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:10,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:10,466 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-21 17:27:10,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:27:10,664 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:10,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:10,665 INFO L85 PathProgramCache]: Analyzing trace with hash -517230920, now seen corresponding path program 1 times [2022-07-21 17:27:10,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:10,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414602839] [2022-07-21 17:27:10,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:10,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:10,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:10,666 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:27:10,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 17:27:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:10,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 17:27:10,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:10,737 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-21 17:27:10,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:10,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:10,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414602839] [2022-07-21 17:27:10,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414602839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:10,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:10,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:27:10,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656796816] [2022-07-21 17:27:10,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:10,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:27:10,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:10,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:27:10,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:27:10,739 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-21 17:27:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:10,761 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2022-07-21 17:27:10,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:27:10,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2022-07-21 17:27:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:10,763 INFO L225 Difference]: With dead ends: 106 [2022-07-21 17:27:10,763 INFO L226 Difference]: Without dead ends: 106 [2022-07-21 17:27:10,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:27:10,763 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 15 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:10,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 281 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:27:10,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-21 17:27:10,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2022-07-21 17:27:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 84 states have internal predecessors, (91), 4 states have call successors, (4), 3 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-21 17:27:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-07-21 17:27:10,768 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 12 [2022-07-21 17:27:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:10,769 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-07-21 17:27:10,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-21 17:27:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-07-21 17:27:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 17:27:10,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:10,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:10,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 17:27:10,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:27:10,981 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:10,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:10,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1400250303, now seen corresponding path program 1 times [2022-07-21 17:27:10,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:10,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373852457] [2022-07-21 17:27:10,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:10,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:10,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:10,983 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-21 17:27:10,984 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-21 17:27:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:11,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:27:11,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:11,055 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-21 17:27:11,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:11,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:11,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373852457] [2022-07-21 17:27:11,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373852457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:11,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:11,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:27:11,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865910456] [2022-07-21 17:27:11,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:11,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:27:11,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:11,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:27:11,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:27:11,058 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-21 17:27:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:11,076 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-07-21 17:27:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:27:11,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 16 [2022-07-21 17:27:11,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:11,080 INFO L225 Difference]: With dead ends: 100 [2022-07-21 17:27:11,080 INFO L226 Difference]: Without dead ends: 100 [2022-07-21 17:27:11,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:27:11,081 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 31 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:11,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 200 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:27:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-21 17:27:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2022-07-21 17:27:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 85 states have internal predecessors, (92), 4 states have call successors, (4), 3 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-21 17:27:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-07-21 17:27:11,085 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 16 [2022-07-21 17:27:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:11,085 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-07-21 17:27:11,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-21 17:27:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-07-21 17:27:11,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 17:27:11,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:11,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:11,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-21 17:27:11,292 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-21 17:27:11,293 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:11,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:11,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1200886583, now seen corresponding path program 1 times [2022-07-21 17:27:11,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:11,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128166226] [2022-07-21 17:27:11,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:11,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:11,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:11,295 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-21 17:27:11,296 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-21 17:27:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:11,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 17:27:11,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:11,404 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-21 17:27:11,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:11,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:11,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128166226] [2022-07-21 17:27:11,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128166226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:11,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:11,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:27:11,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446172705] [2022-07-21 17:27:11,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:11,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:27:11,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:11,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:27:11,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:27:11,406 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:27:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:11,455 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-07-21 17:27:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:27:11,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-21 17:27:11,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:11,456 INFO L225 Difference]: With dead ends: 106 [2022-07-21 17:27:11,456 INFO L226 Difference]: Without dead ends: 106 [2022-07-21 17:27:11,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 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-21 17:27:11,457 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 14 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:11,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 448 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:27:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-21 17:27:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2022-07-21 17:27:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 91 states have internal predecessors, (97), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-21 17:27:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-07-21 17:27:11,474 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 17 [2022-07-21 17:27:11,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:11,475 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-07-21 17:27:11,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:27:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-07-21 17:27:11,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 17:27:11,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:11,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:11,484 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-21 17:27:11,684 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-21 17:27:11,684 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:11,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash -517345560, now seen corresponding path program 1 times [2022-07-21 17:27:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:11,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066023378] [2022-07-21 17:27:11,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:11,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:11,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:11,686 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-21 17:27:11,687 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-21 17:27:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:11,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:27:11,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:27:11,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:27:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:27:11,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:11,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066023378] [2022-07-21 17:27:11,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066023378] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:27:11,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:27:11,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-21 17:27:11,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344222380] [2022-07-21 17:27:11,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:27:11,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:27:11,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:11,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:27:11,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:27:11,821 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-21 17:27:11,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:11,881 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2022-07-21 17:27:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:27:11,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 17 [2022-07-21 17:27:11,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:11,882 INFO L225 Difference]: With dead ends: 107 [2022-07-21 17:27:11,882 INFO L226 Difference]: Without dead ends: 107 [2022-07-21 17:27:11,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:27:11,883 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 62 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:11,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 465 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:27:11,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-21 17:27:11,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2022-07-21 17:27:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 94 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-21 17:27:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2022-07-21 17:27:11,885 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 17 [2022-07-21 17:27:11,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:11,885 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2022-07-21 17:27:11,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-21 17:27:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2022-07-21 17:27:11,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:27:11,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:11,886 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:11,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 17:27:12,101 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-21 17:27:12,101 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash -613690879, now seen corresponding path program 2 times [2022-07-21 17:27:12,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:12,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322138743] [2022-07-21 17:27:12,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:27:12,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:12,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:12,103 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-21 17:27:12,103 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-21 17:27:12,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 17:27:12,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:27:12,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 17:27:12,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:12,166 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-21 17:27:12,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 17:27:12,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:12,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:12,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322138743] [2022-07-21 17:27:12,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322138743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:12,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:12,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:27:12,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255409789] [2022-07-21 17:27:12,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:12,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:27:12,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:12,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:27:12,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:27:12,222 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-21 17:27:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:12,503 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2022-07-21 17:27:12,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:27:12,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 20 [2022-07-21 17:27:12,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:12,505 INFO L225 Difference]: With dead ends: 136 [2022-07-21 17:27:12,505 INFO L226 Difference]: Without dead ends: 136 [2022-07-21 17:27:12,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:27:12,505 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 91 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:12,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 511 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:27:12,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-21 17:27:12,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2022-07-21 17:27:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 93 states have internal predecessors, (99), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-21 17:27:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2022-07-21 17:27:12,513 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 20 [2022-07-21 17:27:12,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:12,513 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2022-07-21 17:27:12,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-21 17:27:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2022-07-21 17:27:12,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:27:12,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:12,513 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:12,520 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-21 17:27:12,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:27:12,714 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:12,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:12,714 INFO L85 PathProgramCache]: Analyzing trace with hash -613690878, now seen corresponding path program 1 times [2022-07-21 17:27:12,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:12,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477671175] [2022-07-21 17:27:12,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:12,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:12,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:12,716 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:27:12,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 17:27:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:12,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:27:12,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:27:12,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:27:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:27:12,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:12,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477671175] [2022-07-21 17:27:12,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477671175] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:27:12,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:27:12,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-21 17:27:12,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353715728] [2022-07-21 17:27:12,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:27:12,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 17:27:12,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:12,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 17:27:12,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:27:12,968 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-21 17:27:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:13,163 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-07-21 17:27:13,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:27:13,164 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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 20 [2022-07-21 17:27:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:13,164 INFO L225 Difference]: With dead ends: 112 [2022-07-21 17:27:13,164 INFO L226 Difference]: Without dead ends: 112 [2022-07-21 17:27:13,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2022-07-21 17:27:13,171 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 30 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:13,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 918 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:27:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-21 17:27:13,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-07-21 17:27:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.381578947368421) internal successors, (105), 99 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-21 17:27:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2022-07-21 17:27:13,174 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 20 [2022-07-21 17:27:13,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:13,175 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2022-07-21 17:27:13,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-21 17:27:13,175 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2022-07-21 17:27:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:27:13,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:13,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:13,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 17:27:13,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:27:13,383 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:13,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:13,383 INFO L85 PathProgramCache]: Analyzing trace with hash -694582635, now seen corresponding path program 1 times [2022-07-21 17:27:13,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:13,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434055377] [2022-07-21 17:27:13,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:13,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:13,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:13,385 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-21 17:27:13,385 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-21 17:27:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:13,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:27:13,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 17:27:13,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:13,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:13,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434055377] [2022-07-21 17:27:13,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434055377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:13,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:13,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:27:13,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819363895] [2022-07-21 17:27:13,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:13,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:27:13,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:13,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:27:13,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:27:13,470 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-21 17:27:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:13,568 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2022-07-21 17:27:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:27:13,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 25 [2022-07-21 17:27:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:13,569 INFO L225 Difference]: With dead ends: 115 [2022-07-21 17:27:13,569 INFO L226 Difference]: Without dead ends: 99 [2022-07-21 17:27:13,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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-21 17:27:13,570 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 31 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:13,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 182 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:27:13,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-21 17:27:13,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2022-07-21 17:27:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 88 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:27:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2022-07-21 17:27:13,572 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 25 [2022-07-21 17:27:13,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:13,572 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2022-07-21 17:27:13,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-21 17:27:13,573 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-07-21 17:27:13,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 17:27:13,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:13,573 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:13,579 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-21 17:27:13,779 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-21 17:27:13,779 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:13,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:13,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1800263842, now seen corresponding path program 2 times [2022-07-21 17:27:13,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:13,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899923834] [2022-07-21 17:27:13,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:27:13,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:13,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:13,781 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-21 17:27:13,782 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-21 17:27:13,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 17:27:13,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:27:13,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 17:27:13,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:13,851 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-21 17:27:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-21 17:27:13,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:13,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:13,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899923834] [2022-07-21 17:27:13,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899923834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:13,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:13,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:27:13,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775674252] [2022-07-21 17:27:13,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:13,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:27:13,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:13,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:27:13,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:27:13,978 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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-21 17:27:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:14,361 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-07-21 17:27:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:27:14,362 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 26 [2022-07-21 17:27:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:14,362 INFO L225 Difference]: With dead ends: 135 [2022-07-21 17:27:14,362 INFO L226 Difference]: Without dead ends: 135 [2022-07-21 17:27:14,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:27:14,363 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 97 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:14,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 590 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:27:14,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-21 17:27:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2022-07-21 17:27:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 87 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:27:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-07-21 17:27:14,366 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 26 [2022-07-21 17:27:14,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:14,366 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-07-21 17:27:14,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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-21 17:27:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-07-21 17:27:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 17:27:14,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:14,367 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:14,376 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-21 17:27:14,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:27:14,567 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash -819776159, now seen corresponding path program 1 times [2022-07-21 17:27:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:14,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915514379] [2022-07-21 17:27:14,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:14,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:14,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:14,569 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:27:14,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 17:27:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:14,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 17:27:14,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:27:14,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:27:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:27:15,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:15,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915514379] [2022-07-21 17:27:15,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915514379] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:27:15,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:27:15,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-21 17:27:15,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400085901] [2022-07-21 17:27:15,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:27:15,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 17:27:15,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:15,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 17:27:15,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2022-07-21 17:27:15,194 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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-21 17:27:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:15,522 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2022-07-21 17:27:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 17:27:15,522 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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 28 [2022-07-21 17:27:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:15,523 INFO L225 Difference]: With dead ends: 100 [2022-07-21 17:27:15,523 INFO L226 Difference]: Without dead ends: 100 [2022-07-21 17:27:15,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2022-07-21 17:27:15,524 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 29 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:15,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1126 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:27:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-21 17:27:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-21 17:27:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.375) internal successors, (99), 93 states have internal predecessors, (99), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:27:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2022-07-21 17:27:15,526 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 28 [2022-07-21 17:27:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:15,526 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2022-07-21 17:27:15,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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-21 17:27:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2022-07-21 17:27:15,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 17:27:15,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:15,526 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:15,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-21 17:27:15,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:27:15,731 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:15,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:15,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1570464767, now seen corresponding path program 2 times [2022-07-21 17:27:15,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:15,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585654850] [2022-07-21 17:27:15,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:27:15,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:15,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:15,733 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-21 17:27:15,735 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-21 17:27:15,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 17:27:15,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:27:15,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:27:15,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:15,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:15,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:15,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585654850] [2022-07-21 17:27:15,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585654850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:15,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:15,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:27:15,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721469103] [2022-07-21 17:27:15,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:15,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:27:15,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:15,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:27:15,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:27:15,862 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-21 17:27:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:15,889 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-07-21 17:27:15,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:27:15,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 34 [2022-07-21 17:27:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:15,890 INFO L225 Difference]: With dead ends: 100 [2022-07-21 17:27:15,890 INFO L226 Difference]: Without dead ends: 100 [2022-07-21 17:27:15,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:27:15,891 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:15,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 365 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:27:15,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-21 17:27:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-21 17:27:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 93 states have internal predecessors, (98), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:27:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-07-21 17:27:15,893 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 34 [2022-07-21 17:27:15,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:15,894 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-07-21 17:27:15,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-21 17:27:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-07-21 17:27:15,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:27:15,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:15,894 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:15,905 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-21 17:27:16,101 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-21 17:27:16,101 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:16,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:16,102 INFO L85 PathProgramCache]: Analyzing trace with hash -234355352, now seen corresponding path program 1 times [2022-07-21 17:27:16,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:16,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593413658] [2022-07-21 17:27:16,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:16,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:16,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:16,103 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-21 17:27:16,105 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-21 17:27:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:16,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 17:27:16,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:16,238 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-21 17:27:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:16,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:16,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:16,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593413658] [2022-07-21 17:27:16,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593413658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:16,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:16,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:27:16,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519872741] [2022-07-21 17:27:16,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:16,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:27:16,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:16,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:27:16,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:27:16,320 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:27:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:16,553 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-07-21 17:27:16,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:27:16,559 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-21 17:27:16,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:16,560 INFO L225 Difference]: With dead ends: 98 [2022-07-21 17:27:16,561 INFO L226 Difference]: Without dead ends: 98 [2022-07-21 17:27:16,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:27:16,561 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 74 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:16,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 378 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:27:16,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-21 17:27:16,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-21 17:27:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 91 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:27:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2022-07-21 17:27:16,564 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 36 [2022-07-21 17:27:16,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:16,564 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2022-07-21 17:27:16,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:27:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2022-07-21 17:27:16,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:27:16,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:16,565 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:16,575 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-21 17:27:16,773 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-21 17:27:16,773 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:16,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:16,774 INFO L85 PathProgramCache]: Analyzing trace with hash -234355351, now seen corresponding path program 1 times [2022-07-21 17:27:16,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:16,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937000098] [2022-07-21 17:27:16,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:16,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:16,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:16,775 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-21 17:27:16,776 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-21 17:27:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:16,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 17:27:16,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:16,920 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-21 17:27:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:17,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:17,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:17,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937000098] [2022-07-21 17:27:17,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937000098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:17,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:17,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:27:17,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384073331] [2022-07-21 17:27:17,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:17,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:27:17,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:17,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:27:17,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:27:17,080 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:27:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:17,344 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2022-07-21 17:27:17,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:27:17,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-21 17:27:17,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:17,345 INFO L225 Difference]: With dead ends: 96 [2022-07-21 17:27:17,345 INFO L226 Difference]: Without dead ends: 96 [2022-07-21 17:27:17,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:27:17,346 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 78 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:17,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 460 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:27:17,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-21 17:27:17,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-21 17:27:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 89 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:27:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2022-07-21 17:27:17,348 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 36 [2022-07-21 17:27:17,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:17,348 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2022-07-21 17:27:17,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:27:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2022-07-21 17:27:17,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:27:17,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:17,349 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:17,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-21 17:27:17,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:27:17,558 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:17,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:17,558 INFO L85 PathProgramCache]: Analyzing trace with hash -285061459, now seen corresponding path program 1 times [2022-07-21 17:27:17,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:17,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086808349] [2022-07-21 17:27:17,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:17,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:17,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:17,560 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:27:17,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-21 17:27:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:17,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:27:17,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:17,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:17,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:17,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086808349] [2022-07-21 17:27:17,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086808349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:17,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:17,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:27:17,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480938249] [2022-07-21 17:27:17,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:17,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:27:17,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:17,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:27:17,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:27:17,730 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-21 17:27:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:17,767 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-07-21 17:27:17,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:27:17,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 36 [2022-07-21 17:27:17,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:17,768 INFO L225 Difference]: With dead ends: 96 [2022-07-21 17:27:17,768 INFO L226 Difference]: Without dead ends: 96 [2022-07-21 17:27:17,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:27:17,769 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 69 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:17,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 390 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:27:17,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-21 17:27:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-21 17:27:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 88 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:27:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2022-07-21 17:27:17,771 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 36 [2022-07-21 17:27:17,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:17,771 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2022-07-21 17:27:17,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-21 17:27:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-07-21 17:27:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 17:27:17,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:17,771 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 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-21 17:27:17,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-21 17:27:17,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:27:17,980 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:17,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:17,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1910239882, now seen corresponding path program 1 times [2022-07-21 17:27:17,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:17,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139405440] [2022-07-21 17:27:17,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:17,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:17,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:17,981 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-21 17:27:17,982 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-21 17:27:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:18,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 17:27:18,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:18,156 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-21 17:27:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:18,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:18,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:18,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139405440] [2022-07-21 17:27:18,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139405440] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:18,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:18,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:27:18,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459494260] [2022-07-21 17:27:18,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:18,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:27:18,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:18,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:27:18,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:27:18,254 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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-21 17:27:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:18,442 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-07-21 17:27:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:27:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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 44 [2022-07-21 17:27:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:18,444 INFO L225 Difference]: With dead ends: 97 [2022-07-21 17:27:18,444 INFO L226 Difference]: Without dead ends: 97 [2022-07-21 17:27:18,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:27:18,444 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 61 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:18,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 366 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 21 Unchecked, 0.2s Time] [2022-07-21 17:27:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-21 17:27:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-07-21 17:27:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:27:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2022-07-21 17:27:18,446 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 44 [2022-07-21 17:27:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:18,446 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2022-07-21 17:27:18,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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-21 17:27:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2022-07-21 17:27:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 17:27:18,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:18,447 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 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-21 17:27:18,458 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-21 17:27:18,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:27:18,656 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:18,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:18,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1910239883, now seen corresponding path program 1 times [2022-07-21 17:27:18,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:18,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965214655] [2022-07-21 17:27:18,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:18,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:18,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:18,658 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:27:18,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-21 17:27:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:18,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-21 17:27:18,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:18,850 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-21 17:27:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:19,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:19,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:19,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965214655] [2022-07-21 17:27:19,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965214655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:19,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:19,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:27:19,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061479256] [2022-07-21 17:27:19,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:19,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:27:19,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:19,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:27:19,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:27:19,036 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-21 17:27:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:19,246 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-07-21 17:27:19,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:27:19,247 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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 44 [2022-07-21 17:27:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:19,247 INFO L225 Difference]: With dead ends: 99 [2022-07-21 17:27:19,248 INFO L226 Difference]: Without dead ends: 99 [2022-07-21 17:27:19,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:27:19,248 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 64 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:19,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 349 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2022-07-21 17:27:19,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-21 17:27:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2022-07-21 17:27:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 84 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:27:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-07-21 17:27:19,250 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 44 [2022-07-21 17:27:19,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:19,250 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-07-21 17:27:19,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-21 17:27:19,250 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-07-21 17:27:19,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 17:27:19,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:19,251 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:27:19,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-21 17:27:19,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:27:19,452 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1609523877, now seen corresponding path program 1 times [2022-07-21 17:27:19,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:19,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512967893] [2022-07-21 17:27:19,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:19,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:19,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:19,454 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-21 17:27:19,494 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-21 17:27:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:19,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:27:19,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:19,703 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:19,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:19,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:19,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512967893] [2022-07-21 17:27:19,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512967893] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:19,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:19,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:27:19,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136717528] [2022-07-21 17:27:19,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:19,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:27:19,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:19,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:27:19,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:27:19,705 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:27:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:19,740 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-07-21 17:27:19,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:27:19,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-07-21 17:27:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:19,741 INFO L225 Difference]: With dead ends: 92 [2022-07-21 17:27:19,741 INFO L226 Difference]: Without dead ends: 92 [2022-07-21 17:27:19,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:27:19,742 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 36 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:19,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 388 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:27:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-21 17:27:19,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-21 17:27:19,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 84 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:27:19,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-07-21 17:27:19,744 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 49 [2022-07-21 17:27:19,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:19,744 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-07-21 17:27:19,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:27:19,744 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-07-21 17:27:19,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 17:27:19,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:19,745 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:27:19,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-21 17:27:19,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:27:19,954 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1068375809, now seen corresponding path program 1 times [2022-07-21 17:27:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:19,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196032137] [2022-07-21 17:27:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:19,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:19,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:19,956 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:27:19,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-21 17:27:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:20,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-21 17:27:20,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:20,166 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-21 17:27:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:20,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:20,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:20,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196032137] [2022-07-21 17:27:20,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196032137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:20,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:20,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:27:20,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374852790] [2022-07-21 17:27:20,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:20,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:27:20,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:20,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:27:20,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:27:20,279 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:27:20,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:20,524 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2022-07-21 17:27:20,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:27:20,525 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2022-07-21 17:27:20,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:20,525 INFO L225 Difference]: With dead ends: 122 [2022-07-21 17:27:20,525 INFO L226 Difference]: Without dead ends: 122 [2022-07-21 17:27:20,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:27:20,526 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 174 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:20,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 312 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2022-07-21 17:27:20,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-21 17:27:20,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2022-07-21 17:27:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 98 states have internal predecessors, (105), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:27:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2022-07-21 17:27:20,529 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 55 [2022-07-21 17:27:20,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:20,530 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2022-07-21 17:27:20,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:27:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2022-07-21 17:27:20,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 17:27:20,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:20,530 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:27:20,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-21 17:27:20,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:27:20,740 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1068375808, now seen corresponding path program 1 times [2022-07-21 17:27:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:20,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191351003] [2022-07-21 17:27:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:20,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:20,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:20,742 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-21 17:27:20,743 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-21 17:27:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:20,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-21 17:27:20,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:20,995 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-21 17:27:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:21,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:21,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:21,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191351003] [2022-07-21 17:27:21,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191351003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:21,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:21,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 17:27:21,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460723961] [2022-07-21 17:27:21,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:21,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 17:27:21,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:21,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 17:27:21,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:27:21,225 INFO L87 Difference]: Start difference. First operand 107 states and 115 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, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:27:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:21,523 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-07-21 17:27:21,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 17:27:21,523 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, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2022-07-21 17:27:21,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:21,524 INFO L225 Difference]: With dead ends: 109 [2022-07-21 17:27:21,524 INFO L226 Difference]: Without dead ends: 109 [2022-07-21 17:27:21,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-21 17:27:21,524 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 152 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:21,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 377 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 205 Invalid, 0 Unknown, 8 Unchecked, 0.2s Time] [2022-07-21 17:27:21,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-21 17:27:21,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2022-07-21 17:27:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.1744186046511629) internal successors, (101), 96 states have internal predecessors, (101), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:27:21,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2022-07-21 17:27:21,531 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 55 [2022-07-21 17:27:21,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:21,531 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2022-07-21 17:27:21,531 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, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:27:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2022-07-21 17:27:21,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-21 17:27:21,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:21,533 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:21,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-21 17:27:21,737 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-21 17:27:21,737 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:21,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash 7191578, now seen corresponding path program 1 times [2022-07-21 17:27:21,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:21,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951967827] [2022-07-21 17:27:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:21,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:21,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:21,740 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-21 17:27:21,741 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-21 17:27:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:21,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:27:21,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:22,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:22,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:22,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951967827] [2022-07-21 17:27:22,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951967827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:22,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:22,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:27:22,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750471205] [2022-07-21 17:27:22,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:22,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:27:22,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:22,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:27:22,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:27:22,037 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:27:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:22,101 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-07-21 17:27:22,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:27:22,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2022-07-21 17:27:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:22,102 INFO L225 Difference]: With dead ends: 109 [2022-07-21 17:27:22,102 INFO L226 Difference]: Without dead ends: 105 [2022-07-21 17:27:22,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:27:22,103 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 62 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:22,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 445 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:27:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-21 17:27:22,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-21 17:27:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 96 states have internal predecessors, (99), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:27:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2022-07-21 17:27:22,105 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 60 [2022-07-21 17:27:22,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:22,106 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2022-07-21 17:27:22,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:27:22,106 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-07-21 17:27:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-21 17:27:22,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:22,106 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:27:22,116 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-21 17:27:22,315 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-21 17:27:22,316 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:22,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:22,316 INFO L85 PathProgramCache]: Analyzing trace with hash 392980163, now seen corresponding path program 1 times [2022-07-21 17:27:22,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:22,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595876568] [2022-07-21 17:27:22,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:22,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:22,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:22,318 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-21 17:27:22,319 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-21 17:27:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:22,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 17:27:22,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:22,605 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-21 17:27:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:22,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:22,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:22,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595876568] [2022-07-21 17:27:22,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595876568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:22,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:22,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 17:27:22,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395744974] [2022-07-21 17:27:22,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:22,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 17:27:22,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:22,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 17:27:22,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:27:22,749 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:27:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:23,025 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2022-07-21 17:27:23,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:27:23,026 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2022-07-21 17:27:23,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:23,027 INFO L225 Difference]: With dead ends: 112 [2022-07-21 17:27:23,027 INFO L226 Difference]: Without dead ends: 112 [2022-07-21 17:27:23,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-21 17:27:23,027 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 110 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:23,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 326 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2022-07-21 17:27:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-21 17:27:23,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2022-07-21 17:27:23,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 96 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:27:23,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2022-07-21 17:27:23,030 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 61 [2022-07-21 17:27:23,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:23,030 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2022-07-21 17:27:23,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:27:23,030 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-07-21 17:27:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-21 17:27:23,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:23,030 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:27:23,040 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-21 17:27:23,240 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-21 17:27:23,240 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:23,241 INFO L85 PathProgramCache]: Analyzing trace with hash 392980164, now seen corresponding path program 1 times [2022-07-21 17:27:23,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:23,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863933856] [2022-07-21 17:27:23,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:23,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:23,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:23,242 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-21 17:27:23,243 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-21 17:27:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:23,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-21 17:27:23,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:23,546 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-21 17:27:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:23,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:23,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:23,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863933856] [2022-07-21 17:27:23,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863933856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:23,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:23,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 17:27:23,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897742634] [2022-07-21 17:27:23,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:23,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 17:27:23,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:23,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 17:27:23,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:27:23,806 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:27:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:24,173 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-07-21 17:27:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:27:24,173 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2022-07-21 17:27:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:24,174 INFO L225 Difference]: With dead ends: 103 [2022-07-21 17:27:24,174 INFO L226 Difference]: Without dead ends: 103 [2022-07-21 17:27:24,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-21 17:27:24,175 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 146 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:24,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 377 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 259 Invalid, 0 Unknown, 8 Unchecked, 0.3s Time] [2022-07-21 17:27:24,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-21 17:27:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-21 17:27:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 94 states have internal predecessors, (97), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:27:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2022-07-21 17:27:24,177 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 61 [2022-07-21 17:27:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:24,177 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2022-07-21 17:27:24,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:27:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-07-21 17:27:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 17:27:24,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:24,178 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:27:24,190 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-21 17:27:24,378 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-21 17:27:24,378 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:24,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash -808735445, now seen corresponding path program 1 times [2022-07-21 17:27:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:24,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997246787] [2022-07-21 17:27:24,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:24,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:24,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:24,380 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-21 17:27:24,381 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-21 17:27:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:24,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-21 17:27:24,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:24,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:24,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:24,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997246787] [2022-07-21 17:27:24,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997246787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:24,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:24,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 17:27:24,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326116023] [2022-07-21 17:27:24,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:24,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 17:27:24,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:24,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 17:27:24,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:27:24,997 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:27:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:25,264 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2022-07-21 17:27:25,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:27:25,267 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2022-07-21 17:27:25,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:25,267 INFO L225 Difference]: With dead ends: 102 [2022-07-21 17:27:25,267 INFO L226 Difference]: Without dead ends: 102 [2022-07-21 17:27:25,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-21 17:27:25,268 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 157 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:25,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 383 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 185 Invalid, 0 Unknown, 7 Unchecked, 0.2s Time] [2022-07-21 17:27:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-21 17:27:25,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-21 17:27:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.103448275862069) internal successors, (96), 93 states have internal predecessors, (96), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:27:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2022-07-21 17:27:25,277 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 64 [2022-07-21 17:27:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:25,277 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2022-07-21 17:27:25,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:27:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2022-07-21 17:27:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-21 17:27:25,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:25,278 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:25,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-21 17:27:25,487 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-21 17:27:25,487 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:25,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:25,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1477848750, now seen corresponding path program 1 times [2022-07-21 17:27:25,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:25,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001560496] [2022-07-21 17:27:25,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:25,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:25,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:25,489 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-21 17:27:25,489 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-21 17:27:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:25,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 17:27:25,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:25,793 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-21 17:27:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:25,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:27:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:26,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:26,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001560496] [2022-07-21 17:27:26,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001560496] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:27:26,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:27:26,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-07-21 17:27:26,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745214386] [2022-07-21 17:27:26,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:27:26,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 17:27:26,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:26,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 17:27:26,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:27:26,123 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-21 17:27:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:26,390 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2022-07-21 17:27:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 17:27:26,400 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 68 [2022-07-21 17:27:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:26,401 INFO L225 Difference]: With dead ends: 128 [2022-07-21 17:27:26,401 INFO L226 Difference]: Without dead ends: 128 [2022-07-21 17:27:26,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-07-21 17:27:26,401 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 152 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:26,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 385 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 234 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2022-07-21 17:27:26,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-21 17:27:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2022-07-21 17:27:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.1020408163265305) internal successors, (108), 104 states have internal predecessors, (108), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-21 17:27:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2022-07-21 17:27:26,404 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 68 [2022-07-21 17:27:26,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:26,404 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2022-07-21 17:27:26,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-21 17:27:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2022-07-21 17:27:26,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-21 17:27:26,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:26,405 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:27:26,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-21 17:27:26,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:27:26,615 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:26,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:26,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1729031655, now seen corresponding path program 1 times [2022-07-21 17:27:26,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:26,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939589890] [2022-07-21 17:27:26,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:26,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:26,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:26,618 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:27:26,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-21 17:27:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:27,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-21 17:27:27,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:27,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:27,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:27,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:27,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:27,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:27,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:27,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2022-07-21 17:27:31,046 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2206 (_ BitVec 8)) (v_ArrVal_2208 (_ BitVec 8))) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2206) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2208)) |c_#memory_int|)) is different from true [2022-07-21 17:27:31,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:31,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:31,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:31,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2022-07-21 17:27:31,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:31,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:31,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:31,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:31,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:31,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:31,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:27:31,306 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:27:31,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 69 [2022-07-21 17:27:31,449 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:27:31,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 23 [2022-07-21 17:27:31,646 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:31,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:27:31,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:31,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939589890] [2022-07-21 17:27:31,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939589890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:27:31,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:27:31,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-07-21 17:27:31,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177808612] [2022-07-21 17:27:31,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:27:31,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 17:27:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:31,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 17:27:31,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=591, Unknown=2, NotChecked=48, Total=702 [2022-07-21 17:27:31,647 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 24 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:27:32,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:32,355 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-07-21 17:27:32,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 17:27:32,357 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 24 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2022-07-21 17:27:32,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:32,357 INFO L225 Difference]: With dead ends: 100 [2022-07-21 17:27:32,357 INFO L226 Difference]: Without dead ends: 100 [2022-07-21 17:27:32,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=134, Invalid=1128, Unknown=2, NotChecked=68, Total=1332 [2022-07-21 17:27:32,358 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 35 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 324 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:32,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 934 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 253 Invalid, 0 Unknown, 324 Unchecked, 0.4s Time] [2022-07-21 17:27:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-21 17:27:32,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2022-07-21 17:27:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 87 states have internal predecessors, (90), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:27:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2022-07-21 17:27:32,360 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 67 [2022-07-21 17:27:32,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:32,361 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2022-07-21 17:27:32,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 24 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:27:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2022-07-21 17:27:32,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-21 17:27:32,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:32,361 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:32,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-21 17:27:32,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:27:32,573 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:32,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:32,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1342862122, now seen corresponding path program 1 times [2022-07-21 17:27:32,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:32,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564425776] [2022-07-21 17:27:32,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:32,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:32,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:32,575 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-21 17:27:32,579 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-21 17:27:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:32,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-21 17:27:32,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:32,929 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-21 17:27:33,084 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:33,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:27:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:27:33,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:27:33,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564425776] [2022-07-21 17:27:33,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564425776] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:27:33,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:27:33,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2022-07-21 17:27:33,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984270236] [2022-07-21 17:27:33,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:27:33,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 17:27:33,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:27:33,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 17:27:33,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:27:33,223 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-21 17:27:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:27:33,538 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-07-21 17:27:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 17:27:33,539 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 74 [2022-07-21 17:27:33,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:27:33,539 INFO L225 Difference]: With dead ends: 102 [2022-07-21 17:27:33,539 INFO L226 Difference]: Without dead ends: 102 [2022-07-21 17:27:33,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-07-21 17:27:33,540 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 68 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:27:33,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 414 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 241 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2022-07-21 17:27:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-21 17:27:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2022-07-21 17:27:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.072289156626506) internal successors, (89), 86 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:27:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2022-07-21 17:27:33,542 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 74 [2022-07-21 17:27:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:27:33,542 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2022-07-21 17:27:33,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-21 17:27:33,542 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-07-21 17:27:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-21 17:27:33,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:27:33,543 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:27:33,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-21 17:27:33,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:27:33,743 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:27:33,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:27:33,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1943196067, now seen corresponding path program 1 times [2022-07-21 17:27:33,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:27:33,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209143886] [2022-07-21 17:27:33,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:27:33,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:27:33,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:27:33,745 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:27:33,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-21 17:27:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:27:34,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 114 conjunts are in the unsatisfiable core [2022-07-21 17:27:34,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:27:34,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:34,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:34,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:34,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:34,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:34,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:34,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:34,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:34,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:34,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:27:34,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:27:34,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2022-07-21 17:27:38,838 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2561 (_ BitVec 8)) (v_ArrVal_2564 (_ BitVec 8))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2561) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2564)))) is different from true [2022-07-21 17:27:38,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:38,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:38,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:38,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:38,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:38,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:38,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:38,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:38,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:38,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:38,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:38,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:38,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:38,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:38,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:38,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:27:38,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 71 [2022-07-21 17:27:39,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:27:39,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:27:39,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:27:39,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:27:39,175 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:27:39,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 193 treesize of output 165 [2022-07-21 17:27:39,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:27:39,700 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:27:39,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 137 [2022-07-21 17:27:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-07-21 17:27:44,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:28:07,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:07,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209143886] [2022-07-21 17:28:07,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209143886] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:28:07,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [92098343] [2022-07-21 17:28:07,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:07,631 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:28:07,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:28:07,633 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:28:07,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-07-21 17:28:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:09,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 131 conjunts are in the unsatisfiable core [2022-07-21 17:28:09,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:10,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:10,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:10,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:10,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:10,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:10,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:10,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:10,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:10,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:10,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:28:10,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:28:10,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2022-07-21 17:28:13,532 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2765 (_ BitVec 8)) (v_ArrVal_2561 (_ BitVec 8))) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2561) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2765)) |c_#memory_int|)) is different from true [2022-07-21 17:28:13,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:28:13,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 71 [2022-07-21 17:28:13,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:28:13,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:28:13,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:28:13,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:28:13,687 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:28:13,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 193 treesize of output 165 [2022-07-21 17:28:13,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:13,946 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:28:13,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 137 [2022-07-21 17:28:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 17:28:14,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:28:15,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [92098343] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:28:15,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:28:15,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 43] total 44 [2022-07-21 17:28:15,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89272566] [2022-07-21 17:28:15,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:28:15,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-21 17:28:15,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:15,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-21 17:28:15,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3825, Unknown=13, NotChecked=250, Total=4290 [2022-07-21 17:28:15,725 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 44 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 41 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-21 17:28:19,517 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2561 (_ BitVec 8)) (v_ArrVal_2564 (_ BitVec 8))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2561) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2564)))) (exists ((v_ArrVal_2765 (_ BitVec 8)) (v_ArrVal_2561 (_ BitVec 8))) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2561) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2765)) |c_#memory_int|))) is different from true [2022-07-21 17:29:01,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:01,038 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2022-07-21 17:29:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-21 17:29:01,040 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 41 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 79 [2022-07-21 17:29:01,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:01,040 INFO L225 Difference]: With dead ends: 99 [2022-07-21 17:29:01,040 INFO L226 Difference]: Without dead ends: 95 [2022-07-21 17:29:01,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 171 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 79.4s TimeCoverageRelationStatistics Valid=523, Invalid=7297, Unknown=24, NotChecked=528, Total=8372 [2022-07-21 17:29:01,042 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 121 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:01,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 898 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1282 Invalid, 0 Unknown, 240 Unchecked, 2.3s Time] [2022-07-21 17:29:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-21 17:29:01,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-07-21 17:29:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 86 states have internal predecessors, (88), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:29:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2022-07-21 17:29:01,044 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 79 [2022-07-21 17:29:01,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:01,045 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2022-07-21 17:29:01,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 41 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-21 17:29:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-07-21 17:29:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-21 17:29:01,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:01,045 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:29:01,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-21 17:29:01,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-07-21 17:29:01,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-21 17:29:01,446 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:29:01,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash -826672710, now seen corresponding path program 1 times [2022-07-21 17:29:01,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:01,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432239496] [2022-07-21 17:29:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:01,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:01,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:01,448 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-21 17:29:01,448 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-21 17:29:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:01,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 156 conjunts are in the unsatisfiable core [2022-07-21 17:29:01,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:01,972 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-21 17:29:01,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,000 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 21 treesize of output 20 [2022-07-21 17:29:02,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:02,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:02,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,090 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 21 treesize of output 20 [2022-07-21 17:29:02,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,122 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 21 treesize of output 20 [2022-07-21 17:29:02,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:02,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,194 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 21 treesize of output 20 [2022-07-21 17:29:02,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,228 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 21 treesize of output 20 [2022-07-21 17:29:02,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,265 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 21 treesize of output 20 [2022-07-21 17:29:02,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:02,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,343 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 21 treesize of output 20 [2022-07-21 17:29:02,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,386 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 21 treesize of output 20 [2022-07-21 17:29:02,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:02,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:02,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,520 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 21 treesize of output 20 [2022-07-21 17:29:02,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:07,786 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3001 (_ BitVec 32)) (v_ArrVal_2999 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2999) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3001)))) is different from true [2022-07-21 17:29:07,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:07,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:07,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:07,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-21 17:29:07,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:07,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:07,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:07,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:07,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:07,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:07,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:07,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:07,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:07,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:07,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:10,121 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3010 (_ BitVec 32)) (v_ArrVal_3009 (_ BitVec 32)) (v_ArrVal_3007 (_ BitVec 32)) (v_ArrVal_3008 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3007) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3009) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3008) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3010)) |c_#memory_$Pointer$.offset|)) is different from true [2022-07-21 17:29:10,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:10,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:10,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2022-07-21 17:29:10,444 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-21 17:29:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-21 17:29:10,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:29:12,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:12,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432239496] [2022-07-21 17:29:12,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432239496] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:29:12,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1364299781] [2022-07-21 17:29:12,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:12,835 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:29:12,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:29:12,836 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-21 17:29:12,836 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-21 17:29:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:13,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 152 conjunts are in the unsatisfiable core [2022-07-21 17:29:13,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:13,542 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-21 17:29:13,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:13,553 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 21 treesize of output 20 [2022-07-21 17:29:13,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:13,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:13,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:13,598 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 21 treesize of output 20 [2022-07-21 17:29:13,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:13,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:13,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:13,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:13,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:13,681 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 21 treesize of output 20 [2022-07-21 17:29:13,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:13,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:29:13,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:13,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:13,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:13,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:13,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:13,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:13,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:13,834 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 21 treesize of output 20 [2022-07-21 17:29:13,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:13,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:13,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:13,900 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 21 treesize of output 20 [2022-07-21 17:29:13,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:13,939 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 21 treesize of output 20 [2022-07-21 17:29:13,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:13,971 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 21 treesize of output 20 [2022-07-21 17:29:14,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:14,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:14,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:14,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:14,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:14,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:14,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:14,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:14,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:14,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:14,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:17,166 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2999 (_ BitVec 32)) (v_ArrVal_3248 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2999) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3248)))) is different from true [2022-07-21 17:29:17,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:17,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:17,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:17,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-21 17:29:17,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:17,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:17,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:17,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:17,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:17,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:17,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:17,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:17,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:17,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:17,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:19,272 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3256 (_ BitVec 32)) (v_ArrVal_3257 (_ BitVec 32)) (v_ArrVal_3258 (_ BitVec 32)) (v_ArrVal_3259 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3256) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3257) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3259) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3258)))) is different from true [2022-07-21 17:29:19,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:19,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:19,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:19,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:19,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:19,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:19,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:19,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:19,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:19,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:19,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:19,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2022-07-21 17:29:19,513 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:29:19,514 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-21 17:29:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-21 17:29:19,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:29:20,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1364299781] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:29:20,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:29:20,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 44] total 50 [2022-07-21 17:29:20,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690312216] [2022-07-21 17:29:20,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:29:20,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-21 17:29:20,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:20,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-21 17:29:20,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3927, Unknown=5, NotChecked=516, Total=4692 [2022-07-21 17:29:20,972 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 51 states, 50 states have (on average 1.84) internal successors, (92), 48 states have internal predecessors, (92), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-21 17:29:25,631 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2999 (_ BitVec 32)) (v_ArrVal_3248 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2999) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3248)))) (exists ((v_ArrVal_3001 (_ BitVec 32)) (v_ArrVal_2999 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2999) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3001))))) is different from true [2022-07-21 17:29:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:32,918 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-07-21 17:29:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-21 17:29:32,919 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.84) internal successors, (92), 48 states have internal predecessors, (92), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 80 [2022-07-21 17:29:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:32,919 INFO L225 Difference]: With dead ends: 94 [2022-07-21 17:29:32,919 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 17:29:32,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 139 SyntacticMatches, 11 SemanticMatches, 97 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2283 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=520, Invalid=8235, Unknown=7, NotChecked=940, Total=9702 [2022-07-21 17:29:32,922 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 163 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:32,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 838 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1606 Invalid, 0 Unknown, 398 Unchecked, 2.2s Time] [2022-07-21 17:29:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 17:29:32,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-21 17:29:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 85 states have internal predecessors, (87), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:29:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2022-07-21 17:29:32,924 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 80 [2022-07-21 17:29:32,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:32,924 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2022-07-21 17:29:32,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.84) internal successors, (92), 48 states have internal predecessors, (92), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-21 17:29:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-07-21 17:29:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-21 17:29:32,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:32,925 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:29:32,933 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-21 17:29:33,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-07-21 17:29:33,332 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-21 17:29:33,332 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:29:33,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:33,332 INFO L85 PathProgramCache]: Analyzing trace with hash 142949917, now seen corresponding path program 1 times [2022-07-21 17:29:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:33,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399702371] [2022-07-21 17:29:33,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:33,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:33,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:33,334 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-21 17:29:33,335 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-21 17:29:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:33,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 156 conjunts are in the unsatisfiable core [2022-07-21 17:29:33,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:33,927 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-21 17:29:33,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:33,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:34,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:34,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,075 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 21 treesize of output 20 [2022-07-21 17:29:34,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:34,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,154 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 21 treesize of output 20 [2022-07-21 17:29:34,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:34,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,234 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 21 treesize of output 20 [2022-07-21 17:29:34,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:34,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,314 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 21 treesize of output 20 [2022-07-21 17:29:34,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,371 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 21 treesize of output 20 [2022-07-21 17:29:34,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,410 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 21 treesize of output 20 [2022-07-21 17:29:34,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,455 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 21 treesize of output 20 [2022-07-21 17:29:34,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,499 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 21 treesize of output 20 [2022-07-21 17:29:34,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,557 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 21 treesize of output 20 [2022-07-21 17:29:34,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:39,970 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3486 (_ BitVec 32)) (v_ArrVal_3489 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3486) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3489)) |c_#memory_$Pointer$.base|)) is different from true [2022-07-21 17:29:39,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:39,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:39,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:39,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-21 17:29:40,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:40,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:40,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:40,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:40,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:40,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:40,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:40,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:40,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:40,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:40,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:42,340 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3498 (_ BitVec 32)) (v_ArrVal_3499 (_ BitVec 32)) (v_ArrVal_3496 (_ BitVec 32)) (v_ArrVal_3497 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3498) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3499) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3496) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3497)))) is different from true [2022-07-21 17:29:42,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:42,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:42,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2022-07-21 17:29:42,643 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-21 17:29:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-21 17:29:42,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:29:45,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:45,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399702371] [2022-07-21 17:29:45,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399702371] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:29:45,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1699797779] [2022-07-21 17:29:45,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:45,190 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:29:45,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:29:45,191 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-21 17:29:45,192 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-21 17:29:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:45,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 152 conjunts are in the unsatisfiable core [2022-07-21 17:29:45,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:45,953 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 14 treesize of output 10 [2022-07-21 17:29:45,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:45,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:45,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:45,992 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 21 treesize of output 20 [2022-07-21 17:29:46,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,017 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 21 treesize of output 20 [2022-07-21 17:29:46,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:46,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,070 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 21 treesize of output 20 [2022-07-21 17:29:46,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,113 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 21 treesize of output 20 [2022-07-21 17:29:46,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,127 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 21 treesize of output 20 [2022-07-21 17:29:46,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,157 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 21 treesize of output 20 [2022-07-21 17:29:46,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:46,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:46,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:46,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:29:46,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,314 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 21 treesize of output 20 [2022-07-21 17:29:46,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,357 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 21 treesize of output 20 [2022-07-21 17:29:46,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,381 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 21 treesize of output 20 [2022-07-21 17:29:46,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:46,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, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:49,836 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3486 (_ BitVec 32)) (v_ArrVal_3736 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3486) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3736)))) is different from true [2022-07-21 17:29:49,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:49,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:49,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:49,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-21 17:29:49,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:49,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:49,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:49,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:49,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:49,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:49,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:49,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:49,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:49,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:49,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:52,002 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3746 (_ BitVec 32)) (v_ArrVal_3744 (_ BitVec 32)) (v_ArrVal_3745 (_ BitVec 32)) (v_ArrVal_3743 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3746) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3744) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3745) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3743)))) is different from true [2022-07-21 17:29:52,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:52,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:52,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:52,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:52,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:52,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:52,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:52,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:52,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:52,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:52,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:52,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, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2022-07-21 17:29:52,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:29:52,268 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-21 17:29:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-21 17:29:52,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:29:53,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1699797779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:29:53,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:29:53,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46] total 52 [2022-07-21 17:29:53,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819000945] [2022-07-21 17:29:53,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:29:53,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-21 17:29:53,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:53,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-21 17:29:53,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=4040, Unknown=5, NotChecked=524, Total=4830 [2022-07-21 17:29:53,896 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 52 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 49 states have internal predecessors, (93), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-21 17:29:57,929 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3486 (_ BitVec 32)) (v_ArrVal_3489 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3486) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3489)) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3486 (_ BitVec 32)) (v_ArrVal_3736 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3486) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3736))))) is different from true [2022-07-21 17:30:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:05,183 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-07-21 17:30:05,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-21 17:30:05,184 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 49 states have internal predecessors, (93), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 81 [2022-07-21 17:30:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:05,184 INFO L225 Difference]: With dead ends: 90 [2022-07-21 17:30:05,184 INFO L226 Difference]: Without dead ends: 89 [2022-07-21 17:30:05,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 142 SyntacticMatches, 11 SemanticMatches, 84 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=441, Invalid=6052, Unknown=7, NotChecked=810, Total=7310 [2022-07-21 17:30:05,186 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 141 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:05,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 603 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1422 Invalid, 0 Unknown, 367 Unchecked, 2.3s Time] [2022-07-21 17:30:05,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-21 17:30:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-21 17:30:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:30:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-07-21 17:30:05,188 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 81 [2022-07-21 17:30:05,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:05,188 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-07-21 17:30:05,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 49 states have internal predecessors, (93), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-21 17:30:05,188 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-07-21 17:30:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-21 17:30:05,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:05,189 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:05,202 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-21 17:30:05,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2022-07-21 17:30:05,595 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-21 17:30:05,595 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-21 17:30:05,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:05,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2138038455, now seen corresponding path program 1 times [2022-07-21 17:30:05,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:30:05,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860248550] [2022-07-21 17:30:05,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:05,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:30:05,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:30:05,636 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-21 17:30:05,637 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-21 17:30:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:06,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-21 17:30:06,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:30:06,349 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 0 case distinctions, treesize of input 13 treesize of output 10 [2022-07-21 17:30:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-21 17:30:06,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:30:11,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:30:11,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860248550] [2022-07-21 17:30:11,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860248550] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:30:11,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [789540920] [2022-07-21 17:30:11,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:11,204 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:30:11,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:30:11,205 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-21 17:30:11,205 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-21 17:30:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:11,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-21 17:30:11,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:30:12,227 INFO L356 Elim1Store]: treesize reduction 16, result has 42.9 percent of original size [2022-07-21 17:30:12,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-21 17:30:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-21 17:30:12,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:30:16,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [789540920] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:30:16,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:30:16,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2022-07-21 17:30:16,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593709960] [2022-07-21 17:30:16,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:30:16,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 17:30:16,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:30:16,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 17:30:16,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=721, Unknown=2, NotChecked=0, Total=812 [2022-07-21 17:30:16,859 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand has 20 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-21 17:30:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:16,971 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-07-21 17:30:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 17:30:16,972 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 88 [2022-07-21 17:30:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:16,972 INFO L225 Difference]: With dead ends: 88 [2022-07-21 17:30:16,972 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 17:30:16,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 306 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=108, Invalid=820, Unknown=2, NotChecked=0, Total=930 [2022-07-21 17:30:16,973 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 30 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:16,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 490 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 179 Unchecked, 0.1s Time] [2022-07-21 17:30:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 17:30:16,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 17:30:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 17:30:16,974 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2022-07-21 17:30:16,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:16,974 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 17:30:16,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-21 17:30:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 17:30:16,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 17:30:16,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 25 remaining) [2022-07-21 17:30:16,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2022-07-21 17:30:16,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 25 remaining) [2022-07-21 17:30:16,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 25 remaining) [2022-07-21 17:30:16,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 25 remaining) [2022-07-21 17:30:16,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 25 remaining) [2022-07-21 17:30:16,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 25 remaining) [2022-07-21 17:30:16,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 25 remaining) [2022-07-21 17:30:16,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (16 of 25 remaining) [2022-07-21 17:30:16,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 25 remaining) [2022-07-21 17:30:16,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 25 remaining) [2022-07-21 17:30:16,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 25 remaining) [2022-07-21 17:30:16,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 25 remaining) [2022-07-21 17:30:16,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 25 remaining) [2022-07-21 17:30:16,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 25 remaining) [2022-07-21 17:30:16,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 25 remaining) [2022-07-21 17:30:16,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 25 remaining) [2022-07-21 17:30:16,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 25 remaining) [2022-07-21 17:30:16,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 25 remaining) [2022-07-21 17:30:16,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (5 of 25 remaining) [2022-07-21 17:30:16,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 25 remaining) [2022-07-21 17:30:16,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 25 remaining) [2022-07-21 17:30:16,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 25 remaining) [2022-07-21 17:30:16,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 25 remaining) [2022-07-21 17:30:16,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (0 of 25 remaining) [2022-07-21 17:30:16,994 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-21 17:30:17,199 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-21 17:30:17,392 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-21 17:30:17,394 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:17,396 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 17:30:17,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:30:17 BoogieIcfgContainer [2022-07-21 17:30:17,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 17:30:17,397 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 17:30:17,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 17:30:17,398 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 17:30:17,398 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:27:08" (3/4) ... [2022-07-21 17:30:17,399 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 17:30:17,403 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-21 17:30:17,403 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-07-21 17:30:17,403 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-07-21 17:30:17,410 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2022-07-21 17:30:17,410 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-21 17:30:17,410 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-21 17:30:17,411 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 17:30:17,451 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 17:30:17,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 17:30:17,452 INFO L158 Benchmark]: Toolchain (without parser) took 190225.83ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 38.2MB in the beginning and 31.6MB in the end (delta: 6.6MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2022-07-21 17:30:17,455 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:30:17,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.35ms. Allocated memory is still 58.7MB. Free memory was 38.0MB in the beginning and 24.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 17:30:17,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.92ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 24.9MB in the beginning and 52.4MB in the end (delta: -27.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-07-21 17:30:17,461 INFO L158 Benchmark]: Boogie Preprocessor took 51.86ms. Allocated memory is still 71.3MB. Free memory was 52.4MB in the beginning and 50.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:30:17,462 INFO L158 Benchmark]: RCFGBuilder took 624.24ms. Allocated memory is still 71.3MB. Free memory was 50.0MB in the beginning and 49.0MB in the end (delta: 999.8kB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2022-07-21 17:30:17,462 INFO L158 Benchmark]: TraceAbstraction took 188943.62ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 48.6MB in the beginning and 35.6MB in the end (delta: 13.1MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2022-07-21 17:30:17,462 INFO L158 Benchmark]: Witness Printer took 53.61ms. Allocated memory is still 86.0MB. Free memory was 35.6MB in the beginning and 31.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 17:30:17,463 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.18ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.35ms. Allocated memory is still 58.7MB. Free memory was 38.0MB in the beginning and 24.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.92ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 24.9MB in the beginning and 52.4MB in the end (delta: -27.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.86ms. Allocated memory is still 71.3MB. Free memory was 52.4MB in the beginning and 50.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 624.24ms. Allocated memory is still 71.3MB. Free memory was 50.0MB in the beginning and 49.0MB in the end (delta: 999.8kB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * TraceAbstraction took 188943.62ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 48.6MB in the beginning and 35.6MB in the end (delta: 13.1MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * Witness Printer took 53.61ms. Allocated memory is still 86.0MB. Free memory was 35.6MB in the beginning and 31.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 764]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 188.9s, OverallIterations: 33, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 74.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2578 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2555 mSDsluCounter, 15831 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1706 IncrementalHoareTripleChecker+Unchecked, 13372 mSDsCounter, 393 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8375 IncrementalHoareTripleChecker+Invalid, 10474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 393 mSolverCounterUnsat, 2459 mSDtfsCounter, 8375 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2427 GetRequests, 1752 SyntacticMatches, 48 SemanticMatches, 627 ConstructedPredicates, 14 IntricatePredicates, 4 DeprecatedPredicates, 6959 ImplicationChecksByTransitivity, 147.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=27, InterpolantAutomatonStates: 436, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 304 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 96.4s InterpolantComputationTime, 1724 NumberOfCodeBlocks, 1694 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1889 ConstructedInterpolants, 220 QuantifiedInterpolants, 19148 SizeOfPredicates, 778 NumberOfNonLiveVariables, 11005 ConjunctsInSsa, 1408 ConjunctsInUnsatCore, 42 InterpolantComputations, 24 PerfectInterpolantSequences, 2959/3841 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 25 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-21 17:30:17,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE