./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-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 14e3e63e231fa0c862b0912d52fb4325a0198eb4d9a43387e9996f85700980cb --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:56:41,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:56:41,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:56:41,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:56:41,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:56:41,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:56:41,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:56:41,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:56:41,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:56:41,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:56:41,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:56:41,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:56:41,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:56:41,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:56:41,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:56:41,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:56:41,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:56:41,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:56:41,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:56:41,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:56:41,333 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:56:41,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:56:41,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:56:41,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:56:41,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:56:41,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:56:41,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:56:41,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:56:41,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:56:41,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:56:41,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:56:41,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:56:41,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:56:41,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:56:41,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:56:41,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:56:41,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:56:41,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:56:41,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:56:41,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:56:41,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:56:41,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:56:41,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:56:41,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:56:41,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:56:41,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:56:41,373 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:56:41,373 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:56:41,373 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:56:41,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:56:41,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:56:41,374 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:56:41,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:56:41,375 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:56:41,375 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:56:41,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:56:41,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:56:41,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:56:41,376 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:56:41,376 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:56:41,376 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:56:41,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:56:41,377 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:56:41,377 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:56:41,377 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:56:41,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:56:41,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:56:41,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:56:41,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:56:41,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:56:41,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:56:41,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:56:41,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:56:41,379 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 -> 14e3e63e231fa0c862b0912d52fb4325a0198eb4d9a43387e9996f85700980cb [2022-07-12 18:56:41,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:56:41,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:56:41,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:56:41,576 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:56:41,577 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:56:41,578 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2022-07-12 18:56:41,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51a68063/f38e65ffb6dc417d88c1c9733b4e71f0/FLAG4efa18959 [2022-07-12 18:56:42,034 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:56:42,038 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2022-07-12 18:56:42,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51a68063/f38e65ffb6dc417d88c1c9733b4e71f0/FLAG4efa18959 [2022-07-12 18:56:42,062 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51a68063/f38e65ffb6dc417d88c1c9733b4e71f0 [2022-07-12 18:56:42,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:56:42,065 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:56:42,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:56:42,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:56:42,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:56:42,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:56:42" (1/1) ... [2022-07-12 18:56:42,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@715d912a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:42, skipping insertion in model container [2022-07-12 18:56:42,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:56:42" (1/1) ... [2022-07-12 18:56:42,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:56:42,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:56:42,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:56:42,437 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-12 18:56:42,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@15870d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:42, skipping insertion in model container [2022-07-12 18:56:42,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:56:42,438 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-12 18:56:42,440 INFO L158 Benchmark]: Toolchain (without parser) took 373.96ms. Allocated memory was 107.0MB in the beginning and 142.6MB in the end (delta: 35.7MB). Free memory was 75.4MB in the beginning and 113.2MB in the end (delta: -37.8MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2022-07-12 18:56:42,441 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:56:42,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.38ms. Allocated memory was 107.0MB in the beginning and 142.6MB in the end (delta: 35.7MB). Free memory was 75.2MB in the beginning and 113.2MB in the end (delta: -38.0MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2022-07-12 18:56:42,443 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.38ms. Allocated memory was 107.0MB in the beginning and 142.6MB in the end (delta: 35.7MB). Free memory was 75.2MB in the beginning and 113.2MB in the end (delta: -38.0MB). Peak memory consumption was 10.1MB. 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_3-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 14e3e63e231fa0c862b0912d52fb4325a0198eb4d9a43387e9996f85700980cb --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:56:43,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:56:43,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:56:43,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:56:43,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:56:43,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:56:43,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:56:43,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:56:43,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:56:43,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:56:43,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:56:43,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:56:43,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:56:43,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:56:43,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:56:43,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:56:43,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:56:43,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:56:43,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:56:43,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:56:43,878 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:56:43,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:56:43,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:56:43,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:56:43,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:56:43,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:56:43,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:56:43,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:56:43,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:56:43,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:56:43,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:56:43,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:56:43,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:56:43,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:56:43,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:56:43,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:56:43,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:56:43,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:56:43,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:56:43,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:56:43,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:56:43,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:56:43,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 18:56:43,929 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:56:43,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:56:43,929 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:56:43,929 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:56:43,930 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:56:43,930 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:56:43,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:56:43,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:56:43,931 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:56:43,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:56:43,932 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:56:43,932 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:56:43,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:56:43,932 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:56:43,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:56:43,951 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:56:43,951 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:56:43,951 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:56:43,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:56:43,951 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:56:43,952 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 18:56:43,952 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 18:56:43,952 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:56:43,952 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:56:43,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:56:43,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:56:43,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:56:43,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:56:43,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:56:43,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:56:43,953 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 18:56:43,953 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 18:56:43,954 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 18:56:43,954 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 -> 14e3e63e231fa0c862b0912d52fb4325a0198eb4d9a43387e9996f85700980cb [2022-07-12 18:56:44,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:56:44,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:56:44,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:56:44,197 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:56:44,197 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:56:44,198 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2022-07-12 18:56:44,258 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8cd87b75/658c2081558047ba974bee479733313a/FLAG10491603d [2022-07-12 18:56:44,645 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:56:44,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2022-07-12 18:56:44,659 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8cd87b75/658c2081558047ba974bee479733313a/FLAG10491603d [2022-07-12 18:56:45,035 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8cd87b75/658c2081558047ba974bee479733313a [2022-07-12 18:56:45,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:56:45,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:56:45,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:56:45,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:56:45,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:56:45,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:56:45" (1/1) ... [2022-07-12 18:56:45,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7960885c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:45, skipping insertion in model container [2022-07-12 18:56:45,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:56:45" (1/1) ... [2022-07-12 18:56:45,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:56:45,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:56:45,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:56:45,302 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-12 18:56:45,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:56:45,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:56:45,347 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:56:45,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:56:45,419 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:56:45,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:45 WrapperNode [2022-07-12 18:56:45,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:56:45,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:56:45,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:56:45,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:56:45,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:45" (1/1) ... [2022-07-12 18:56:45,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:45" (1/1) ... [2022-07-12 18:56:45,483 INFO L137 Inliner]: procedures = 165, calls = 70, calls flagged for inlining = 22, calls inlined = 14, statements flattened = 100 [2022-07-12 18:56:45,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:56:45,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:56:45,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:56:45,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:56:45,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:45" (1/1) ... [2022-07-12 18:56:45,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:45" (1/1) ... [2022-07-12 18:56:45,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:45" (1/1) ... [2022-07-12 18:56:45,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:45" (1/1) ... [2022-07-12 18:56:45,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:45" (1/1) ... [2022-07-12 18:56:45,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:45" (1/1) ... [2022-07-12 18:56:45,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:45" (1/1) ... [2022-07-12 18:56:45,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:56:45,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:56:45,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:56:45,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:56:45,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:45" (1/1) ... [2022-07-12 18:56:45,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:56:45,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:56:45,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 18:56:45,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 18:56:45,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 18:56:45,584 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-07-12 18:56:45,585 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-07-12 18:56:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 18:56:45,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 18:56:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-07-12 18:56:45,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-07-12 18:56:45,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:56:45,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:56:45,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:56:45,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:56:45,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 18:56:45,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:56:45,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 18:56:45,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:56:45,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:56:45,706 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:56:45,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:56:45,993 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:56:46,008 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:56:46,008 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 18:56:46,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:56:46 BoogieIcfgContainer [2022-07-12 18:56:46,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:56:46,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:56:46,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:56:46,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:56:46,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:56:45" (1/3) ... [2022-07-12 18:56:46,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28639ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:56:46, skipping insertion in model container [2022-07-12 18:56:46,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:45" (2/3) ... [2022-07-12 18:56:46,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28639ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:56:46, skipping insertion in model container [2022-07-12 18:56:46,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:56:46" (3/3) ... [2022-07-12 18:56:46,020 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-2.i [2022-07-12 18:56:46,029 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:56:46,030 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-07-12 18:56:46,064 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:56:46,068 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@751d0570, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d914971 [2022-07-12 18:56:46,069 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-07-12 18:56:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 70 states have internal predecessors, (77), 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-12 18:56:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:56:46,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:46,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:46,076 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:46,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:46,079 INFO L85 PathProgramCache]: Analyzing trace with hash 265003773, now seen corresponding path program 1 times [2022-07-12 18:56:46,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:46,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650034059] [2022-07-12 18:56:46,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:46,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:46,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:46,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:46,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 18:56:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:46,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:56:46,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:46,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:56:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:46,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:46,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:46,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650034059] [2022-07-12 18:56:46,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650034059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:46,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:46,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:56:46,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041842534] [2022-07-12 18:56:46,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:46,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:56:46,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:46,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:56:46,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:56:46,272 INFO L87 Difference]: Start difference. First operand has 77 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 70 states have internal predecessors, (77), 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-12 18:56:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:46,525 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-07-12 18:56:46,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:46,528 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-12 18:56:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:46,533 INFO L225 Difference]: With dead ends: 101 [2022-07-12 18:56:46,534 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 18:56:46,535 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-12 18:56:46,538 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 52 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:46,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 283 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 18:56:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2022-07-12 18:56:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 72 states have internal predecessors, (80), 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-12 18:56:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-07-12 18:56:46,564 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 10 [2022-07-12 18:56:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:46,564 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-07-12 18:56:46,564 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-12 18:56:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-07-12 18:56:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:56:46,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:46,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:46,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-12 18:56:46,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:46,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:46,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:46,768 INFO L85 PathProgramCache]: Analyzing trace with hash 293632924, now seen corresponding path program 1 times [2022-07-12 18:56:46,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:46,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801559043] [2022-07-12 18:56:46,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:46,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:46,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:46,772 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:46,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 18:56:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:46,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:56:46,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:46,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:46,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:46,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801559043] [2022-07-12 18:56:46,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801559043] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:46,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:46,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:56:46,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233226139] [2022-07-12 18:56:46,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:46,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:56:46,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:46,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:56:46,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:56:46,874 INFO L87 Difference]: Start difference. First operand 80 states and 89 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-12 18:56:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:46,892 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-07-12 18:56:46,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:56:46,892 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-12 18:56:46,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:46,893 INFO L225 Difference]: With dead ends: 84 [2022-07-12 18:56:46,893 INFO L226 Difference]: Without dead ends: 84 [2022-07-12 18:56:46,894 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-12 18:56:46,895 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 329 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-12 18:56:46,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 329 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-12 18:56:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2022-07-12 18:56:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 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-12 18:56:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2022-07-12 18:56:46,912 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 10 [2022-07-12 18:56:46,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:46,913 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2022-07-12 18:56:46,913 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-12 18:56:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2022-07-12 18:56:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:56:46,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:46,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:46,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:47,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:47,120 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:47,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:47,120 INFO L85 PathProgramCache]: Analyzing trace with hash -374817580, now seen corresponding path program 1 times [2022-07-12 18:56:47,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:47,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723740079] [2022-07-12 18:56:47,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:47,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:47,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:47,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:47,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 18:56:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:47,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:56:47,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:47,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:56:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:47,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:47,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:47,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723740079] [2022-07-12 18:56:47,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723740079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:47,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:47,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:56:47,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679656461] [2022-07-12 18:56:47,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:47,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:56:47,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:47,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:56:47,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:56:47,244 INFO L87 Difference]: Start difference. First operand 78 states and 86 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-12 18:56:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:47,457 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-07-12 18:56:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:47,458 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-12 18:56:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:47,459 INFO L225 Difference]: With dead ends: 89 [2022-07-12 18:56:47,460 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 18:56:47,460 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-12 18:56:47,461 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:47,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 365 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 18:56:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2022-07-12 18:56:47,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 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-12 18:56:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2022-07-12 18:56:47,467 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 11 [2022-07-12 18:56:47,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:47,468 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2022-07-12 18:56:47,468 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-12 18:56:47,468 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2022-07-12 18:56:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:56:47,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:47,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:47,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:47,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:47,675 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:47,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:47,676 INFO L85 PathProgramCache]: Analyzing trace with hash 700915977, now seen corresponding path program 1 times [2022-07-12 18:56:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:47,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567308768] [2022-07-12 18:56:47,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:47,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:47,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:47,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:47,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 18:56:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:47,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:56:47,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:47,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:47,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:47,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567308768] [2022-07-12 18:56:47,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567308768] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:47,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:47,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:56:47,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148944681] [2022-07-12 18:56:47,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:47,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:56:47,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:47,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:56:47,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:56:47,749 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:47,765 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-07-12 18:56:47,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:56:47,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-12 18:56:47,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:47,768 INFO L225 Difference]: With dead ends: 83 [2022-07-12 18:56:47,768 INFO L226 Difference]: Without dead ends: 83 [2022-07-12 18:56:47,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-12 18:56:47,769 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 19 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 311 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-12 18:56:47,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 311 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-12 18:56:47,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-07-12 18:56:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.5) internal successors, (75), 69 states have internal predecessors, (75), 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-12 18:56:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-07-12 18:56:47,773 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 14 [2022-07-12 18:56:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:47,773 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-07-12 18:56:47,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-07-12 18:56:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:56:47,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:47,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:47,793 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-12 18:56:47,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:47,981 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:47,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:47,981 INFO L85 PathProgramCache]: Analyzing trace with hash 504402472, now seen corresponding path program 1 times [2022-07-12 18:56:47,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:47,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975306491] [2022-07-12 18:56:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:47,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:47,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:47,983 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:47,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 18:56:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:48,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 18:56:48,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:48,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:48,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:48,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975306491] [2022-07-12 18:56:48,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975306491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:48,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:48,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:56:48,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303571289] [2022-07-12 18:56:48,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:48,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:56:48,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:48,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:56:48,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:56:48,090 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-12 18:56:48,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:48,138 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-07-12 18:56:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:48,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 14 [2022-07-12 18:56:48,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:48,141 INFO L225 Difference]: With dead ends: 89 [2022-07-12 18:56:48,141 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 18:56:48,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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-12 18:56:48,144 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 11 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 378 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-12 18:56:48,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 378 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 18:56:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2022-07-12 18:56:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.462962962962963) internal successors, (79), 74 states have internal predecessors, (79), 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-12 18:56:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2022-07-12 18:56:48,162 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 14 [2022-07-12 18:56:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:48,162 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2022-07-12 18:56:48,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-12 18:56:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-07-12 18:56:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:56:48,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:48,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:48,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:48,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:48,364 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:48,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:48,364 INFO L85 PathProgramCache]: Analyzing trace with hash 458362539, now seen corresponding path program 1 times [2022-07-12 18:56:48,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:48,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240590256] [2022-07-12 18:56:48,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:48,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:48,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:48,365 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:48,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 18:56:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:48,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:56:48,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:48,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:48,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:48,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240590256] [2022-07-12 18:56:48,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240590256] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:48,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:48,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:56:48,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167010701] [2022-07-12 18:56:48,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:48,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:56:48,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:48,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:56:48,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:56:48,449 INFO L87 Difference]: Start difference. First operand 84 states and 92 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-12 18:56:48,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:48,474 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-07-12 18:56:48,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:56:48,475 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-12 18:56:48,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:48,475 INFO L225 Difference]: With dead ends: 88 [2022-07-12 18:56:48,475 INFO L226 Difference]: Without dead ends: 88 [2022-07-12 18:56:48,476 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-12 18:56:48,477 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 17 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 232 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-12 18:56:48,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 232 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-12 18:56:48,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2022-07-12 18:56:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 75 states have internal predecessors, (80), 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-12 18:56:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2022-07-12 18:56:48,488 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 16 [2022-07-12 18:56:48,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:48,488 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2022-07-12 18:56:48,488 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-12 18:56:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-07-12 18:56:48,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:56:48,489 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:48,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:48,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:48,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:48,691 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:48,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1265077694, now seen corresponding path program 1 times [2022-07-12 18:56:48,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:48,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783635250] [2022-07-12 18:56:48,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:48,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:48,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:48,697 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:48,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 18:56:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:48,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:56:48,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:48,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:56:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:48,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:48,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783635250] [2022-07-12 18:56:48,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783635250] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:56:48,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:56:48,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 18:56:48,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133154624] [2022-07-12 18:56:48,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:56:48,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:56:48,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:48,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:56:48,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:56:48,800 INFO L87 Difference]: Start difference. First operand 85 states and 93 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-12 18:56:48,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:48,872 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-07-12 18:56:48,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:48,873 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-12 18:56:48,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:48,873 INFO L225 Difference]: With dead ends: 91 [2022-07-12 18:56:48,873 INFO L226 Difference]: Without dead ends: 91 [2022-07-12 18:56:48,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:56:48,874 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 34 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:48,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 343 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-12 18:56:48,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2022-07-12 18:56:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 78 states have internal predecessors, (83), 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-12 18:56:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-07-12 18:56:48,877 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 17 [2022-07-12 18:56:48,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:48,877 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-07-12 18:56:48,877 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-12 18:56:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-07-12 18:56:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:56:48,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:48,877 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:48,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:49,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:49,086 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:49,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:49,087 INFO L85 PathProgramCache]: Analyzing trace with hash 876788587, now seen corresponding path program 2 times [2022-07-12 18:56:49,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:49,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147862265] [2022-07-12 18:56:49,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:56:49,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:49,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:49,090 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:49,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 18:56:49,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 18:56:49,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:56:49,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:56:49,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:49,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:56:49,201 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-12 18:56:49,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:49,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:49,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147862265] [2022-07-12 18:56:49,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147862265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:49,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:49,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:56:49,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876840105] [2022-07-12 18:56:49,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:49,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:56:49,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:49,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:56:49,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:56:49,203 INFO L87 Difference]: Start difference. First operand 88 states and 96 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-12 18:56:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:49,389 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2022-07-12 18:56:49,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:56:49,390 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-12 18:56:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:49,390 INFO L225 Difference]: With dead ends: 94 [2022-07-12 18:56:49,390 INFO L226 Difference]: Without dead ends: 94 [2022-07-12 18:56:49,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:56:49,391 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 35 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:49,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 370 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:49,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-12 18:56:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2022-07-12 18:56:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 77 states have internal predecessors, (82), 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-12 18:56:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-07-12 18:56:49,394 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 20 [2022-07-12 18:56:49,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:49,395 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-07-12 18:56:49,395 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-12 18:56:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-07-12 18:56:49,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:56:49,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:49,395 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:49,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:49,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:49,604 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:49,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:49,604 INFO L85 PathProgramCache]: Analyzing trace with hash 876788588, now seen corresponding path program 1 times [2022-07-12 18:56:49,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:49,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670170186] [2022-07-12 18:56:49,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:49,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:49,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:49,605 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:49,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 18:56:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:49,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:56:49,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:49,731 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-12 18:56:49,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:56:49,850 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-12 18:56:49,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:49,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670170186] [2022-07-12 18:56:49,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670170186] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:56:49,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:56:49,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-12 18:56:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631425782] [2022-07-12 18:56:49,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:56:49,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:56:49,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:49,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:56:49,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:56:49,851 INFO L87 Difference]: Start difference. First operand 87 states and 95 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-12 18:56:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:50,028 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-07-12 18:56:50,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:56:50,028 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-12 18:56:50,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:50,029 INFO L225 Difference]: With dead ends: 96 [2022-07-12 18:56:50,029 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 18:56:50,029 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-12 18:56:50,030 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 32 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:50,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 550 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:56:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 18:56:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2022-07-12 18:56:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.375) internal successors, (88), 83 states have internal predecessors, (88), 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-12 18:56:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-07-12 18:56:50,033 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 20 [2022-07-12 18:56:50,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:50,033 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-07-12 18:56:50,033 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-12 18:56:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-07-12 18:56:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:56:50,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:50,033 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:50,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:50,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:50,234 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1295948282, now seen corresponding path program 1 times [2022-07-12 18:56:50,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:50,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807730556] [2022-07-12 18:56:50,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:50,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:50,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:50,235 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:50,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 18:56:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:50,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:56:50,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:50,304 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-12 18:56:50,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:50,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:50,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807730556] [2022-07-12 18:56:50,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807730556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:50,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:50,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:56:50,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584063996] [2022-07-12 18:56:50,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:50,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:56:50,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:50,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:56:50,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:56:50,306 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-12 18:56:50,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:50,372 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2022-07-12 18:56:50,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:56:50,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 22 [2022-07-12 18:56:50,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:50,373 INFO L225 Difference]: With dead ends: 99 [2022-07-12 18:56:50,374 INFO L226 Difference]: Without dead ends: 86 [2022-07-12 18:56:50,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-12 18:56:50,374 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 31 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:50,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 148 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:56:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-12 18:56:50,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2022-07-12 18:56:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 75 states have internal predecessors, (80), 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-12 18:56:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-07-12 18:56:50,377 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 22 [2022-07-12 18:56:50,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:50,377 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-07-12 18:56:50,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-12 18:56:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-07-12 18:56:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:56:50,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:50,377 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:50,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:50,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:50,583 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:50,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1092187508, now seen corresponding path program 2 times [2022-07-12 18:56:50,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:50,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141634471] [2022-07-12 18:56:50,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:56:50,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:50,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:50,585 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:50,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 18:56:50,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 18:56:50,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:56:50,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 18:56:50,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:50,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:56:50,774 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-12 18:56:50,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:50,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:50,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141634471] [2022-07-12 18:56:50,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141634471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:50,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:50,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:56:50,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859829845] [2022-07-12 18:56:50,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:50,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:56:50,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:50,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:56:50,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:50,776 INFO L87 Difference]: Start difference. First operand 82 states and 88 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-12 18:56:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:51,047 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-07-12 18:56:51,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:56:51,048 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-12 18:56:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:51,049 INFO L225 Difference]: With dead ends: 96 [2022-07-12 18:56:51,049 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 18:56:51,049 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-12 18:56:51,050 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 43 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:51,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 430 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 18:56:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2022-07-12 18:56:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 74 states have internal predecessors, (79), 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-12 18:56:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-07-12 18:56:51,052 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 26 [2022-07-12 18:56:51,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:51,052 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-07-12 18:56:51,052 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-12 18:56:51,052 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-07-12 18:56:51,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:56:51,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:51,053 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:51,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:51,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:51,253 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:51,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2084512317, now seen corresponding path program 1 times [2022-07-12 18:56:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:51,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327634855] [2022-07-12 18:56:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:51,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:51,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:51,256 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:51,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 18:56:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:51,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:56:51,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:51,489 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-12 18:56:51,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:56:51,854 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-12 18:56:51,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:51,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327634855] [2022-07-12 18:56:51,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327634855] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:56:51,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:56:51,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-12 18:56:51,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411124618] [2022-07-12 18:56:51,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:56:51,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 18:56:51,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:51,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 18:56:51,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2022-07-12 18:56:51,856 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 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-12 18:56:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:52,204 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2022-07-12 18:56:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 18:56:52,204 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 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 30 [2022-07-12 18:56:52,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:52,205 INFO L225 Difference]: With dead ends: 87 [2022-07-12 18:56:52,205 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 18:56:52,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2022-07-12 18:56:52,206 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 15 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:52,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 958 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 18:56:52,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-12 18:56:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 80 states have internal predecessors, (85), 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-12 18:56:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2022-07-12 18:56:52,209 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 30 [2022-07-12 18:56:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:52,209 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2022-07-12 18:56:52,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 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-12 18:56:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2022-07-12 18:56:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:56:52,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:52,213 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-12 18:56:52,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:52,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:52,421 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:52,421 INFO L85 PathProgramCache]: Analyzing trace with hash -532510371, now seen corresponding path program 2 times [2022-07-12 18:56:52,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:52,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901310218] [2022-07-12 18:56:52,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:56:52,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:52,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:52,423 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:52,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 18:56:52,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 18:56:52,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:56:52,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:56:52,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:52,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:56:52,588 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-12 18:56:52,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:52,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:52,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901310218] [2022-07-12 18:56:52,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901310218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:52,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:52,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:56:52,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103103767] [2022-07-12 18:56:52,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:52,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:56:52,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:52,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:56:52,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:52,590 INFO L87 Difference]: Start difference. First operand 87 states and 93 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-12 18:56:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:52,796 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-07-12 18:56:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:56:52,797 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-12 18:56:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:52,797 INFO L225 Difference]: With dead ends: 88 [2022-07-12 18:56:52,797 INFO L226 Difference]: Without dead ends: 88 [2022-07-12 18:56:52,797 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-12 18:56:52,798 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 34 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:52,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 341 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-12 18:56:52,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2022-07-12 18:56:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 78 states have internal predecessors, (83), 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-12 18:56:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-07-12 18:56:52,800 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 36 [2022-07-12 18:56:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:52,800 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-07-12 18:56:52,800 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-12 18:56:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-07-12 18:56:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:56:52,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:52,801 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-12 18:56:52,810 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-12 18:56:53,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:53,001 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:53,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:53,002 INFO L85 PathProgramCache]: Analyzing trace with hash -532510370, now seen corresponding path program 1 times [2022-07-12 18:56:53,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:53,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362968238] [2022-07-12 18:56:53,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:53,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:53,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:53,003 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:53,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 18:56:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:53,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 18:56:53,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:53,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:56:53,284 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-12 18:56:53,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:53,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:53,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362968238] [2022-07-12 18:56:53,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362968238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:53,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:53,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:56:53,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317463282] [2022-07-12 18:56:53,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:53,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:56:53,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:53,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:56:53,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:56:53,285 INFO L87 Difference]: Start difference. First operand 85 states and 91 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-12 18:56:53,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:53,527 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-07-12 18:56:53,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:56:53,528 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-12 18:56:53,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:53,528 INFO L225 Difference]: With dead ends: 90 [2022-07-12 18:56:53,528 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 18:56:53,529 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-12 18:56:53,529 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 38 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:53,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 429 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 18:56:53,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2022-07-12 18:56:53,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 76 states have internal predecessors, (81), 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-12 18:56:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-07-12 18:56:53,531 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 36 [2022-07-12 18:56:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:53,532 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-07-12 18:56:53,532 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-12 18:56:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-07-12 18:56:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:56:53,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:53,532 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-12 18:56:53,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:53,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:53,739 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:53,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:53,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1979095631, now seen corresponding path program 1 times [2022-07-12 18:56:53,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:53,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149364113] [2022-07-12 18:56:53,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:53,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:53,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:53,741 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:53,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 18:56:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:53,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:56:53,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:53,915 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-12 18:56:53,915 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:53,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:53,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149364113] [2022-07-12 18:56:53,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149364113] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:53,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:53,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:56:53,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784826267] [2022-07-12 18:56:53,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:53,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:56:53,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:53,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:56:53,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:56:53,918 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (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-12 18:56:53,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:53,942 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-07-12 18:56:53,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:56:53,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (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-12 18:56:53,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:53,943 INFO L225 Difference]: With dead ends: 83 [2022-07-12 18:56:53,943 INFO L226 Difference]: Without dead ends: 83 [2022-07-12 18:56:53,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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-12 18:56:53,945 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 21 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 303 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-12 18:56:53,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 303 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-12 18:56:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-12 18:56:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 76 states have internal predecessors, (80), 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-12 18:56:53,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-07-12 18:56:53,948 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 36 [2022-07-12 18:56:53,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:53,949 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-07-12 18:56:53,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (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-12 18:56:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-07-12 18:56:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 18:56:53,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:53,950 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] [2022-07-12 18:56:53,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:54,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:54,162 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:54,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2103088419, now seen corresponding path program 1 times [2022-07-12 18:56:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:54,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778059680] [2022-07-12 18:56:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:54,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:54,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:54,164 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:54,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 18:56:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:54,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:56:54,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:54,335 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-12 18:56:54,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:54,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:54,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778059680] [2022-07-12 18:56:54,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778059680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:54,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:54,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:56:54,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717230619] [2022-07-12 18:56:54,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:54,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:56:54,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:54,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:56:54,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:56:54,337 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-12 18:56:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:54,373 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-07-12 18:56:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:54,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 38 [2022-07-12 18:56:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:54,374 INFO L225 Difference]: With dead ends: 83 [2022-07-12 18:56:54,374 INFO L226 Difference]: Without dead ends: 83 [2022-07-12 18:56:54,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 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-12 18:56:54,375 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 27 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 348 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-12 18:56:54,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 348 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:54,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-12 18:56:54,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-12 18:56:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 63 states have (on average 1.253968253968254) internal successors, (79), 75 states have internal predecessors, (79), 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-12 18:56:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-07-12 18:56:54,377 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 38 [2022-07-12 18:56:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:54,377 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-07-12 18:56:54,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-12 18:56:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-07-12 18:56:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:56:54,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:54,377 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] [2022-07-12 18:56:54,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:54,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:54,579 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash 633351514, now seen corresponding path program 1 times [2022-07-12 18:56:54,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:54,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124982640] [2022-07-12 18:56:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:54,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:54,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:54,581 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:54,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 18:56:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:54,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 18:56:54,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:54,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:56:54,851 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-12 18:56:54,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:54,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:54,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124982640] [2022-07-12 18:56:54,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124982640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:54,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:54,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 18:56:54,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959019911] [2022-07-12 18:56:54,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:54,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:56:54,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:54,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:56:54,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:56:54,853 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-12 18:56:55,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:55,009 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-07-12 18:56:55,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:56:55,010 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 46 [2022-07-12 18:56:55,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:55,011 INFO L225 Difference]: With dead ends: 109 [2022-07-12 18:56:55,011 INFO L226 Difference]: Without dead ends: 109 [2022-07-12 18:56:55,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 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-12 18:56:55,011 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 109 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:55,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 223 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-07-12 18:56:55,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-12 18:56:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2022-07-12 18:56:55,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 86 states have internal predecessors, (94), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:56:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2022-07-12 18:56:55,017 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 46 [2022-07-12 18:56:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:55,018 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2022-07-12 18:56:55,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-12 18:56:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-07-12 18:56:55,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:56:55,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:55,019 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] [2022-07-12 18:56:55,029 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-12 18:56:55,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:55,228 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:55,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:55,228 INFO L85 PathProgramCache]: Analyzing trace with hash 633351515, now seen corresponding path program 1 times [2022-07-12 18:56:55,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:55,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702164402] [2022-07-12 18:56:55,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:55,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:55,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:55,230 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:55,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 18:56:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:55,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 18:56:55,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:55,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:56:55,606 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-12 18:56:55,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:55,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:55,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702164402] [2022-07-12 18:56:55,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702164402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:55,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:55,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:56:55,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320497494] [2022-07-12 18:56:55,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:55,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:56:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:55,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:56:55,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:56:55,607 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-12 18:56:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:55,858 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-07-12 18:56:55,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:56:55,858 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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 46 [2022-07-12 18:56:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:55,859 INFO L225 Difference]: With dead ends: 97 [2022-07-12 18:56:55,859 INFO L226 Difference]: Without dead ends: 97 [2022-07-12 18:56:55,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:56:55,860 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 126 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:55,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 330 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 204 Invalid, 0 Unknown, 8 Unchecked, 0.2s Time] [2022-07-12 18:56:55,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-12 18:56:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-07-12 18:56:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 86 states have internal predecessors, (91), 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-12 18:56:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2022-07-12 18:56:55,862 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 46 [2022-07-12 18:56:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:55,862 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2022-07-12 18:56:55,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-12 18:56:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-07-12 18:56:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 18:56:55,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:55,863 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] [2022-07-12 18:56:55,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:56,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:56,071 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:56,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:56,071 INFO L85 PathProgramCache]: Analyzing trace with hash 438707658, now seen corresponding path program 1 times [2022-07-12 18:56:56,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:56,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646515974] [2022-07-12 18:56:56,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:56,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:56,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:56,072 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:56,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-12 18:56:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:56,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:56:56,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:56,303 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-12 18:56:56,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:56,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:56,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646515974] [2022-07-12 18:56:56,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646515974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:56,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:56,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:56:56,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380239445] [2022-07-12 18:56:56,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:56,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:56:56,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:56,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:56:56,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:56,305 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-12 18:56:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:56,370 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-07-12 18:56:56,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:56:56,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 51 [2022-07-12 18:56:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:56,371 INFO L225 Difference]: With dead ends: 97 [2022-07-12 18:56:56,371 INFO L226 Difference]: Without dead ends: 93 [2022-07-12 18:56:56,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 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-12 18:56:56,372 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 45 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 407 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-12 18:56:56,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 407 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-12 18:56:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-07-12 18:56:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 84 states have internal predecessors, (88), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:56:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-07-12 18:56:56,374 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 51 [2022-07-12 18:56:56,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:56,374 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-07-12 18:56:56,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-12 18:56:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-07-12 18:56:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 18:56:56,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:56,375 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] [2022-07-12 18:56:56,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:56,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:56,575 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:56,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash 885076734, now seen corresponding path program 1 times [2022-07-12 18:56:56,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:56,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354965599] [2022-07-12 18:56:56,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:56,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:56,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:56,577 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:56,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 18:56:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:56,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 18:56:56,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:56,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:56:56,886 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-12 18:56:56,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:56,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:56,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354965599] [2022-07-12 18:56:56,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354965599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:56,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:56,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:56:56,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852121475] [2022-07-12 18:56:56,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:56,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:56:56,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:56,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:56:56,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:56:56,889 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 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-12 18:56:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:57,124 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-07-12 18:56:57,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:56:57,124 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 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 52 [2022-07-12 18:56:57,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:57,125 INFO L225 Difference]: With dead ends: 119 [2022-07-12 18:56:57,125 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 18:56:57,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 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-12 18:56:57,125 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 80 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:57,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 278 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 231 Invalid, 0 Unknown, 21 Unchecked, 0.2s Time] [2022-07-12 18:56:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 18:56:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2022-07-12 18:56:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 100 states have internal predecessors, (110), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-12 18:56:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-07-12 18:56:57,128 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 52 [2022-07-12 18:56:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:57,128 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-07-12 18:56:57,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 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-12 18:56:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-07-12 18:56:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 18:56:57,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:57,128 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] [2022-07-12 18:56:57,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-07-12 18:56:57,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:57,337 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash 885076735, now seen corresponding path program 1 times [2022-07-12 18:56:57,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:57,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510172042] [2022-07-12 18:56:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:57,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:57,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:57,339 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:57,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-12 18:56:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:57,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 18:56:57,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:57,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:56:57,806 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-12 18:56:57,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:57,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:57,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510172042] [2022-07-12 18:56:57,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510172042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:57,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:57,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 18:56:57,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516495121] [2022-07-12 18:56:57,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:57,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:56:57,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:57,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:56:57,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:56:57,808 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-12 18:56:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:58,094 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-07-12 18:56:58,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:56:58,095 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 52 [2022-07-12 18:56:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:58,095 INFO L225 Difference]: With dead ends: 131 [2022-07-12 18:56:58,096 INFO L226 Difference]: Without dead ends: 131 [2022-07-12 18:56:58,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 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-12 18:56:58,096 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 152 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:58,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 343 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 193 Invalid, 0 Unknown, 13 Unchecked, 0.2s Time] [2022-07-12 18:56:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-12 18:56:58,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2022-07-12 18:56:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 116 states have internal predecessors, (130), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-12 18:56:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 142 transitions. [2022-07-12 18:56:58,099 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 142 transitions. Word has length 52 [2022-07-12 18:56:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:58,100 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 142 transitions. [2022-07-12 18:56:58,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-12 18:56:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 142 transitions. [2022-07-12 18:56:58,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 18:56:58,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:58,100 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-12 18:56:58,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:58,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:58,309 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:58,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:58,310 INFO L85 PathProgramCache]: Analyzing trace with hash 516809115, now seen corresponding path program 1 times [2022-07-12 18:56:58,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:58,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772595627] [2022-07-12 18:56:58,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:58,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:58,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:58,311 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:58,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 18:56:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:58,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 18:56:58,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:58,817 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-12 18:56:58,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:58,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:58,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772595627] [2022-07-12 18:56:58,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772595627] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:58,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:58,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:56:58,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344557855] [2022-07-12 18:56:58,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:58,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:56:58,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:58,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:56:58,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:56:58,819 INFO L87 Difference]: Start difference. First operand 127 states and 142 transitions. Second operand has 13 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-12 18:56:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:59,085 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-07-12 18:56:59,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:56:59,086 INFO L78 Accepts]: Start accepts. Automaton has has 13 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-12 18:56:59,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:59,087 INFO L225 Difference]: With dead ends: 130 [2022-07-12 18:56:59,087 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 18:56:59,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 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-12 18:56:59,087 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 200 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:59,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 429 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 177 Invalid, 0 Unknown, 12 Unchecked, 0.2s Time] [2022-07-12 18:56:59,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 18:56:59,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-07-12 18:56:59,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 116 states have internal predecessors, (129), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-12 18:56:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2022-07-12 18:56:59,090 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 55 [2022-07-12 18:56:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:59,090 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2022-07-12 18:56:59,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 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-12 18:56:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2022-07-12 18:56:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 18:56:59,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:59,090 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] [2022-07-12 18:56:59,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:59,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:59,299 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:56:59,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:59,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1999474558, now seen corresponding path program 1 times [2022-07-12 18:56:59,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:59,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332539494] [2022-07-12 18:56:59,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:59,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:59,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:59,301 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:59,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 18:56:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:59,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 18:56:59,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:59,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:56:59,666 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-12 18:56:59,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:56:59,787 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-12 18:56:59,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:59,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332539494] [2022-07-12 18:56:59,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332539494] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:56:59,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:56:59,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-07-12 18:56:59,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657439196] [2022-07-12 18:56:59,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:56:59,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:56:59,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:59,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:56:59,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:56:59,789 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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-12 18:57:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:00,010 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2022-07-12 18:57:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:57:00,010 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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 59 [2022-07-12 18:57:00,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:00,011 INFO L225 Difference]: With dead ends: 137 [2022-07-12 18:57:00,011 INFO L226 Difference]: Without dead ends: 137 [2022-07-12 18:57:00,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:57:00,012 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 97 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:00,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 329 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 220 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2022-07-12 18:57:00,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-12 18:57:00,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2022-07-12 18:57:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.2037037037037037) internal successors, (130), 120 states have internal predecessors, (130), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-12 18:57:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2022-07-12 18:57:00,016 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 59 [2022-07-12 18:57:00,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:00,016 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2022-07-12 18:57:00,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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-12 18:57:00,016 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2022-07-12 18:57:00,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 18:57:00,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:00,017 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] [2022-07-12 18:57:00,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:00,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:00,222 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:57:00,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:00,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1197288958, now seen corresponding path program 1 times [2022-07-12 18:57:00,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:00,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653179875] [2022-07-12 18:57:00,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:00,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:00,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:00,224 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:00,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-12 18:57:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:00,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-12 18:57:00,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:00,598 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-12 18:57:00,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:00,645 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 25 treesize of output 24 [2022-07-12 18:57:00,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:00,674 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-12 18:57:00,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:00,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:57:00,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:00,744 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-12 18:57:00,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:00,777 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-12 18:57:00,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:00,825 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-12 18:57:00,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:00,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:00,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:00,892 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-12 18:57:00,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:00,929 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-12 18:57:00,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:00,973 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-12 18:57:01,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:01,019 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-12 18:57:01,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:01,058 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-12 18:57:01,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:01,098 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-12 18:57:01,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:01,135 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-12 18:57:01,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:01,177 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-12 18:57:01,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:01,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:01,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:01,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:01,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:01,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:01,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:01,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:01,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:01,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:01,358 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-12 18:57:06,313 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1756 (_ BitVec 32)) (v_ArrVal_1757 (_ BitVec 32))) (= (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_1756) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1757)) |c_#memory_$Pointer$.offset|)) is different from true [2022-07-12 18:57:06,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:06,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:06,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:06,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, 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-12 18:57:06,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:06,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:06,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:06,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:06,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:06,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:06,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:06,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:06,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:06,529 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-12 18:57:06,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:57:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:06,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:07,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:07,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653179875] [2022-07-12 18:57:07,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653179875] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:57:07,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [562549609] [2022-07-12 18:57:07,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:07,312 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 18:57:07,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 18:57:07,315 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 18:57:07,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-07-12 18:57:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:07,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 118 conjunts are in the unsatisfiable core [2022-07-12 18:57:07,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:07,929 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-12 18:57:07,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:07,946 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 25 treesize of output 24 [2022-07-12 18:57:07,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:07,963 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 25 treesize of output 24 [2022-07-12 18:57:07,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:07,984 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-12 18:57:08,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,010 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-12 18:57:08,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,021 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-12 18:57:08,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,032 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-12 18:57:08,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,049 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-12 18:57:08,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,058 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-12 18:57:08,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,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-12 18:57:08,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,086 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-12 18:57:08,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,116 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-12 18:57:08,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,146 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-12 18:57:08,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:57:08,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,200 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-12 18:57:08,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,211 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-12 18:57:08,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:08,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:57:11,416 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1756 (_ BitVec 32)) (v_ArrVal_1953 (_ 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_1756) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1953)))) is different from true [2022-07-12 18:57:11,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:11,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:11,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:11,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, 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-12 18:57:11,507 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-12 18:57:11,597 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:57:11,597 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-12 18:57:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:11,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:12,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [562549609] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:57:12,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:57:12,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 44 [2022-07-12 18:57:12,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88469529] [2022-07-12 18:57:12,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:57:12,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-12 18:57:12,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:12,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-12 18:57:12,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3198, Unknown=3, NotChecked=230, Total=3660 [2022-07-12 18:57:12,932 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 45 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 18:57:17,162 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1756 (_ BitVec 32)) (v_ArrVal_1757 (_ BitVec 32))) (= (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_1756) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1757)) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1756 (_ BitVec 32)) (v_ArrVal_1953 (_ 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_1756) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1953))))) is different from true [2022-07-12 18:57:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:18,172 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-07-12 18:57:18,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-12 18:57:18,173 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-07-12 18:57:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:18,173 INFO L225 Difference]: With dead ends: 129 [2022-07-12 18:57:18,174 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 18:57:18,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 88 SyntacticMatches, 7 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=556, Invalid=7284, Unknown=4, NotChecked=528, Total=8372 [2022-07-12 18:57:18,175 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 211 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:18,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 583 Invalid, 1884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1575 Invalid, 0 Unknown, 253 Unchecked, 1.9s Time] [2022-07-12 18:57:18,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 18:57:18,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-12 18:57:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 108 states have (on average 1.1666666666666667) internal successors, (126), 118 states have internal predecessors, (126), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-12 18:57:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2022-07-12 18:57:18,178 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 58 [2022-07-12 18:57:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:18,178 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2022-07-12 18:57:18,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 18:57:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2022-07-12 18:57:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 18:57:18,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:18,179 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] [2022-07-12 18:57:18,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-12 18:57:18,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:18,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 18:57:18,587 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:57:18,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:18,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1538748096, now seen corresponding path program 1 times [2022-07-12 18:57:18,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:18,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380362063] [2022-07-12 18:57:18,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:18,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:18,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:18,589 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:18,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-12 18:57:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:18,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-12 18:57:18,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:18,946 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-12 18:57:18,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:18,970 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-12 18:57:18,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,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 22 treesize of output 21 [2022-07-12 18:57:19,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,034 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-12 18:57:19,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,066 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-12 18:57:19,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,096 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-12 18:57:19,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,131 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-12 18:57:19,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,162 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-12 18:57:19,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,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-12 18:57:19,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,230 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-12 18:57:19,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,273 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-12 18:57:19,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,310 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-12 18:57:19,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,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, 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-12 18:57:19,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,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 22 treesize of output 21 [2022-07-12 18:57:19,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,427 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-12 18:57:19,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,471 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-12 18:57:19,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,615 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-12 18:57:24,699 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2147 (_ BitVec 32)) (v_ArrVal_2145 (_ 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_2145) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2147)))) is different from true [2022-07-12 18:57:24,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:24,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:24,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:24,709 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-12 18:57:24,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:24,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:24,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:24,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:24,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:24,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:24,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:24,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:24,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:24,899 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-12 18:57:24,974 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-12 18:57:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:25,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:25,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:25,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380362063] [2022-07-12 18:57:25,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380362063] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:57:25,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [70007393] [2022-07-12 18:57:25,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:25,766 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 18:57:25,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 18:57:25,767 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 18:57:25,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-07-12 18:57:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:26,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-12 18:57:26,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:26,264 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-12 18:57:26,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,294 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-12 18:57:26,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,309 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-12 18:57:26,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,326 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-12 18:57:26,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,350 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-12 18:57:26,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,364 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-12 18:57:26,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,407 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-12 18:57:26,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:26,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,451 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-12 18:57:26,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,482 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-12 18:57:26,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,510 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-12 18:57:26,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,524 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-12 18:57:26,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,561 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-12 18:57:26,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:26,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,636 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-12 18:57:26,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,646 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-12 18:57:26,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,688 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-12 18:57:29,737 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2344 (_ BitVec 32)) (v_ArrVal_2145 (_ 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_2145) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2344)) |c_#memory_$Pointer$.base|)) is different from true [2022-07-12 18:57:29,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:29,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:29,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:29,750 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-12 18:57:29,842 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-12 18:57:29,932 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:57:29,932 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-12 18:57:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:30,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:31,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [70007393] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:57:31,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:57:31,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 46 [2022-07-12 18:57:31,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204172108] [2022-07-12 18:57:31,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:57:31,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 18:57:31,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:31,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 18:57:31,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3299, Unknown=3, NotChecked=234, Total=3782 [2022-07-12 18:57:31,337 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 18:57:34,966 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2344 (_ BitVec 32)) (v_ArrVal_2145 (_ 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_2145) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2344)) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2147 (_ BitVec 32)) (v_ArrVal_2145 (_ 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_2145) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2147))))) is different from true [2022-07-12 18:57:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:35,786 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2022-07-12 18:57:35,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-12 18:57:35,786 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2022-07-12 18:57:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:35,787 INFO L225 Difference]: With dead ends: 123 [2022-07-12 18:57:35,787 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 18:57:35,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 87 SyntacticMatches, 11 SemanticMatches, 77 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1566 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=477, Invalid=5231, Unknown=4, NotChecked=450, Total=6162 [2022-07-12 18:57:35,788 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 193 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:35,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 415 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1413 Invalid, 0 Unknown, 232 Unchecked, 1.8s Time] [2022-07-12 18:57:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 18:57:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-12 18:57:35,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 110 states have internal predecessors, (114), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-12 18:57:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2022-07-12 18:57:35,791 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 59 [2022-07-12 18:57:35,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:35,792 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2022-07-12 18:57:35,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 18:57:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2022-07-12 18:57:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 18:57:35,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:35,792 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] [2022-07-12 18:57:35,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:36,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:36,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:36,204 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:57:36,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:36,204 INFO L85 PathProgramCache]: Analyzing trace with hash 130971687, now seen corresponding path program 1 times [2022-07-12 18:57:36,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:36,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764032164] [2022-07-12 18:57:36,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:36,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:36,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:36,206 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:36,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-12 18:57:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:36,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 18:57:36,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:36,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:57:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:36,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:36,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:36,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764032164] [2022-07-12 18:57:36,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764032164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:36,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:36,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 18:57:36,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829656640] [2022-07-12 18:57:36,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:36,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:57:36,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:36,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:57:36,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:57:36,831 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand has 13 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:57:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:37,157 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-07-12 18:57:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:57:37,158 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 65 [2022-07-12 18:57:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:37,158 INFO L225 Difference]: With dead ends: 120 [2022-07-12 18:57:37,158 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 18:57:37,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:57:37,159 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 123 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:37,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 258 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 0 Unknown, 8 Unchecked, 0.2s Time] [2022-07-12 18:57:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 18:57:37,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-12 18:57:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 102 states have (on average 1.0980392156862746) internal successors, (112), 109 states have internal predecessors, (112), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-12 18:57:37,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2022-07-12 18:57:37,162 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 65 [2022-07-12 18:57:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:37,163 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2022-07-12 18:57:37,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:57:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2022-07-12 18:57:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 18:57:37,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:37,163 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] [2022-07-12 18:57:37,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-12 18:57:37,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:37,374 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:57:37,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:37,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1947249523, now seen corresponding path program 1 times [2022-07-12 18:57:37,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:37,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3726235] [2022-07-12 18:57:37,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:37,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:37,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:37,377 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:37,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-12 18:57:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:37,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 18:57:37,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:38,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:38,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:38,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3726235] [2022-07-12 18:57:38,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3726235] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:38,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:38,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:57:38,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266425970] [2022-07-12 18:57:38,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:38,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:57:38,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:38,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:57:38,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:57:38,018 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 13 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:57:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:38,246 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2022-07-12 18:57:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:57:38,247 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-07-12 18:57:38,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:38,248 INFO L225 Difference]: With dead ends: 119 [2022-07-12 18:57:38,248 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 18:57:38,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:57:38,248 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 117 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:38,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 279 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 9 Unchecked, 0.1s Time] [2022-07-12 18:57:38,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 18:57:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-12 18:57:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 102 states have (on average 1.0784313725490196) internal successors, (110), 108 states have internal predecessors, (110), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-12 18:57:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2022-07-12 18:57:38,251 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 68 [2022-07-12 18:57:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:38,251 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2022-07-12 18:57:38,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:57:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2022-07-12 18:57:38,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 18:57:38,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:38,252 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-12 18:57:38,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-12 18:57:38,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:38,456 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:57:38,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:38,456 INFO L85 PathProgramCache]: Analyzing trace with hash -418298125, now seen corresponding path program 1 times [2022-07-12 18:57:38,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:38,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473757707] [2022-07-12 18:57:38,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:38,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:38,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:38,457 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:38,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-12 18:57:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:57:38,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 18:57:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:57:39,040 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-12 18:57:39,043 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 18:57:39,044 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2022-07-12 18:57:39,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2022-07-12 18:57:39,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2022-07-12 18:57:39,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2022-07-12 18:57:39,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2022-07-12 18:57:39,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (15 of 21 remaining) [2022-07-12 18:57:39,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2022-07-12 18:57:39,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2022-07-12 18:57:39,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2022-07-12 18:57:39,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2022-07-12 18:57:39,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2022-07-12 18:57:39,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2022-07-12 18:57:39,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2022-07-12 18:57:39,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2022-07-12 18:57:39,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2022-07-12 18:57:39,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2022-07-12 18:57:39,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2022-07-12 18:57:39,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2022-07-12 18:57:39,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2022-07-12 18:57:39,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2022-07-12 18:57:39,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (0 of 21 remaining) [2022-07-12 18:57:39,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:39,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:39,254 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] [2022-07-12 18:57:39,257 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 18:57:39,262 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,263 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,263 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,263 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,264 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,265 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,265 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,266 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,266 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,266 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,266 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,266 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,266 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,266 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,267 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,267 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,267 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,267 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,267 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,267 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,268 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,268 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,268 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,268 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,268 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,268 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,268 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,271 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,271 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,271 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,271 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,271 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,271 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,283 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,283 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,283 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,284 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,284 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,284 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,284 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:57:39 BoogieIcfgContainer [2022-07-12 18:57:39,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 18:57:39,321 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 18:57:39,321 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 18:57:39,321 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 18:57:39,321 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:56:46" (3/4) ... [2022-07-12 18:57:39,322 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 18:57:39,324 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,327 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,327 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,327 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,327 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,327 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,327 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,327 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,328 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,328 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,328 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,328 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,328 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,328 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,328 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,328 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,329 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,329 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,329 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,329 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,331 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,331 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,331 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,333 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,333 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,333 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,333 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,335 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,335 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,335 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,335 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,335 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,335 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,335 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,335 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,340 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:57:39,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:57:39,392 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 18:57:39,392 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 18:57:39,392 INFO L158 Benchmark]: Toolchain (without parser) took 54354.64ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 38.2MB in the beginning and 32.3MB in the end (delta: 5.9MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2022-07-12 18:57:39,393 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.9MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:57:39,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.67ms. Allocated memory is still 60.8MB. Free memory was 38.1MB in the beginning and 27.3MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 18:57:39,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.66ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 27.1MB in the beginning and 54.8MB in the end (delta: -27.7MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-07-12 18:57:39,393 INFO L158 Benchmark]: Boogie Preprocessor took 41.44ms. Allocated memory is still 73.4MB. Free memory was 54.8MB in the beginning and 52.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:57:39,393 INFO L158 Benchmark]: RCFGBuilder took 489.21ms. Allocated memory is still 73.4MB. Free memory was 52.8MB in the beginning and 53.8MB in the end (delta: -973.2kB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2022-07-12 18:57:39,394 INFO L158 Benchmark]: TraceAbstraction took 53304.47ms. Allocated memory is still 73.4MB. Free memory was 53.4MB in the beginning and 41.7MB in the end (delta: 11.6MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2022-07-12 18:57:39,394 INFO L158 Benchmark]: Witness Printer took 71.16ms. Allocated memory is still 73.4MB. Free memory was 41.7MB in the beginning and 32.3MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 18:57:39,397 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.9MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.67ms. Allocated memory is still 60.8MB. Free memory was 38.1MB in the beginning and 27.3MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.66ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 27.1MB in the beginning and 54.8MB in the end (delta: -27.7MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.44ms. Allocated memory is still 73.4MB. Free memory was 54.8MB in the beginning and 52.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 489.21ms. Allocated memory is still 73.4MB. Free memory was 52.8MB in the beginning and 53.8MB in the end (delta: -973.2kB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * TraceAbstraction took 53304.47ms. Allocated memory is still 73.4MB. Free memory was 53.4MB in the beginning and 41.7MB in the end (delta: 11.6MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * Witness Printer took 71.16ms. Allocated memory is still 73.4MB. Free memory was 41.7MB in the beginning and 32.3MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled * 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={1:0}] [L764] CALL entry_point() [L758] struct ldv_kobject *kobj; [L759] CALL, EXPR ldv_kobject_create() [L740] struct ldv_kobject *kobj; VAL [ldv_global_msg_list={1:0}] [L741] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L741] RET, EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_global_msg_list={1:0}, ldv_malloc(sizeof(*kobj))={2:0}] [L741] kobj = ldv_malloc(sizeof(*kobj)) [L742] COND FALSE !(!kobj) [L744] FCALL memset(kobj, 0, sizeof(*kobj)) [L745] CALL ldv_kobject_init(kobj) [L730] COND FALSE !(!kobj) [L733] CALL ldv_kobject_init_internal(kobj) [L723] COND FALSE !(!kobj) [L725] CALL ldv_kref_init(&kobj->kref) [L682] ((&kref->refcount)->counter) = (1) VAL [kref={2:12}, kref={2:12}, ldv_global_msg_list={1:0}] [L725] RET ldv_kref_init(&kobj->kref) [L726] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [ldv_global_msg_list={1:0}, list={2:4}] [L540] list->next = list VAL [ldv_global_msg_list={1:0}, list={2:4}, list={2:4}] [L541] list->prev = list VAL [ldv_global_msg_list={1:0}, list={2:4}, list={2:4}] [L726] RET LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L733] RET ldv_kobject_init_internal(kobj) [L745] RET ldv_kobject_init(kobj) [L746] return kobj; VAL [\result={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L759] RET, EXPR ldv_kobject_create() [L759] kobj = ldv_kobject_create() [L760] CALL ldv_kobject_put(kobj) VAL [ldv_global_msg_list={1:0}] [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL, EXPR ldv_kref_sub(kref, 1, release) [L674] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}] [L666] EXPR v->counter VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}, v->counter=1] [L666] temp = v->counter [L667] temp -= i VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=0, v={2:12}, v={2:12}] [L668] v->counter = temp VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=0, v={2:12}, v={2:12}] [L669] return temp; VAL [\old(i)=1, \result=0, i=1, ldv_global_msg_list={1:0}, temp=0, v={2:12}, v={2:12}] [L674] RET, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L674] COND TRUE (ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0) [L675] CALL release(kref) [L706] const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); [L706] struct ldv_kobject *kobj = ({ const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) );}); [L707] CALL ldv_kobject_cleanup(kobj) [L699] EXPR kobj->name VAL [kobj={2:0}, kobj={2:0}, kobj->name={0:0}, ldv_global_msg_list={1:0}] [L699] char *name = kobj->name; [L700] free(kobj) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}, name={0:0}] [L700] free(kobj) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}, name={0:0}] [L700] free(kobj) [L701] COND FALSE !(\read(*name)) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}, name={0:0}] [L707] RET ldv_kobject_cleanup(kobj) [L675] RET release(kref) [L676] return 1; VAL [\old(count)=1, \result=1, count=1, kref={2:12}, kref={2:12}, ldv_global_msg_list={1:0}, release={-1:0}, release={-1:0}] [L690] RET, EXPR ldv_kref_sub(kref, 1, release) [L690] return ldv_kref_sub(kref, 1, release); [L712] RET ldv_kref_put(&kobj->kref, ldv_kobject_release) [L760] RET ldv_kobject_put(kobj) VAL [kobj={2:0}, ldv_global_msg_list={1:0}] [L761] CALL ldv_kobject_put(kobj) VAL [ldv_global_msg_list={1:0}] [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL ldv_kref_sub(kref, 1, release) [L674] CALL ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}] [L666] v->counter - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 763]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 77 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 53.2s, OverallIterations: 28, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1928 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1906 mSDsluCounter, 9992 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 630 IncrementalHoareTripleChecker+Unchecked, 8287 mSDsCounter, 346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6173 IncrementalHoareTripleChecker+Invalid, 7149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 346 mSolverCounterUnsat, 1705 mSDtfsCounter, 6173 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1387 GetRequests, 912 SyntacticMatches, 36 SemanticMatches, 439 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3778 ImplicationChecksByTransitivity, 30.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=23, InterpolantAutomatonStates: 321, 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, 27 MinimizatonAttempts, 130 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 27.6s InterpolantComputationTime, 1152 NumberOfCodeBlocks, 1122 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1177 ConstructedInterpolants, 88 QuantifiedInterpolants, 7900 SizeOfPredicates, 425 NumberOfNonLiveVariables, 7083 ConjunctsInSsa, 870 ConjunctsInUnsatCore, 33 InterpolantComputations, 21 PerfectInterpolantSequences, 1991/2673 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 RESULT: Ultimate proved your program to be incorrect! [2022-07-12 18:57:39,461 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)