./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test1-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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_test1-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 b69b1cc5e7bc7b36d5ea64018b501429b633eb9552e27aac1ef773c6042e4013 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:49:39,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:49:39,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:49:39,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:49:39,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:49:39,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:49:39,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:49:39,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:49:39,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:49:39,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:49:39,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:49:39,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:49:39,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:49:39,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:49:39,880 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:49:39,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:49:39,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:49:39,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:49:39,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:49:39,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:49:39,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:49:39,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:49:39,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:49:39,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:49:39,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:49:39,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:49:39,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:49:39,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:49:39,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:49:39,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:49:39,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:49:39,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:49:39,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:49:39,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:49:39,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:49:39,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:49:39,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:49:39,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:49:39,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:49:39,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:49:39,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:49:39,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:49:39,907 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:49:39,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:49:39,908 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:49:39,908 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:49:39,909 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:49:39,909 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:49:39,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:49:39,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:49:39,910 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:49:39,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:49:39,910 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:49:39,910 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:49:39,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:49:39,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:49:39,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:49:39,911 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:49:39,911 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:49:39,911 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:49:39,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:49:39,911 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:49:39,911 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:49:39,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:49:39,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:49:39,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:49:39,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:49:39,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:39,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:49:39,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:49:39,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:49:39,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:49:39,913 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 -> b69b1cc5e7bc7b36d5ea64018b501429b633eb9552e27aac1ef773c6042e4013 [2022-02-20 23:49:40,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:49:40,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:49:40,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:49:40,113 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:49:40,113 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:49:40,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test1-2.i [2022-02-20 23:49:40,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9429089/3547ade65652469595464aa169538bbe/FLAGd0ed0828f [2022-02-20 23:49:40,604 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:49:40,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test1-2.i [2022-02-20 23:49:40,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9429089/3547ade65652469595464aa169538bbe/FLAGd0ed0828f [2022-02-20 23:49:40,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9429089/3547ade65652469595464aa169538bbe [2022-02-20 23:49:40,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:49:40,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:49:40,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:40,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:49:40,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:49:40,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:40" (1/1) ... [2022-02-20 23:49:40,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9748103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:40, skipping insertion in model container [2022-02-20 23:49:40,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:40" (1/1) ... [2022-02-20 23:49:40,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:49:40,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:40,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:40,987 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-02-20 23:49:40,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3ee36aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:40, skipping insertion in model container [2022-02-20 23:49:40,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:40,988 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:49:40,989 INFO L158 Benchmark]: Toolchain (without parser) took 351.81ms. Allocated memory is still 109.1MB. Free memory was 76.2MB in the beginning and 78.9MB in the end (delta: -2.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:49:40,990 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 109.1MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:49:40,990 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.48ms. Allocated memory is still 109.1MB. Free memory was 75.9MB in the beginning and 78.9MB in the end (delta: -3.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:49:40,991 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47ms. Allocated memory is still 109.1MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.48ms. Allocated memory is still 109.1MB. Free memory was 75.9MB in the beginning and 78.9MB in the end (delta: -3.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type 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 -ea -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_test1-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 b69b1cc5e7bc7b36d5ea64018b501429b633eb9552e27aac1ef773c6042e4013 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:49:42,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:49:42,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:49:42,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:49:42,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:49:42,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:49:42,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:49:42,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:49:42,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:49:42,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:49:42,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:49:42,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:49:42,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:49:42,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:49:42,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:49:42,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:49:42,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:49:42,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:49:42,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:49:42,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:49:42,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:49:42,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:49:42,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:49:42,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:49:42,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:49:42,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:49:42,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:49:42,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:49:42,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:49:42,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:49:42,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:49:42,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:49:42,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:49:42,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:49:42,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:49:42,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:49:42,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:49:42,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:49:42,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:49:42,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:49:42,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:49:42,402 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:49:42,417 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:49:42,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:49:42,418 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:49:42,418 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:49:42,419 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:49:42,419 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:49:42,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:49:42,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:49:42,420 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:49:42,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:49:42,420 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:49:42,420 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:49:42,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:49:42,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:49:42,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:49:42,421 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:49:42,421 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:49:42,421 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:49:42,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:49:42,422 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:49:42,422 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:49:42,422 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:49:42,422 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:49:42,422 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:49:42,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:49:42,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:49:42,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:49:42,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:42,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:49:42,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:49:42,424 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:49:42,426 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:49:42,426 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:49:42,426 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 -> b69b1cc5e7bc7b36d5ea64018b501429b633eb9552e27aac1ef773c6042e4013 [2022-02-20 23:49:42,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:49:42,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:49:42,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:49:42,733 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:49:42,737 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:49:42,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test1-2.i [2022-02-20 23:49:42,781 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964e73139/9c2f1d5128164a83b5ca73d78214d1ac/FLAG3f67b3564 [2022-02-20 23:49:43,219 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:49:43,220 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test1-2.i [2022-02-20 23:49:43,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964e73139/9c2f1d5128164a83b5ca73d78214d1ac/FLAG3f67b3564 [2022-02-20 23:49:43,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964e73139/9c2f1d5128164a83b5ca73d78214d1ac [2022-02-20 23:49:43,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:49:43,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:49:43,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:43,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:49:43,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:49:43,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:43" (1/1) ... [2022-02-20 23:49:43,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7339b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:43, skipping insertion in model container [2022-02-20 23:49:43,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:43" (1/1) ... [2022-02-20 23:49:43,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:49:43,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:43,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:43,652 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:49:43,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:43,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:43,719 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:49:43,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:43,804 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:49:43,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:43 WrapperNode [2022-02-20 23:49:43,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:43,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:49:43,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:49:43,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:49:43,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:43" (1/1) ... [2022-02-20 23:49:43,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:43" (1/1) ... [2022-02-20 23:49:43,859 INFO L137 Inliner]: procedures = 165, calls = 70, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 22 [2022-02-20 23:49:43,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:49:43,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:49:43,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:49:43,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:49:43,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:43" (1/1) ... [2022-02-20 23:49:43,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:43" (1/1) ... [2022-02-20 23:49:43,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:43" (1/1) ... [2022-02-20 23:49:43,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:43" (1/1) ... [2022-02-20 23:49:43,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:43" (1/1) ... [2022-02-20 23:49:43,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:43" (1/1) ... [2022-02-20 23:49:43,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:43" (1/1) ... [2022-02-20 23:49:43,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:49:43,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:49:43,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:49:43,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:49:43,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:43" (1/1) ... [2022-02-20 23:49:43,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:43,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:43,899 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-02-20 23:49:43,913 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-02-20 23:49:43,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:49:43,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:49:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:49:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:49:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:49:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:49:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:49:43,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:49:44,048 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:49:44,050 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:49:44,198 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:49:44,208 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:49:44,208 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:49:44,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:44 BoogieIcfgContainer [2022-02-20 23:49:44,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:49:44,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:49:44,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:49:44,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:49:44,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:49:43" (1/3) ... [2022-02-20 23:49:44,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcbad4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:49:44, skipping insertion in model container [2022-02-20 23:49:44,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:43" (2/3) ... [2022-02-20 23:49:44,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcbad4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:49:44, skipping insertion in model container [2022-02-20 23:49:44,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:44" (3/3) ... [2022-02-20 23:49:44,215 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test1-2.i [2022-02-20 23:49:44,218 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:49:44,219 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-02-20 23:49:44,250 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:49:44,254 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:49:44,255 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 23:49:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 22 states have internal predecessors, (23), 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-02-20 23:49:44,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:49:44,271 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:44,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:44,272 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2022-02-20 23:49:44,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:44,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1422973257, now seen corresponding path program 1 times [2022-02-20 23:49:44,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:44,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098132330] [2022-02-20 23:49:44,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:44,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:44,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:44,285 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-02-20 23:49:44,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:49:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:44,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:49:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:44,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:44,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {28#true} is VALID [2022-02-20 23:49:44,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset; {28#true} is VALID [2022-02-20 23:49:44,469 INFO L272 TraceCheckUtils]: 2: Hoare triple {28#true} call entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc(4bv32); {28#true} is VALID [2022-02-20 23:49:44,470 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~size := #in~size; {28#true} is VALID [2022-02-20 23:49:44,470 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {45#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:49:44,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {45#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {45#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:49:44,473 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {45#(= |ldv_malloc_#res.offset| (_ bv0 32))} {28#true} #30#return; {52#(= |ULTIMATE.start_entry_point_#t~ret38#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:49:44,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {52#(= |ULTIMATE.start_entry_point_#t~ret38#1.offset| (_ bv0 32))} entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset; {56#(= (_ bv0 32) |ULTIMATE.start_entry_point_~p~0#1.offset|)} is VALID [2022-02-20 23:49:44,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {56#(= (_ bv0 32) |ULTIMATE.start_entry_point_~p~0#1.offset|)} assume !(0bv32 == entry_point_~p~0#1.offset); {29#false} is VALID [2022-02-20 23:49:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:44,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:44,476 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:44,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098132330] [2022-02-20 23:49:44,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098132330] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:44,477 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:44,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:49:44,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565158844] [2022-02-20 23:49:44,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:44,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2022-02-20 23:49:44,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:44,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 23:49:44,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:44,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:49:44,497 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:44,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:49:44,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:44,518 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 22 states have internal predecessors, (23), 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) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 23:49:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:44,626 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-02-20 23:49:44,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:49:44,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2022-02-20 23:49:44,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 23:49:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-20 23:49:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 23:49:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-20 23:49:44,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-02-20 23:49:44,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:44,669 INFO L225 Difference]: With dead ends: 23 [2022-02-20 23:49:44,669 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 23:49:44,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-02-20 23:49:44,677 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:44,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 62 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:44,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 23:49:44,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 23:49:44,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:44,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:44,694 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:44,694 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:44,696 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-02-20 23:49:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-20 23:49:44,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:44,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:44,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-02-20 23:49:44,697 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-02-20 23:49:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:44,703 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-02-20 23:49:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-20 23:49:44,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:44,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:44,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:44,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-02-20 23:49:44,706 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 9 [2022-02-20 23:49:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:44,706 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-02-20 23:49:44,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 23:49:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-20 23:49:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:49:44,706 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:44,707 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:44,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:49:44,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:49:44,908 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2022-02-20 23:49:44,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1162497963, now seen corresponding path program 1 times [2022-02-20 23:49:44,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:44,909 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041746476] [2022-02-20 23:49:44,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:44,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:44,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:44,912 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-02-20 23:49:44,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:49:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:44,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:49:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:44,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:45,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {145#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {150#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:45,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset; {150#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:45,085 INFO L272 TraceCheckUtils]: 2: Hoare triple {150#(bvult (_ bv0 32) |#StackHeapBarrier|)} call entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc(4bv32); {150#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:45,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {150#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:45,086 INFO L290 TraceCheckUtils]: 4: Hoare triple {150#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {163#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:49:45,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} assume true; {163#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:49:45,087 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {163#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} {150#(bvult (_ bv0 32) |#StackHeapBarrier|)} #30#return; {170#(and (not (= |ULTIMATE.start_entry_point_#t~ret38#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_entry_point_#t~ret38#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:49:45,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {170#(and (not (= |ULTIMATE.start_entry_point_#t~ret38#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_entry_point_#t~ret38#1.base| |#StackHeapBarrier|))} entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset; {174#(and (not (= |ULTIMATE.start_entry_point_~p~0#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_entry_point_~p~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:49:45,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {174#(and (not (= |ULTIMATE.start_entry_point_~p~0#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_entry_point_~p~0#1.base| |#StackHeapBarrier|))} assume 0bv32 == entry_point_~p~0#1.offset; {174#(and (not (= |ULTIMATE.start_entry_point_~p~0#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_entry_point_~p~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:49:45,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#(and (not (= |ULTIMATE.start_entry_point_~p~0#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_entry_point_~p~0#1.base| |#StackHeapBarrier|))} assume !~bvult32(entry_point_~p~0#1.base, #StackHeapBarrier); {146#false} is VALID [2022-02-20 23:49:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:45,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:45,089 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:45,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041746476] [2022-02-20 23:49:45,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041746476] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:45,090 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:45,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:49:45,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107065655] [2022-02-20 23:49:45,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:45,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 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-02-20 23:49:45,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:45,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 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-02-20 23:49:45,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:45,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:49:45,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:45,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:49:45,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:45,103 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 6 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-02-20 23:49:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:45,255 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2022-02-20 23:49:45,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:49:45,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 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-02-20 23:49:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 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-02-20 23:49:45,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-02-20 23:49:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 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-02-20 23:49:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-02-20 23:49:45,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-02-20 23:49:45,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:45,294 INFO L225 Difference]: With dead ends: 35 [2022-02-20 23:49:45,294 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 23:49:45,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:45,296 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:45,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 32 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:49:45,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 23:49:45,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-02-20 23:49:45,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:45,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 29 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:45,298 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 29 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:45,299 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 29 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:45,304 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2022-02-20 23:49:45,304 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2022-02-20 23:49:45,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:45,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:45,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 35 states. [2022-02-20 23:49:45,307 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 35 states. [2022-02-20 23:49:45,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:45,309 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2022-02-20 23:49:45,309 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2022-02-20 23:49:45,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:45,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:45,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:45,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-02-20 23:49:45,311 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 10 [2022-02-20 23:49:45,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:45,312 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-02-20 23:49:45,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-02-20 23:49:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-02-20 23:49:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:49:45,312 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:45,312 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:45,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:45,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:49:45,515 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2022-02-20 23:49:45,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:45,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1133868812, now seen corresponding path program 1 times [2022-02-20 23:49:45,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:45,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519511451] [2022-02-20 23:49:45,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:45,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:45,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:45,522 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-02-20 23:49:45,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:49:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:45,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:49:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:45,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:45,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {314#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {319#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:45,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset; {319#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:45,650 INFO L272 TraceCheckUtils]: 2: Hoare triple {319#(bvult (_ bv0 32) |#StackHeapBarrier|)} call entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc(4bv32); {319#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:45,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {319#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {319#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:45,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {319#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {332#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:45,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {332#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {332#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:45,654 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {332#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ldv_malloc_#res.base| (_ bv0 32)))} {319#(bvult (_ bv0 32) |#StackHeapBarrier|)} #30#return; {339#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_entry_point_#t~ret38#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:45,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {339#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_entry_point_#t~ret38#1.base| (_ bv0 32)))} entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset; {343#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_entry_point_~p~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:45,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {343#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_entry_point_~p~0#1.base| (_ bv0 32)))} assume 0bv32 == entry_point_~p~0#1.offset; {343#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_entry_point_~p~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:45,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {343#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_entry_point_~p~0#1.base| (_ bv0 32)))} assume !~bvult32(entry_point_~p~0#1.base, #StackHeapBarrier); {315#false} is VALID [2022-02-20 23:49:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:45,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:45,656 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:45,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519511451] [2022-02-20 23:49:45,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519511451] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:45,657 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:45,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:49:45,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694022780] [2022-02-20 23:49:45,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:45,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 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-02-20 23:49:45,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:45,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 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-02-20 23:49:45,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:45,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:49:45,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:45,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:49:45,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:45,674 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 6 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-02-20 23:49:45,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:45,803 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2022-02-20 23:49:45,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:49:45,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 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-02-20 23:49:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 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-02-20 23:49:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-20 23:49:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 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-02-20 23:49:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-20 23:49:45,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-02-20 23:49:45,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:45,834 INFO L225 Difference]: With dead ends: 31 [2022-02-20 23:49:45,834 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 23:49:45,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:45,835 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:45,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 62 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 23:49:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-02-20 23:49:45,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:45,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:45,837 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:45,838 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:45,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:45,839 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2022-02-20 23:49:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2022-02-20 23:49:45,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:45,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:45,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 31 states. [2022-02-20 23:49:45,839 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 31 states. [2022-02-20 23:49:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:45,841 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2022-02-20 23:49:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2022-02-20 23:49:45,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:45,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:45,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:45,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-02-20 23:49:45,842 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 10 [2022-02-20 23:49:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:45,843 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-02-20 23:49:45,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-02-20 23:49:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-02-20 23:49:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:49:45,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:45,844 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:45,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:46,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:49:46,056 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2022-02-20 23:49:46,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:46,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1677698439, now seen corresponding path program 1 times [2022-02-20 23:49:46,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:46,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500349479] [2022-02-20 23:49:46,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:46,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:46,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:46,058 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-02-20 23:49:46,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:49:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:46,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:49:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:46,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:46,124 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-02-20 23:49:46,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {470#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {470#true} is VALID [2022-02-20 23:49:46,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {470#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset; {470#true} is VALID [2022-02-20 23:49:46,155 INFO L272 TraceCheckUtils]: 2: Hoare triple {470#true} call entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc(4bv32); {470#true} is VALID [2022-02-20 23:49:46,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {470#true} ~size := #in~size; {470#true} is VALID [2022-02-20 23:49:46,156 INFO L290 TraceCheckUtils]: 4: Hoare triple {470#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {487#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:49:46,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {487#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {487#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:49:46,157 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {487#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {470#true} #30#return; {494#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~ret38#1.base|))} is VALID [2022-02-20 23:49:46,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {494#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~ret38#1.base|))} entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset; {498#(= (select |#valid| |ULTIMATE.start_entry_point_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:46,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {498#(= (select |#valid| |ULTIMATE.start_entry_point_~p~0#1.base|) (_ bv1 1))} assume 0bv32 == entry_point_~p~0#1.offset; {498#(= (select |#valid| |ULTIMATE.start_entry_point_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:46,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {498#(= (select |#valid| |ULTIMATE.start_entry_point_~p~0#1.base|) (_ bv1 1))} assume ~bvult32(entry_point_~p~0#1.base, #StackHeapBarrier); {498#(= (select |#valid| |ULTIMATE.start_entry_point_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:46,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {498#(= (select |#valid| |ULTIMATE.start_entry_point_~p~0#1.base|) (_ bv1 1))} assume !(0bv32 == entry_point_~p~0#1.base || 1bv1 == #valid[entry_point_~p~0#1.base]); {471#false} is VALID [2022-02-20 23:49:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:46,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:46,159 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:46,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500349479] [2022-02-20 23:49:46,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500349479] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:46,159 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:46,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:49:46,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877423987] [2022-02-20 23:49:46,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:46,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:49:46,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:46,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:46,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:46,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:49:46,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:46,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:49:46,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:46,169 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:46,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:46,249 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-02-20 23:49:46,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:49:46,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:49:46,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-20 23:49:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-20 23:49:46,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-02-20 23:49:46,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:46,273 INFO L225 Difference]: With dead ends: 27 [2022-02-20 23:49:46,273 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 23:49:46,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:46,274 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:46,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 23:49:46,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 23:49:46,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:46,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:46,277 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:46,277 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:46,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:46,278 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-02-20 23:49:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-02-20 23:49:46,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:46,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:46,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 27 states. [2022-02-20 23:49:46,279 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 27 states. [2022-02-20 23:49:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:46,283 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-02-20 23:49:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-02-20 23:49:46,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:46,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:46,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:46,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-02-20 23:49:46,284 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 11 [2022-02-20 23:49:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:46,285 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-02-20 23:49:46,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-02-20 23:49:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:49:46,285 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:46,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:46,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:46,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:49:46,494 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2022-02-20 23:49:46,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:46,494 INFO L85 PathProgramCache]: Analyzing trace with hash 220275033, now seen corresponding path program 1 times [2022-02-20 23:49:46,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:46,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816197562] [2022-02-20 23:49:46,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:46,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:46,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:46,496 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-02-20 23:49:46,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:49:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:49:46,534 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:49:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:49:46,554 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 23:49:46,554 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:49:46,555 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (6 of 7 remaining) [2022-02-20 23:49:46,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (5 of 7 remaining) [2022-02-20 23:49:46,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (4 of 7 remaining) [2022-02-20 23:49:46,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (3 of 7 remaining) [2022-02-20 23:49:46,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (2 of 7 remaining) [2022-02-20 23:49:46,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (1 of 7 remaining) [2022-02-20 23:49:46,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2022-02-20 23:49:46,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-02-20 23:49:46,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:49:46,760 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 23:49:46,762 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:49:46,768 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret38 := ldv_malloc(4bv32); [2022-02-20 23:49:46,769 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 23:49:46,771 INFO L158 Benchmark]: Toolchain (without parser) took 3520.00ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 48.9MB in the beginning and 43.4MB in the end (delta: 5.4MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2022-02-20 23:49:46,771 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 69.2MB. Free memory was 51.8MB in the beginning and 51.8MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:49:46,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 550.81ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 48.7MB in the beginning and 67.9MB in the end (delta: -19.1MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2022-02-20 23:49:46,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.07ms. Allocated memory is still 88.1MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:49:46,771 INFO L158 Benchmark]: Boogie Preprocessor took 15.17ms. Allocated memory is still 88.1MB. Free memory was 65.8MB in the beginning and 64.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:49:46,772 INFO L158 Benchmark]: RCFGBuilder took 334.31ms. Allocated memory is still 88.1MB. Free memory was 64.0MB in the beginning and 53.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:49:46,772 INFO L158 Benchmark]: TraceAbstraction took 2558.74ms. Allocated memory is still 88.1MB. Free memory was 52.9MB in the beginning and 43.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:49:46,773 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 69.2MB. Free memory was 51.8MB in the beginning and 51.8MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 550.81ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 48.7MB in the beginning and 67.9MB in the end (delta: -19.1MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.07ms. Allocated memory is still 88.1MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.17ms. Allocated memory is still 88.1MB. Free memory was 65.8MB in the beginning and 64.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 334.31ms. Allocated memory is still 88.1MB. Free memory was 64.0MB in the beginning and 53.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2558.74ms. Allocated memory is still 88.1MB. Free memory was 52.9MB in the beginning and 43.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:49:46,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator