./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.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_test13_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c20063fdafbef5c00ec1f1fcfed63f5b6ab29c7a5ae9bd5cc27a6dcf474b9797 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:49:58,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:49:58,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:49:59,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:49:59,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:49:59,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:49:59,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:49:59,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:49:59,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:49:59,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:49:59,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:49:59,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:49:59,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:49:59,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:49:59,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:49:59,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:49:59,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:49:59,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:49:59,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:49:59,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:49:59,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:49:59,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:49:59,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:49:59,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:49:59,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:49:59,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:49:59,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:49:59,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:49:59,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:49:59,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:49:59,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:49:59,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:49:59,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:49:59,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:49:59,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:49:59,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:49:59,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:49:59,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:49:59,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:49:59,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:49:59,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:49:59,052 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:59,088 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:49:59,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:49:59,089 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:49:59,089 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:49:59,089 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:49:59,090 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:49:59,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:49:59,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:49:59,091 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:49:59,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:49:59,092 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:49:59,092 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:49:59,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:49:59,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:49:59,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:49:59,093 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:49:59,093 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:49:59,093 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:49:59,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:49:59,094 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:49:59,094 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:49:59,094 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:49:59,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:49:59,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:49:59,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:49:59,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:59,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:49:59,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:49:59,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:49:59,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:49:59,096 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 -> c20063fdafbef5c00ec1f1fcfed63f5b6ab29c7a5ae9bd5cc27a6dcf474b9797 [2022-02-20 23:49:59,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:49:59,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:49:59,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:49:59,344 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:49:59,344 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:49:59,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.i [2022-02-20 23:49:59,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b48eff3ba/a132343ecf2a4707b847c76689d910db/FLAG17bdd5568 [2022-02-20 23:49:59,813 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:49:59,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.i [2022-02-20 23:49:59,825 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b48eff3ba/a132343ecf2a4707b847c76689d910db/FLAG17bdd5568 [2022-02-20 23:49:59,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b48eff3ba/a132343ecf2a4707b847c76689d910db [2022-02-20 23:49:59,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:49:59,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:49:59,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:59,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:49:59,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:49:59,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:59" (1/1) ... [2022-02-20 23:49:59,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cf78670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:59, skipping insertion in model container [2022-02-20 23:49:59,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:59" (1/1) ... [2022-02-20 23:49:59,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:49:59,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:50:00,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:00,245 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:50:00,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3bee9913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:00, skipping insertion in model container [2022-02-20 23:50:00,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:00,247 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:50:00,250 INFO L158 Benchmark]: Toolchain (without parser) took 410.51ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 48.5MB in the beginning and 82.6MB in the end (delta: -34.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:50:00,251 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:50:00,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.07ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 48.2MB in the beginning and 82.9MB in the end (delta: -34.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:50:00,253 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.16ms. Allocated memory is still 88.1MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.07ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 48.2MB in the beginning and 82.9MB in the end (delta: -34.7MB). Peak memory consumption was 8.4MB. 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_test13_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c20063fdafbef5c00ec1f1fcfed63f5b6ab29c7a5ae9bd5cc27a6dcf474b9797 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:50:02,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:50:02,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:50:02,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:50:02,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:50:02,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:50:02,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:50:02,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:50:02,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:50:02,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:50:02,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:50:02,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:50:02,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:50:02,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:50:02,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:50:02,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:50:02,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:50:02,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:50:02,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:50:02,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:50:02,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:50:02,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:50:02,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:50:02,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:50:02,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:50:02,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:50:02,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:50:02,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:50:02,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:50:02,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:50:02,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:50:02,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:50:02,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:50:02,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:50:02,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:50:02,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:50:02,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:50:02,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:50:02,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:50:02,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:50:02,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:50:02,115 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:50:02,149 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:50:02,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:50:02,150 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:50:02,150 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:50:02,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:50:02,152 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:50:02,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:50:02,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:50:02,153 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:50:02,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:50:02,154 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:50:02,154 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:50:02,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:50:02,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:50:02,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:50:02,155 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:50:02,155 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:50:02,156 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:50:02,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:50:02,156 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:50:02,156 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:50:02,157 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:50:02,157 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:50:02,157 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:50:02,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:50:02,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:50:02,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:50:02,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:50:02,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:50:02,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:50:02,158 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:50:02,159 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:02,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:50:02,159 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 -> c20063fdafbef5c00ec1f1fcfed63f5b6ab29c7a5ae9bd5cc27a6dcf474b9797 [2022-02-20 23:50:02,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:50:02,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:50:02,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:50:02,505 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:50:02,506 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:50:02,507 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.i [2022-02-20 23:50:02,567 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67dd939b0/59e342cdb4a148cb83e42da4bab427bf/FLAG265bf3ec5 [2022-02-20 23:50:02,978 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:50:02,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.i [2022-02-20 23:50:02,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67dd939b0/59e342cdb4a148cb83e42da4bab427bf/FLAG265bf3ec5 [2022-02-20 23:50:03,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67dd939b0/59e342cdb4a148cb83e42da4bab427bf [2022-02-20 23:50:03,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:50:03,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:50:03,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:03,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:50:03,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:50:03,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:50:03" (1/1) ... [2022-02-20 23:50:03,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15fe8c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:03, skipping insertion in model container [2022-02-20 23:50:03,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:50:03" (1/1) ... [2022-02-20 23:50:03,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:50:03,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:50:03,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:03,527 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:50:03,536 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:50:03,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:03,616 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:50:03,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:03,753 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:50:03,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:03 WrapperNode [2022-02-20 23:50:03,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:03,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:50:03,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:50:03,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:50:03,762 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:50:03" (1/1) ... [2022-02-20 23:50:03,796 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:50:03" (1/1) ... [2022-02-20 23:50:03,810 INFO L137 Inliner]: procedures = 166, calls = 74, calls flagged for inlining = 21, calls inlined = 4, statements flattened = 22 [2022-02-20 23:50:03,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:50:03,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:50:03,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:50:03,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:50:03,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:03" (1/1) ... [2022-02-20 23:50:03,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:03" (1/1) ... [2022-02-20 23:50:03,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:03" (1/1) ... [2022-02-20 23:50:03,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:03" (1/1) ... [2022-02-20 23:50:03,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:03" (1/1) ... [2022-02-20 23:50:03,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:03" (1/1) ... [2022-02-20 23:50:03,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:03" (1/1) ... [2022-02-20 23:50:03,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:50:03,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:50:03,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:50:03,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:50:03,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:03" (1/1) ... [2022-02-20 23:50:03,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:50:03,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:50:03,865 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:50:03,885 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:50:03,900 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-02-20 23:50:03,900 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-02-20 23:50:03,900 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-02-20 23:50:03,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-02-20 23:50:03,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:50:03,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:50:03,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2022-02-20 23:50:03,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2022-02-20 23:50:03,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:50:03,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:50:03,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:50:03,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:50:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:50:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:50:03,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:50:03,994 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:50:03,996 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:50:04,315 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:50:04,321 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:50:04,328 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:50:04,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:50:04 BoogieIcfgContainer [2022-02-20 23:50:04,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:50:04,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:50:04,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:50:04,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:50:04,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:50:03" (1/3) ... [2022-02-20 23:50:04,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca35369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:50:04, skipping insertion in model container [2022-02-20 23:50:04,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:03" (2/3) ... [2022-02-20 23:50:04,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca35369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:50:04, skipping insertion in model container [2022-02-20 23:50:04,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:50:04" (3/3) ... [2022-02-20 23:50:04,336 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test13_1.i [2022-02-20 23:50:04,340 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:50:04,340 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-02-20 23:50:04,383 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:50:04,389 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:50:04,389 INFO L340 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-02-20 23:50:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 25 states have (on average 1.68) internal successors, (42), 41 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:50:04,411 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:04,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:04,412 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_list_addErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:04,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:04,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1806778067, now seen corresponding path program 1 times [2022-02-20 23:50:04,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:04,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098091886] [2022-02-20 23:50:04,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:04,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:04,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:04,433 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:50:04,437 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:50:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:04,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:50:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:04,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:04,720 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:50:04,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:50:04,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {57#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:04,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {57#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:04,797 INFO L272 TraceCheckUtils]: 2: Hoare triple {57#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {64#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:04,798 INFO L290 TraceCheckUtils]: 3: Hoare triple {64#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} ~size := #in~size; {64#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:04,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {64#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} 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; {71#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:50:04,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {71#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} assume true; {71#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:50:04,802 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {71#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} {57#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} #58#return; {57#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:04,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {57#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:04,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {57#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {57#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:04,805 INFO L272 TraceCheckUtils]: 9: Hoare triple {57#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {87#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) |ldv_list_add_#in~head.base|))} is VALID [2022-02-20 23:50:04,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {87#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) |ldv_list_add_#in~head.base|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {91#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) ldv_list_add_~head.base))} is VALID [2022-02-20 23:50:04,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {91#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) ldv_list_add_~head.base))} assume !(1bv1 == #valid[~head.base]); {53#false} is VALID [2022-02-20 23:50:04,807 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:50:04,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:04,808 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:04,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098091886] [2022-02-20 23:50:04,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098091886] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:04,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:04,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:04,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961876512] [2022-02-20 23:50:04,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:04,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:50:04,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:04,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:04,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:04,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:50:04,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:04,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:50:04,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:50:04,855 INFO L87 Difference]: Start difference. First operand has 49 states, 25 states have (on average 1.68) internal successors, (42), 41 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:05,551 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-02-20 23:50:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:50:05,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:50:05,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-02-20 23:50:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-02-20 23:50:05,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2022-02-20 23:50:05,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:05,652 INFO L225 Difference]: With dead ends: 50 [2022-02-20 23:50:05,652 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 23:50:05,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:50:05,656 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 106 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:05,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 60 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 12 Unchecked, 0.2s Time] [2022-02-20 23:50:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 23:50:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-02-20 23:50:05,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:05,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 46 states, 24 states have (on average 1.625) internal successors, (39), 38 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:05,683 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 46 states, 24 states have (on average 1.625) internal successors, (39), 38 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:05,683 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 46 states, 24 states have (on average 1.625) internal successors, (39), 38 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:05,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:05,687 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-02-20 23:50:05,687 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2022-02-20 23:50:05,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:05,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:05,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 24 states have (on average 1.625) internal successors, (39), 38 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 48 states. [2022-02-20 23:50:05,689 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 1.625) internal successors, (39), 38 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 48 states. [2022-02-20 23:50:05,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:05,693 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-02-20 23:50:05,693 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2022-02-20 23:50:05,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:05,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:05,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:05,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:05,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.625) internal successors, (39), 38 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-02-20 23:50:05,698 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 12 [2022-02-20 23:50:05,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:05,698 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-02-20 23:50:05,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-02-20 23:50:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:50:05,699 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:05,700 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:05,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:05,913 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:50:05,913 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_list_addErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1806778068, now seen corresponding path program 1 times [2022-02-20 23:50:05,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:05,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678475913] [2022-02-20 23:50:05,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:05,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:05,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:05,917 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:50:05,943 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:50:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:05,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:50:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:05,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:08,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:08,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:08,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {296#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {301#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:08,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {301#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:08,369 INFO L272 TraceCheckUtils]: 2: Hoare triple {301#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (_ bv0 32)))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {308#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:08,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {308#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} ~size := #in~size; {308#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:08,371 INFO L290 TraceCheckUtils]: 4: Hoare triple {308#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} 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; {315#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((v_ArrVal_6 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_6)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:08,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {315#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((v_ArrVal_6 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_6)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume true; {315#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((v_ArrVal_6 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_6)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:08,374 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {315#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((v_ArrVal_6 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_6)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))) (= |~#global_list_13~0.offset| (_ bv0 32)))} {301#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (_ bv0 32)))} #58#return; {322#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:08,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {322#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {322#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:08,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {322#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {322#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:08,377 INFO L272 TraceCheckUtils]: 9: Hoare triple {322#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {332#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |ldv_list_add_#in~head.base|) (= (_ bv0 32) |ldv_list_add_#in~head.offset|))} is VALID [2022-02-20 23:50:08,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {332#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |ldv_list_add_#in~head.base|) (= (_ bv0 32) |ldv_list_add_#in~head.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {336#(and (= ldv_list_add_~head.offset (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) ldv_list_add_~head.base))} is VALID [2022-02-20 23:50:08,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {336#(and (= ldv_list_add_~head.offset (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) ldv_list_add_~head.base))} assume !((~bvule32(~bvadd32(4bv32, ~head.offset), #length[~head.base]) && ~bvule32(~head.offset, ~bvadd32(4bv32, ~head.offset))) && ~bvule32(0bv32, ~head.offset)); {297#false} is VALID [2022-02-20 23:50:08,378 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:50:08,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:08,379 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:08,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678475913] [2022-02-20 23:50:08,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678475913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:08,379 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:08,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:08,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887212069] [2022-02-20 23:50:08,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:08,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:50:08,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:08,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:08,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:08,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:08,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:08,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:08,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=41, Unknown=1, NotChecked=0, Total=56 [2022-02-20 23:50:08,400 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:15,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:15,400 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2022-02-20 23:50:15,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:50:15,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:50:15,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:15,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2022-02-20 23:50:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2022-02-20 23:50:15,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2022-02-20 23:50:15,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:15,500 INFO L225 Difference]: With dead ends: 66 [2022-02-20 23:50:15,500 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 23:50:15,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=64, Invalid=142, Unknown=4, NotChecked=0, Total=210 [2022-02-20 23:50:15,501 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 110 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:15,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 90 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 148 Invalid, 0 Unknown, 51 Unchecked, 0.3s Time] [2022-02-20 23:50:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 23:50:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2022-02-20 23:50:15,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:15,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 45 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 37 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:15,508 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 45 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 37 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:15,508 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 45 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 37 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:15,512 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2022-02-20 23:50:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2022-02-20 23:50:15,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:15,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:15,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 37 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 66 states. [2022-02-20 23:50:15,513 INFO L87 Difference]: Start difference. First operand has 45 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 37 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 66 states. [2022-02-20 23:50:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:15,517 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2022-02-20 23:50:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2022-02-20 23:50:15,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:15,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:15,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:15,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 37 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-02-20 23:50:15,520 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 12 [2022-02-20 23:50:15,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:15,520 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-02-20 23:50:15,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-02-20 23:50:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:50:15,521 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:15,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:15,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:50:15,730 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:50:15,730 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:15,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:15,731 INFO L85 PathProgramCache]: Analyzing trace with hash 177362515, now seen corresponding path program 1 times [2022-02-20 23:50:15,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:15,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078729036] [2022-02-20 23:50:15,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:15,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:15,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:15,733 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:50:15,735 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:50:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:15,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:50:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:15,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:15,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {596#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {596#true} is VALID [2022-02-20 23:50:15,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {596#true} is VALID [2022-02-20 23:50:15,841 INFO L272 TraceCheckUtils]: 2: Hoare triple {596#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {596#true} is VALID [2022-02-20 23:50:15,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {596#true} ~size := #in~size; {596#true} is VALID [2022-02-20 23:50:15,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {596#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; {613#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:15,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {613#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {613#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:15,844 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {613#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {596#true} #58#return; {620#(not (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:15,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {620#(not (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv0 32)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {624#(not (= |ULTIMATE.start_alloc_13_~p~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:15,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {624#(not (= |ULTIMATE.start_alloc_13_~p~0#1.base| (_ bv0 32)))} assume !(alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32); {597#false} is VALID [2022-02-20 23:50:15,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {597#false} assume { :end_inline_alloc_13 } true; {597#false} is VALID [2022-02-20 23:50:15,845 INFO L272 TraceCheckUtils]: 10: Hoare triple {597#false} call LDV_INIT_LIST_HEAD(~#global_list_13~0.base, ~#global_list_13~0.offset); {597#false} is VALID [2022-02-20 23:50:15,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {597#false} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {597#false} is VALID [2022-02-20 23:50:15,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {597#false} assume !(1bv1 == #valid[~list.base]); {597#false} is VALID [2022-02-20 23:50:15,851 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:50:15,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:15,851 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:15,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078729036] [2022-02-20 23:50:15,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078729036] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:15,852 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:15,852 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:15,852 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022604622] [2022-02-20 23:50:15,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:15,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:50:15,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:15,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:15,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:15,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:15,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:15,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:15,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:15,869 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:16,130 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-02-20 23:50:16,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:16,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:50:16,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:16,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-02-20 23:50:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-02-20 23:50:16,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-02-20 23:50:16,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:16,213 INFO L225 Difference]: With dead ends: 55 [2022-02-20 23:50:16,213 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 23:50:16,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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:50:16,215 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:16,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 190 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:50:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 23:50:16,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2022-02-20 23:50:16,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:16,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 49 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 40 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:16,220 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 49 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 40 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:16,221 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 49 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 40 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:16,224 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-02-20 23:50:16,224 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-02-20 23:50:16,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:16,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:16,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 40 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 55 states. [2022-02-20 23:50:16,225 INFO L87 Difference]: Start difference. First operand has 49 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 40 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 55 states. [2022-02-20 23:50:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:16,228 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-02-20 23:50:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-02-20 23:50:16,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:16,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:16,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:16,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 40 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2022-02-20 23:50:16,231 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 13 [2022-02-20 23:50:16,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:16,231 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-02-20 23:50:16,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:16,231 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-02-20 23:50:16,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:50:16,232 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:16,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:16,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 23:50:16,440 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:50:16,441 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:16,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:16,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1630091948, now seen corresponding path program 1 times [2022-02-20 23:50:16,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:16,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991041007] [2022-02-20 23:50:16,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:16,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:16,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:16,443 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:50:16,445 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:50:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:16,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:16,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:16,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {853#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {858#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:16,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {858#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {858#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:16,642 INFO L272 TraceCheckUtils]: 2: Hoare triple {858#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {865#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:16,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {865#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} ~size := #in~size; {865#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:16,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {865#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {865#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:16,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {865#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} assume true; {865#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:16,645 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {865#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} {858#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} #58#return; {858#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:16,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {858#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {858#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:16,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {858#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume !(alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32); {858#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:16,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {858#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume { :end_inline_alloc_13 } true; {858#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:16,647 INFO L272 TraceCheckUtils]: 10: Hoare triple {858#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} call LDV_INIT_LIST_HEAD(~#global_list_13~0.base, ~#global_list_13~0.offset); {890#(and (= (_ bv2 32) |LDV_INIT_LIST_HEAD_#in~list.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:16,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {890#(and (= (_ bv2 32) |LDV_INIT_LIST_HEAD_#in~list.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {894#(and (= (_ bv2 32) LDV_INIT_LIST_HEAD_~list.base) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:16,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {894#(and (= (_ bv2 32) LDV_INIT_LIST_HEAD_~list.base) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume !(1bv1 == #valid[~list.base]); {854#false} is VALID [2022-02-20 23:50:16,649 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:50:16,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:16,649 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:16,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991041007] [2022-02-20 23:50:16,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991041007] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:16,650 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:16,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:16,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962433382] [2022-02-20 23:50:16,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:16,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:50:16,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:16,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:16,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:16,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:16,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:16,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:16,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:16,665 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:17,150 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2022-02-20 23:50:17,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:17,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:50:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:17,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-02-20 23:50:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-02-20 23:50:17,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2022-02-20 23:50:17,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:17,210 INFO L225 Difference]: With dead ends: 47 [2022-02-20 23:50:17,210 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 23:50:17,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:17,211 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 69 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:17,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 49 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:50:17,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 23:50:17,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 23:50:17,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:17,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 38 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:17,221 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 38 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:17,221 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 38 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:17,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:17,223 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2022-02-20 23:50:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-02-20 23:50:17,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:17,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:17,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 38 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 47 states. [2022-02-20 23:50:17,224 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 38 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 47 states. [2022-02-20 23:50:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:17,226 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2022-02-20 23:50:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-02-20 23:50:17,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:17,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:17,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:17,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 38 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-02-20 23:50:17,228 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 13 [2022-02-20 23:50:17,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:17,229 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-02-20 23:50:17,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:17,229 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-02-20 23:50:17,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:50:17,230 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:17,230 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:17,238 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:50:17,438 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:50:17,438 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:17,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:17,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1630091947, now seen corresponding path program 1 times [2022-02-20 23:50:17,439 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:17,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841366031] [2022-02-20 23:50:17,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:17,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:17,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:17,440 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:50:17,441 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:50:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:17,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:50:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:17,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:17,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {1091#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {1096#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:17,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {1096#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:17,719 INFO L272 TraceCheckUtils]: 2: Hoare triple {1096#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {1103#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:17,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {1103#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} ~size := #in~size; {1103#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:17,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {1103#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1103#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:17,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {1103#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume true; {1103#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:17,721 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1103#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} {1096#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} #58#return; {1096#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:17,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {1096#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {1096#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:17,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {1096#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume !(alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32); {1096#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:17,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {1096#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume { :end_inline_alloc_13 } true; {1096#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:17,724 INFO L272 TraceCheckUtils]: 10: Hoare triple {1096#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} call LDV_INIT_LIST_HEAD(~#global_list_13~0.base, ~#global_list_13~0.offset); {1128#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |LDV_INIT_LIST_HEAD_#in~list.base|) (= (_ bv0 32) |LDV_INIT_LIST_HEAD_#in~list.offset|))} is VALID [2022-02-20 23:50:17,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {1128#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |LDV_INIT_LIST_HEAD_#in~list.base|) (= (_ bv0 32) |LDV_INIT_LIST_HEAD_#in~list.offset|))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {1132#(and (= (_ bv2 32) LDV_INIT_LIST_HEAD_~list.base) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= LDV_INIT_LIST_HEAD_~list.offset (_ bv0 32)))} is VALID [2022-02-20 23:50:17,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {1132#(and (= (_ bv2 32) LDV_INIT_LIST_HEAD_~list.base) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= LDV_INIT_LIST_HEAD_~list.offset (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~list.offset), #length[~list.base]) && ~bvule32(~list.offset, ~bvadd32(4bv32, ~list.offset))) && ~bvule32(0bv32, ~list.offset)); {1092#false} is VALID [2022-02-20 23:50:17,726 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:50:17,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:17,726 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:17,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841366031] [2022-02-20 23:50:17,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841366031] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:17,727 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:17,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:17,728 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328375391] [2022-02-20 23:50:17,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:17,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:50:17,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:17,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:17,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:17,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:17,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:17,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:17,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:17,744 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:18,615 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-02-20 23:50:18,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:18,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:50:18,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-02-20 23:50:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-02-20 23:50:18,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2022-02-20 23:50:18,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:18,708 INFO L225 Difference]: With dead ends: 79 [2022-02-20 23:50:18,708 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 23:50:18,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:18,709 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 60 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:18,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 147 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:50:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 23:50:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2022-02-20 23:50:18,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:18,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 68 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 54 states have internal predecessors, (62), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:18,715 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 68 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 54 states have internal predecessors, (62), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:18,715 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 68 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 54 states have internal predecessors, (62), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:18,717 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-02-20 23:50:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-02-20 23:50:18,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:18,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:18,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 54 states have internal predecessors, (62), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 79 states. [2022-02-20 23:50:18,719 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 54 states have internal predecessors, (62), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 79 states. [2022-02-20 23:50:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:18,721 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-02-20 23:50:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-02-20 23:50:18,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:18,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:18,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:18,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 54 states have internal predecessors, (62), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-02-20 23:50:18,725 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 13 [2022-02-20 23:50:18,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:18,725 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-02-20 23:50:18,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-02-20 23:50:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:50:18,726 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:18,726 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:18,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:18,934 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:50:18,934 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __ldv_list_addErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1195264903, now seen corresponding path program 1 times [2022-02-20 23:50:18,935 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:18,935 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788297080] [2022-02-20 23:50:18,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:18,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:18,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:18,936 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:18,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:50:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:18,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:50:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:18,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:19,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:19,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {1446#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:19,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:19,143 INFO L272 TraceCheckUtils]: 2: Hoare triple {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:19,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} ~size := #in~size; {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:19,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} 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; {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:19,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} assume true; {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:19,146 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} #58#return; {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:19,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:19,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:19,147 INFO L272 TraceCheckUtils]: 9: Hoare triple {1451#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {1479#(= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)} is VALID [2022-02-20 23:50:19,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {1479#(= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1483#(= (select (select |#memory_$Pointer$.base| ldv_list_add_~head.base) ldv_list_add_~head.offset) ldv_list_add_~head.base)} is VALID [2022-02-20 23:50:19,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {1483#(= (select (select |#memory_$Pointer$.base| ldv_list_add_~head.base) ldv_list_add_~head.offset) ldv_list_add_~head.base)} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {1487#(= (select |#valid| |ldv_list_add_#t~mem14.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:19,150 INFO L272 TraceCheckUtils]: 12: Hoare triple {1487#(= (select |#valid| |ldv_list_add_#t~mem14.base|) (_ bv1 1))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {1491#(= (select |#valid| |__ldv_list_add_#in~next.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:19,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {1491#(= (select |#valid| |__ldv_list_add_#in~next.base|) (_ bv1 1))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {1495#(= (select |#valid| __ldv_list_add_~next.base) (_ bv1 1))} is VALID [2022-02-20 23:50:19,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {1495#(= (select |#valid| __ldv_list_add_~next.base) (_ bv1 1))} assume !(1bv1 == #valid[~next.base]); {1447#false} is VALID [2022-02-20 23:50:19,151 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:50:19,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:19,151 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:19,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788297080] [2022-02-20 23:50:19,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788297080] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:19,152 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:19,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:19,152 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418893857] [2022-02-20 23:50:19,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:19,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:50:19,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:19,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:19,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:19,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:19,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:19,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:19,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:50:19,169 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:19,827 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-02-20 23:50:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:19,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:50:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-02-20 23:50:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-02-20 23:50:19,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2022-02-20 23:50:19,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:19,896 INFO L225 Difference]: With dead ends: 77 [2022-02-20 23:50:19,896 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 23:50:19,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:50:19,897 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 40 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:19,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 157 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:50:19,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 23:50:19,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2022-02-20 23:50:19,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:19,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 67 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 53 states have internal predecessors, (60), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:19,902 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 67 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 53 states have internal predecessors, (60), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:19,902 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 67 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 53 states have internal predecessors, (60), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:19,905 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-02-20 23:50:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-02-20 23:50:19,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:19,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:19,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 53 states have internal predecessors, (60), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 77 states. [2022-02-20 23:50:19,906 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 53 states have internal predecessors, (60), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 77 states. [2022-02-20 23:50:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:19,908 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-02-20 23:50:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-02-20 23:50:19,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:19,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:19,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:19,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 53 states have internal predecessors, (60), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-02-20 23:50:19,912 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 15 [2022-02-20 23:50:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:19,912 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-02-20 23:50:19,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-02-20 23:50:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:50:19,913 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:19,913 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:19,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:20,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:20,124 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __ldv_list_addErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:20,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1195264904, now seen corresponding path program 1 times [2022-02-20 23:50:20,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:20,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271953382] [2022-02-20 23:50:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:20,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:20,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:20,126 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:20,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:50:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:20,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 23:50:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:20,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:22,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:22,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:22,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:22,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:22,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {1808#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {1813#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:22,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {1813#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {1813#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:22,804 INFO L272 TraceCheckUtils]: 2: Hoare triple {1813#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {1820#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:22,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {1820#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} ~size := #in~size; {1820#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:22,805 INFO L290 TraceCheckUtils]: 4: Hoare triple {1820#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} 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; {1827#(and (exists ((v_ArrVal_13 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_13)))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:22,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {1827#(and (exists ((v_ArrVal_13 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_13)))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume true; {1827#(and (exists ((v_ArrVal_13 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_13)))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:22,808 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1827#(and (exists ((v_ArrVal_13 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_13)))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} {1813#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} #58#return; {1834#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:22,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {1834#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {1834#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:22,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {1834#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {1834#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:22,811 INFO L272 TraceCheckUtils]: 9: Hoare triple {1834#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {1844#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) (_ bv0 32))) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) (_ bv0 32))) (= (_ bv2 32) |ldv_list_add_#in~head.base|) (= (_ bv0 32) |ldv_list_add_#in~head.offset|))} is VALID [2022-02-20 23:50:22,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {1844#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) (_ bv0 32))) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) (_ bv0 32))) (= (_ bv2 32) |ldv_list_add_#in~head.base|) (= (_ bv0 32) |ldv_list_add_#in~head.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1848#(and (= (select (select |#memory_$Pointer$.base| ldv_list_add_~head.base) (_ bv0 32)) ldv_list_add_~head.base) (= ldv_list_add_~head.offset (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) ldv_list_add_~head.base) (= (select (select |#memory_$Pointer$.offset| ldv_list_add_~head.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:50:22,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {1848#(and (= (select (select |#memory_$Pointer$.base| ldv_list_add_~head.base) (_ bv0 32)) ldv_list_add_~head.base) (= ldv_list_add_~head.offset (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) ldv_list_add_~head.base) (= (select (select |#memory_$Pointer$.offset| ldv_list_add_~head.base) (_ bv0 32)) (_ bv0 32)))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {1852#(and (= |ldv_list_add_#t~mem14.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |ldv_list_add_#t~mem14.base|))} is VALID [2022-02-20 23:50:22,813 INFO L272 TraceCheckUtils]: 12: Hoare triple {1852#(and (= |ldv_list_add_#t~mem14.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |ldv_list_add_#t~mem14.base|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {1856#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |__ldv_list_add_#in~next.offset| (_ bv0 32)) (= (_ bv2 32) |__ldv_list_add_#in~next.base|))} is VALID [2022-02-20 23:50:22,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {1856#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |__ldv_list_add_#in~next.offset| (_ bv0 32)) (= (_ bv2 32) |__ldv_list_add_#in~next.base|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {1860#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= __ldv_list_add_~next.offset (_ bv0 32)) (= (_ bv2 32) __ldv_list_add_~next.base))} is VALID [2022-02-20 23:50:22,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {1860#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= __ldv_list_add_~next.offset (_ bv0 32)) (= (_ bv2 32) __ldv_list_add_~next.base))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, ~next.offset)), #length[~next.base]) && ~bvule32(~bvadd32(4bv32, ~next.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, ~next.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, ~next.offset))); {1809#false} is VALID [2022-02-20 23:50:22,814 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:50:22,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:22,814 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:22,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271953382] [2022-02-20 23:50:22,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271953382] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:22,814 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:22,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:50:22,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935849847] [2022-02-20 23:50:22,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:22,815 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:50:22,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:22,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:22,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:22,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:50:22,835 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:22,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:50:22,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=89, Unknown=1, NotChecked=0, Total=110 [2022-02-20 23:50:22,836 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:28,342 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-02-20 23:50:28,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:50:28,342 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:50:28,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 57 transitions. [2022-02-20 23:50:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 57 transitions. [2022-02-20 23:50:28,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 57 transitions. [2022-02-20 23:50:28,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:28,438 INFO L225 Difference]: With dead ends: 71 [2022-02-20 23:50:28,438 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 23:50:28,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=95, Invalid=322, Unknown=3, NotChecked=0, Total=420 [2022-02-20 23:50:28,439 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 64 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:28,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 149 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 183 Invalid, 0 Unknown, 37 Unchecked, 0.4s Time] [2022-02-20 23:50:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 23:50:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2022-02-20 23:50:28,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:28,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 52 states have internal predecessors, (58), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:28,445 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 52 states have internal predecessors, (58), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:28,446 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 52 states have internal predecessors, (58), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:28,448 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-02-20 23:50:28,448 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-02-20 23:50:28,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:28,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:28,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 52 states have internal predecessors, (58), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 71 states. [2022-02-20 23:50:28,449 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 52 states have internal predecessors, (58), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 71 states. [2022-02-20 23:50:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:28,451 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-02-20 23:50:28,451 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-02-20 23:50:28,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:28,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:28,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:28,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 52 states have internal predecessors, (58), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-02-20 23:50:28,454 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 15 [2022-02-20 23:50:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:28,454 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-02-20 23:50:28,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-02-20 23:50:28,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:50:28,455 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:28,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:28,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:28,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:28,666 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __ldv_list_addErr2REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:28,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:28,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1601493656, now seen corresponding path program 1 times [2022-02-20 23:50:28,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:28,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588816501] [2022-02-20 23:50:28,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:28,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:28,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:28,667 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:28,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:50:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:28,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:50:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:28,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:28,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:50:28,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {2162#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {2162#true} is VALID [2022-02-20 23:50:28,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {2162#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {2162#true} is VALID [2022-02-20 23:50:28,838 INFO L272 TraceCheckUtils]: 2: Hoare triple {2162#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {2162#true} is VALID [2022-02-20 23:50:28,838 INFO L290 TraceCheckUtils]: 3: Hoare triple {2162#true} ~size := #in~size; {2162#true} is VALID [2022-02-20 23:50:28,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {2162#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; {2179#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:28,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {2179#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {2179#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:28,840 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2179#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {2162#true} #58#return; {2186#(= (select |#valid| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:28,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {2186#(= (select |#valid| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv1 1))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {2190#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:28,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {2190#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {2190#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:28,842 INFO L272 TraceCheckUtils]: 9: Hoare triple {2190#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {2197#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:28,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {2197#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~new.base|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2201#(= (_ bv1 1) (select |#valid| ldv_list_add_~new.base))} is VALID [2022-02-20 23:50:28,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {2201#(= (_ bv1 1) (select |#valid| ldv_list_add_~new.base))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {2201#(= (_ bv1 1) (select |#valid| ldv_list_add_~new.base))} is VALID [2022-02-20 23:50:28,845 INFO L272 TraceCheckUtils]: 12: Hoare triple {2201#(= (_ bv1 1) (select |#valid| ldv_list_add_~new.base))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {2208#(= (select |#valid| |__ldv_list_add_#in~new.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:28,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {2208#(= (select |#valid| |__ldv_list_add_#in~new.base|) (_ bv1 1))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {2212#(= (select |#valid| __ldv_list_add_~new.base) (_ bv1 1))} is VALID [2022-02-20 23:50:28,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {2212#(= (select |#valid| __ldv_list_add_~new.base) (_ bv1 1))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {2212#(= (select |#valid| __ldv_list_add_~new.base) (_ bv1 1))} is VALID [2022-02-20 23:50:28,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {2212#(= (select |#valid| __ldv_list_add_~new.base) (_ bv1 1))} assume !(1bv1 == #valid[~new.base]); {2163#false} is VALID [2022-02-20 23:50:28,847 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:50:28,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:28,847 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:28,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588816501] [2022-02-20 23:50:28,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588816501] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:28,847 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:28,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:50:28,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298457656] [2022-02-20 23:50:28,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:28,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:28,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:28,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:28,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:28,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:50:28,862 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:28,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:50:28,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:28,862 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:29,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:29,650 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-02-20 23:50:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:29,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:29,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:29,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2022-02-20 23:50:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2022-02-20 23:50:29,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 71 transitions. [2022-02-20 23:50:29,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:29,720 INFO L225 Difference]: With dead ends: 72 [2022-02-20 23:50:29,720 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 23:50:29,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:50:29,721 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:29,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 169 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:50:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 23:50:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2022-02-20 23:50:29,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:29,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 65 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 51 states have internal predecessors, (55), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:29,725 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 65 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 51 states have internal predecessors, (55), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:29,726 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 65 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 51 states have internal predecessors, (55), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:29,728 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-02-20 23:50:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-02-20 23:50:29,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:29,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:29,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 51 states have internal predecessors, (55), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 72 states. [2022-02-20 23:50:29,729 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 51 states have internal predecessors, (55), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 72 states. [2022-02-20 23:50:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:29,731 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-02-20 23:50:29,731 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-02-20 23:50:29,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:29,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:29,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:29,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 51 states have internal predecessors, (55), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-02-20 23:50:29,733 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 16 [2022-02-20 23:50:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:29,733 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-02-20 23:50:29,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-02-20 23:50:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:50:29,734 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:29,734 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:29,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 23:50:29,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:29,943 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __ldv_list_addErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:29,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:29,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1601493655, now seen corresponding path program 1 times [2022-02-20 23:50:29,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:29,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294848414] [2022-02-20 23:50:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:29,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:29,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:29,945 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:29,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:50:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:30,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:50:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:30,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:30,036 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:50:30,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {2503#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {2503#true} is VALID [2022-02-20 23:50:30,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {2503#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {2503#true} is VALID [2022-02-20 23:50:30,223 INFO L272 TraceCheckUtils]: 2: Hoare triple {2503#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {2503#true} is VALID [2022-02-20 23:50:30,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {2503#true} ~size := #in~size; {2517#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:30,225 INFO L290 TraceCheckUtils]: 4: Hoare triple {2517#(= ldv_malloc_~size |ldv_malloc_#in~size|)} 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; {2521#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:30,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {2521#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {2521#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:30,227 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2521#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {2503#true} #58#return; {2528#(and (= (select |#length| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv12 32)) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:30,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {2528#(and (= (select |#length| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv12 32)) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {2532#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:50:30,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {2532#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {2532#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:50:30,233 INFO L272 TraceCheckUtils]: 9: Hoare triple {2532#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {2539#(and (= (select |#length| |ldv_list_add_#in~new.base|) (_ bv12 32)) (= (_ bv4 32) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:30,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {2539#(and (= (select |#length| |ldv_list_add_#in~new.base|) (_ bv12 32)) (= (_ bv4 32) |ldv_list_add_#in~new.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2543#(and (= (select |#length| ldv_list_add_~new.base) (_ bv12 32)) (= ldv_list_add_~new.offset (_ bv4 32)))} is VALID [2022-02-20 23:50:30,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {2543#(and (= (select |#length| ldv_list_add_~new.base) (_ bv12 32)) (= ldv_list_add_~new.offset (_ bv4 32)))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {2543#(and (= (select |#length| ldv_list_add_~new.base) (_ bv12 32)) (= ldv_list_add_~new.offset (_ bv4 32)))} is VALID [2022-02-20 23:50:30,235 INFO L272 TraceCheckUtils]: 12: Hoare triple {2543#(and (= (select |#length| ldv_list_add_~new.base) (_ bv12 32)) (= ldv_list_add_~new.offset (_ bv4 32)))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {2550#(and (= (select |#length| |__ldv_list_add_#in~new.base|) (_ bv12 32)) (= |__ldv_list_add_#in~new.offset| (_ bv4 32)))} is VALID [2022-02-20 23:50:30,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {2550#(and (= (select |#length| |__ldv_list_add_#in~new.base|) (_ bv12 32)) (= |__ldv_list_add_#in~new.offset| (_ bv4 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {2554#(and (= (_ bv4 32) __ldv_list_add_~new.offset) (= (select |#length| __ldv_list_add_~new.base) (_ bv12 32)))} is VALID [2022-02-20 23:50:30,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {2554#(and (= (_ bv4 32) __ldv_list_add_~new.offset) (= (select |#length| __ldv_list_add_~new.base) (_ bv12 32)))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {2554#(and (= (_ bv4 32) __ldv_list_add_~new.offset) (= (select |#length| __ldv_list_add_~new.base) (_ bv12 32)))} is VALID [2022-02-20 23:50:30,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {2554#(and (= (_ bv4 32) __ldv_list_add_~new.offset) (= (select |#length| __ldv_list_add_~new.base) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ~new.offset), #length[~new.base]) && ~bvule32(~new.offset, ~bvadd32(4bv32, ~new.offset))) && ~bvule32(0bv32, ~new.offset)); {2504#false} is VALID [2022-02-20 23:50:30,237 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:50:30,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:30,238 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:30,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294848414] [2022-02-20 23:50:30,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294848414] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:30,238 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:30,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:50:30,238 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630797463] [2022-02-20 23:50:30,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:30,239 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:30,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:30,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:30,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:30,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:50:30,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:30,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:50:30,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:50:30,257 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:31,226 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-02-20 23:50:31,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:31,227 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:31,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:31,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:31,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2022-02-20 23:50:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2022-02-20 23:50:31,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2022-02-20 23:50:31,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:31,304 INFO L225 Difference]: With dead ends: 70 [2022-02-20 23:50:31,304 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 23:50:31,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:50:31,312 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:31,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 215 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:50:31,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 23:50:31,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-02-20 23:50:31,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:31,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 65 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 51 states have internal predecessors, (53), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:31,316 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 65 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 51 states have internal predecessors, (53), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:31,316 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 65 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 51 states have internal predecessors, (53), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:31,318 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-02-20 23:50:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-02-20 23:50:31,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:31,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:31,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 51 states have internal predecessors, (53), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 70 states. [2022-02-20 23:50:31,319 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 51 states have internal predecessors, (53), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 70 states. [2022-02-20 23:50:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:31,321 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-02-20 23:50:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-02-20 23:50:31,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:31,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:31,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:31,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 51 states have internal predecessors, (53), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2022-02-20 23:50:31,323 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 16 [2022-02-20 23:50:31,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:31,324 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2022-02-20 23:50:31,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-02-20 23:50:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:50:31,325 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:31,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:31,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:31,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:31,534 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __ldv_list_addErr2REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:31,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:31,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1472410937, now seen corresponding path program 1 times [2022-02-20 23:50:31,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:31,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394098424] [2022-02-20 23:50:31,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:31,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:31,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:31,536 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:31,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:50:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:31,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:31,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:31,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {2841#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {2841#true} is VALID [2022-02-20 23:50:31,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {2841#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {2841#true} is VALID [2022-02-20 23:50:31,680 INFO L272 TraceCheckUtils]: 2: Hoare triple {2841#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {2841#true} is VALID [2022-02-20 23:50:31,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {2841#true} ~size := #in~size; {2841#true} is VALID [2022-02-20 23:50:31,681 INFO L290 TraceCheckUtils]: 4: Hoare triple {2841#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {2858#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:31,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {2858#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {2858#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:31,683 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2858#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {2841#true} #58#return; {2865#(and (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv0 32)) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:31,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {2865#(and (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv0 32)) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {2869#(and (= |ULTIMATE.start_alloc_13_~p~0#1.base| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:50:31,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {2869#(and (= |ULTIMATE.start_alloc_13_~p~0#1.base| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {2842#false} is VALID [2022-02-20 23:50:31,684 INFO L272 TraceCheckUtils]: 9: Hoare triple {2842#false} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {2842#false} is VALID [2022-02-20 23:50:31,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {2842#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2842#false} is VALID [2022-02-20 23:50:31,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {2842#false} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {2842#false} is VALID [2022-02-20 23:50:31,684 INFO L272 TraceCheckUtils]: 12: Hoare triple {2842#false} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {2842#false} is VALID [2022-02-20 23:50:31,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {2842#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {2842#false} is VALID [2022-02-20 23:50:31,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {2842#false} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {2842#false} is VALID [2022-02-20 23:50:31,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {2842#false} assume !(1bv1 == #valid[~new.base]); {2842#false} is VALID [2022-02-20 23:50:31,684 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:50:31,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:31,685 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:31,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394098424] [2022-02-20 23:50:31,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394098424] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:31,685 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:31,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:31,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853908948] [2022-02-20 23:50:31,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:31,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:31,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:31,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:31,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:31,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:31,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:31,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:31,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:31,702 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:31,884 INFO L93 Difference]: Finished difference Result 51 states and 50 transitions. [2022-02-20 23:50:31,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:31,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:31,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 23:50:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:31,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 23:50:31,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-02-20 23:50:31,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:31,930 INFO L225 Difference]: With dead ends: 51 [2022-02-20 23:50:31,930 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 23:50:31,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:50:31,931 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:31,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 150 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:50:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 23:50:31,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2022-02-20 23:50:31,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:31,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 48 states, 32 states have (on average 1.15625) internal successors, (37), 37 states have internal predecessors, (37), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:31,934 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 48 states, 32 states have (on average 1.15625) internal successors, (37), 37 states have internal predecessors, (37), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:31,934 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 48 states, 32 states have (on average 1.15625) internal successors, (37), 37 states have internal predecessors, (37), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:31,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:31,935 INFO L93 Difference]: Finished difference Result 51 states and 50 transitions. [2022-02-20 23:50:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 50 transitions. [2022-02-20 23:50:31,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:31,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:31,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 32 states have (on average 1.15625) internal successors, (37), 37 states have internal predecessors, (37), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Second operand 51 states. [2022-02-20 23:50:31,937 INFO L87 Difference]: Start difference. First operand has 48 states, 32 states have (on average 1.15625) internal successors, (37), 37 states have internal predecessors, (37), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Second operand 51 states. [2022-02-20 23:50:31,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:31,938 INFO L93 Difference]: Finished difference Result 51 states and 50 transitions. [2022-02-20 23:50:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 50 transitions. [2022-02-20 23:50:31,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:31,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:31,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:31,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.15625) internal successors, (37), 37 states have internal predecessors, (37), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-02-20 23:50:31,940 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 16 [2022-02-20 23:50:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:31,940 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-02-20 23:50:31,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-02-20 23:50:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:50:31,941 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:31,941 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:31,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:32,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:32,150 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __ldv_list_addErr6REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:32,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:32,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1437110869, now seen corresponding path program 1 times [2022-02-20 23:50:32,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:32,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104453534] [2022-02-20 23:50:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:32,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:32,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:32,152 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:32,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:50:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:32,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:50:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:32,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:32,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {3094#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {3094#true} is VALID [2022-02-20 23:50:32,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {3094#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {3094#true} is VALID [2022-02-20 23:50:32,275 INFO L272 TraceCheckUtils]: 2: Hoare triple {3094#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {3094#true} is VALID [2022-02-20 23:50:32,275 INFO L290 TraceCheckUtils]: 3: Hoare triple {3094#true} ~size := #in~size; {3094#true} is VALID [2022-02-20 23:50:32,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {3094#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; {3094#true} is VALID [2022-02-20 23:50:32,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {3094#true} assume true; {3094#true} is VALID [2022-02-20 23:50:32,276 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3094#true} {3094#true} #58#return; {3094#true} is VALID [2022-02-20 23:50:32,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {3094#true} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {3094#true} is VALID [2022-02-20 23:50:32,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {3094#true} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {3094#true} is VALID [2022-02-20 23:50:32,276 INFO L272 TraceCheckUtils]: 9: Hoare triple {3094#true} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {3094#true} is VALID [2022-02-20 23:50:32,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {3094#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3094#true} is VALID [2022-02-20 23:50:32,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {3094#true} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {3132#(= (_ bv1 1) (select |#valid| ldv_list_add_~head.base))} is VALID [2022-02-20 23:50:32,277 INFO L272 TraceCheckUtils]: 12: Hoare triple {3132#(= (_ bv1 1) (select |#valid| ldv_list_add_~head.base))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {3136#(= (select |#valid| |__ldv_list_add_#in~prev.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:32,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {3136#(= (select |#valid| |__ldv_list_add_#in~prev.base|) (_ bv1 1))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {3140#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:32,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {3140#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {3140#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:32,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {3140#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {3140#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:32,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {3140#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {3140#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:32,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {3140#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} assume !(1bv1 == #valid[~prev.base]); {3095#false} is VALID [2022-02-20 23:50:32,279 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:50:32,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:32,279 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:32,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104453534] [2022-02-20 23:50:32,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104453534] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:32,280 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:32,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:32,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883752184] [2022-02-20 23:50:32,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:32,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:32,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:32,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:32,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:32,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:32,297 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:32,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:32,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:32,297 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:32,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:32,531 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-02-20 23:50:32,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:32,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:32,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 23:50:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 23:50:32,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-02-20 23:50:32,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:32,570 INFO L225 Difference]: With dead ends: 47 [2022-02-20 23:50:32,570 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 23:50:32,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:32,571 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:32,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:50:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 23:50:32,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 23:50:32,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:32,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:32,574 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:32,574 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:32,575 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-02-20 23:50:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-02-20 23:50:32,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:32,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:32,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Second operand 47 states. [2022-02-20 23:50:32,576 INFO L87 Difference]: Start difference. First operand has 47 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Second operand 47 states. [2022-02-20 23:50:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:32,577 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-02-20 23:50:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-02-20 23:50:32,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:32,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:32,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:32,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-02-20 23:50:32,579 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 18 [2022-02-20 23:50:32,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:32,579 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-02-20 23:50:32,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:32,580 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-02-20 23:50:32,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:50:32,580 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:32,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:32,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:32,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:32,790 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __ldv_list_addErr7REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:32,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:32,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1437110868, now seen corresponding path program 1 times [2022-02-20 23:50:32,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:32,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659112056] [2022-02-20 23:50:32,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:32,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:32,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:32,792 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:32,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:50:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:32,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:50:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:32,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:33,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {3342#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:33,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:33,018 INFO L272 TraceCheckUtils]: 2: Hoare triple {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:33,018 INFO L290 TraceCheckUtils]: 3: Hoare triple {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} ~size := #in~size; {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:33,019 INFO L290 TraceCheckUtils]: 4: Hoare triple {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} 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; {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:33,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} assume true; {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:33,020 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} #58#return; {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:33,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:33,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:33,022 INFO L272 TraceCheckUtils]: 9: Hoare triple {3347#(= |~#global_list_13~0.offset| (_ bv0 32))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {3375#(= (_ bv0 32) |ldv_list_add_#in~head.offset|)} is VALID [2022-02-20 23:50:33,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {3375#(= (_ bv0 32) |ldv_list_add_#in~head.offset|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3379#(= ldv_list_add_~head.offset (_ bv0 32))} is VALID [2022-02-20 23:50:33,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {3379#(= ldv_list_add_~head.offset (_ bv0 32))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {3383#(and (= ldv_list_add_~head.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) ldv_list_add_~head.offset) (select |#length| ldv_list_add_~head.base)))} is VALID [2022-02-20 23:50:33,024 INFO L272 TraceCheckUtils]: 12: Hoare triple {3383#(and (= ldv_list_add_~head.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) ldv_list_add_~head.offset) (select |#length| ldv_list_add_~head.base)))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {3387#(and (= |__ldv_list_add_#in~prev.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |__ldv_list_add_#in~prev.offset|) (select |#length| |__ldv_list_add_#in~prev.base|)))} is VALID [2022-02-20 23:50:33,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {3387#(and (= |__ldv_list_add_#in~prev.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |__ldv_list_add_#in~prev.offset|) (select |#length| |__ldv_list_add_#in~prev.base|)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {3391#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} is VALID [2022-02-20 23:50:33,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {3391#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {3391#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} is VALID [2022-02-20 23:50:33,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {3391#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {3391#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} is VALID [2022-02-20 23:50:33,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {3391#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {3391#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} is VALID [2022-02-20 23:50:33,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {3391#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} assume !((~bvule32(~bvadd32(4bv32, ~prev.offset), #length[~prev.base]) && ~bvule32(~prev.offset, ~bvadd32(4bv32, ~prev.offset))) && ~bvule32(0bv32, ~prev.offset)); {3343#false} is VALID [2022-02-20 23:50:33,027 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:50:33,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:33,027 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:33,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659112056] [2022-02-20 23:50:33,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659112056] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:33,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:33,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:33,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420917149] [2022-02-20 23:50:33,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:33,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:33,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:33,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:33,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:33,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:33,050 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:33,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:33,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:50:33,050 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:33,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:33,441 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-02-20 23:50:33,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:33,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:33,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-02-20 23:50:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-02-20 23:50:33,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-02-20 23:50:33,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:33,482 INFO L225 Difference]: With dead ends: 46 [2022-02-20 23:50:33,482 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 23:50:33,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:50:33,482 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:33,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 114 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:50:33,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 23:50:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 23:50:33,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:33,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 32 states have (on average 1.09375) internal successors, (35), 35 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:33,485 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 32 states have (on average 1.09375) internal successors, (35), 35 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:33,485 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 32 states have (on average 1.09375) internal successors, (35), 35 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:33,491 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-02-20 23:50:33,492 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-02-20 23:50:33,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:33,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:33,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 32 states have (on average 1.09375) internal successors, (35), 35 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Second operand 46 states. [2022-02-20 23:50:33,492 INFO L87 Difference]: Start difference. First operand has 46 states, 32 states have (on average 1.09375) internal successors, (35), 35 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Second operand 46 states. [2022-02-20 23:50:33,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:33,493 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-02-20 23:50:33,493 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-02-20 23:50:33,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:33,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:33,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:33,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.09375) internal successors, (35), 35 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-02-20 23:50:33,494 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 18 [2022-02-20 23:50:33,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:33,494 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-02-20 23:50:33,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:33,495 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-02-20 23:50:33,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:50:33,495 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:33,495 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:33,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-02-20 23:50:33,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:33,704 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:33,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:33,705 INFO L85 PathProgramCache]: Analyzing trace with hash -245688502, now seen corresponding path program 1 times [2022-02-20 23:50:33,705 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:33,705 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734070692] [2022-02-20 23:50:33,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:33,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:33,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:33,706 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:33,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:50:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:33,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:50:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:33,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:33,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {3597#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {3597#true} is VALID [2022-02-20 23:50:33,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {3597#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:33,807 INFO L272 TraceCheckUtils]: 2: Hoare triple {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {3609#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:33,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {3609#(= |old(#valid)| |#valid|)} ~size := #in~size; {3609#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:33,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {3609#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {3609#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:33,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {3609#(= |old(#valid)| |#valid|)} assume true; {3609#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:33,809 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3609#(= |old(#valid)| |#valid|)} {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #58#return; {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:33,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:33,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32); {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:33,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_alloc_13 } true; {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:33,810 INFO L272 TraceCheckUtils]: 10: Hoare triple {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call LDV_INIT_LIST_HEAD(~#global_list_13~0.base, ~#global_list_13~0.offset); {3597#true} is VALID [2022-02-20 23:50:33,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {3597#true} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {3597#true} is VALID [2022-02-20 23:50:33,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {3597#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {3597#true} is VALID [2022-02-20 23:50:33,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {3597#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {3597#true} is VALID [2022-02-20 23:50:33,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {3597#true} assume true; {3597#true} is VALID [2022-02-20 23:50:33,811 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3597#true} {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #62#return; {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:33,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_entry_point } true; {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:33,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {3605#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {3598#false} is VALID [2022-02-20 23:50:33,812 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:50:33,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:33,813 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:33,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734070692] [2022-02-20 23:50:33,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734070692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:33,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:33,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:50:33,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125753523] [2022-02-20 23:50:33,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:33,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 23:50:33,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:33,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:33,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:33,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:50:33,828 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:33,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:50:33,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:50:33,829 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:34,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:34,005 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2022-02-20 23:50:34,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:50:34,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 23:50:34,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-02-20 23:50:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-02-20 23:50:34,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-02-20 23:50:34,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:34,059 INFO L225 Difference]: With dead ends: 48 [2022-02-20 23:50:34,059 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 23:50:34,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:50:34,060 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:34,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 46 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:50:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 23:50:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-02-20 23:50:34,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:34,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:34,062 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:34,063 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:34,064 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2022-02-20 23:50:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2022-02-20 23:50:34,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:34,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:34,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-02-20 23:50:34,064 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-02-20 23:50:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:34,065 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2022-02-20 23:50:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2022-02-20 23:50:34,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:34,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:34,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:34,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 34 transitions. [2022-02-20 23:50:34,067 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 34 transitions. Word has length 18 [2022-02-20 23:50:34,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:34,067 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 34 transitions. [2022-02-20 23:50:34,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:34,067 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2022-02-20 23:50:34,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:50:34,068 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:34,068 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:34,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:34,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:34,275 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:34,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:34,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1690332874, now seen corresponding path program 1 times [2022-02-20 23:50:34,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:34,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124979005] [2022-02-20 23:50:34,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:34,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:34,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:34,277 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:34,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:50:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:34,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:50:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:34,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:34,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {3807#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,589 INFO L272 TraceCheckUtils]: 2: Hoare triple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} ~size := #in~size; {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} 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; {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} assume true; {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,594 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} #58#return; {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,596 INFO L272 TraceCheckUtils]: 9: Hoare triple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3843#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:34,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {3843#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= |~#global_list_13~0.offset| (_ bv0 32)))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {3847#(and (bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:34,628 INFO L272 TraceCheckUtils]: 12: Hoare triple {3847#(and (bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} assume true; {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,633 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} {3847#(and (bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} #56#return; {3847#(and (bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:34,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {3847#(and (bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} havoc #t~mem14.base, #t~mem14.offset; {3847#(and (bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:34,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {3847#(and (bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume true; {3847#(and (bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:34,635 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3847#(and (bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} {3812#(= |~#global_list_13~0.offset| (_ bv0 32))} #60#return; {3881#(and (bvule (bvadd (_ bv4 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:34,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {3881#(and (bvule (bvadd (_ bv4 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume { :end_inline_alloc_13 } true; {3881#(and (bvule (bvadd (_ bv4 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:34,636 INFO L272 TraceCheckUtils]: 24: Hoare triple {3881#(and (bvule (bvadd (_ bv4 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} call LDV_INIT_LIST_HEAD(~#global_list_13~0.base, ~#global_list_13~0.offset); {3888#(and (= (_ bv0 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (bvule (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|)))} is VALID [2022-02-20 23:50:34,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {3888#(and (= (_ bv0 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (bvule (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {3892#(and (bvule (_ bv4 32) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.offset (_ bv0 32)))} is VALID [2022-02-20 23:50:34,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {3892#(and (bvule (_ bv4 32) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.offset (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~list.offset), #length[~list.base]) && ~bvule32(~list.offset, ~bvadd32(4bv32, ~list.offset))) && ~bvule32(0bv32, ~list.offset)); {3808#false} is VALID [2022-02-20 23:50:34,637 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:50:34,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:34,637 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:34,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124979005] [2022-02-20 23:50:34,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124979005] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:34,638 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:34,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:34,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732225282] [2022-02-20 23:50:34,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:34,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-02-20 23:50:34,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:34,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:34,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:34,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:34,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:34,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:34,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:50:34,692 INFO L87 Difference]: Start difference. First operand 35 states and 34 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:35,178 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2022-02-20 23:50:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:35,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-02-20 23:50:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-02-20 23:50:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-02-20 23:50:35,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 34 transitions. [2022-02-20 23:50:35,247 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:50:35,248 INFO L225 Difference]: With dead ends: 34 [2022-02-20 23:50:35,248 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 23:50:35,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:50:35,248 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 32 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:35,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 85 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:50:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 23:50:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 23:50:35,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:35,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:35,250 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:35,250 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:35,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:35,251 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2022-02-20 23:50:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2022-02-20 23:50:35,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:35,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:35,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-02-20 23:50:35,252 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-02-20 23:50:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:35,253 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2022-02-20 23:50:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2022-02-20 23:50:35,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:35,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:35,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:35,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 33 transitions. [2022-02-20 23:50:35,254 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 33 transitions. Word has length 27 [2022-02-20 23:50:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:35,255 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 33 transitions. [2022-02-20 23:50:35,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2022-02-20 23:50:35,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:50:35,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:35,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:35,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:35,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:35,465 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:35,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:35,465 INFO L85 PathProgramCache]: Analyzing trace with hash -860711565, now seen corresponding path program 1 times [2022-02-20 23:50:35,466 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:35,466 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117949841] [2022-02-20 23:50:35,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:35,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:35,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:35,468 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:35,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 23:50:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:35,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 23:50:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:35,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:35,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-02-20 23:50:35,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-02-20 23:50:35,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-02-20 23:50:35,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-02-20 23:50:36,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {4037#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:36,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:36,112 INFO L272 TraceCheckUtils]: 2: Hoare triple {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:36,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} ~size := #in~size; {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:36,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} 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; {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:36,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume true; {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:36,114 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} #58#return; {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:36,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:36,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:36,120 INFO L272 TraceCheckUtils]: 9: Hoare triple {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {4070#(and (= |~#global_list_13~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:50:36,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {4070#(and (= |~#global_list_13~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {4074#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:50:36,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {4074#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {4078#(and (= |ldv_list_add_#t~mem14.base| (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |ldv_list_add_#t~mem14.offset| (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))} is VALID [2022-02-20 23:50:36,123 INFO L272 TraceCheckUtils]: 12: Hoare triple {4078#(and (= |ldv_list_add_#t~mem14.base| (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |ldv_list_add_#t~mem14.offset| (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {4082#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:36,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {4082#(= |~#global_list_13~0.offset| (_ bv0 32))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {4086#(and (= __ldv_list_add_~next.offset |__ldv_list_add_#in~next.offset|) (= |__ldv_list_add_#in~next.base| __ldv_list_add_~next.base) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {4086#(and (= __ldv_list_add_~next.offset |__ldv_list_add_#in~next.offset|) (= |__ldv_list_add_#in~next.base| __ldv_list_add_~next.base) (= |~#global_list_13~0.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {4090#(and (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {4090#(and (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {4090#(and (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {4090#(and (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {4090#(and (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {4090#(and (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {4090#(and (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {4090#(and (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume true; {4090#(and (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,150 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4090#(and (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)))} {4078#(and (= |ldv_list_add_#t~mem14.base| (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |ldv_list_add_#t~mem14.offset| (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))} #56#return; {4106#(and (bvule (bvadd (_ bv8 32) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {4106#(and (bvule (bvadd (_ bv8 32) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (= |~#global_list_13~0.offset| (_ bv0 32)))} havoc #t~mem14.base, #t~mem14.offset; {4106#(and (bvule (bvadd (_ bv8 32) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {4106#(and (bvule (bvadd (_ bv8 32) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume true; {4106#(and (bvule (bvadd (_ bv8 32) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,156 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4106#(and (bvule (bvadd (_ bv8 32) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (= |~#global_list_13~0.offset| (_ bv0 32)))} {4042#(and (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} #60#return; {4116#(and (= |~#global_list_13~0.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)))} is VALID [2022-02-20 23:50:36,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {4116#(and (= |~#global_list_13~0.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)))} assume { :end_inline_alloc_13 } true; {4116#(and (= |~#global_list_13~0.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)))} is VALID [2022-02-20 23:50:36,157 INFO L272 TraceCheckUtils]: 24: Hoare triple {4116#(and (= |~#global_list_13~0.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)))} call LDV_INIT_LIST_HEAD(~#global_list_13~0.base, ~#global_list_13~0.offset); {4123#(and (= (_ bv0 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (bvule (bvadd (_ bv8 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|)))} is VALID [2022-02-20 23:50:36,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {4123#(and (= (_ bv0 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (bvule (bvadd (_ bv8 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {4127#(and (bvule (_ bv8 32) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.offset (_ bv0 32)))} is VALID [2022-02-20 23:50:36,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {4127#(and (bvule (_ bv8 32) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.offset (_ bv0 32)))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {4127#(and (bvule (_ bv8 32) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.offset (_ bv0 32)))} is VALID [2022-02-20 23:50:36,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {4127#(and (bvule (_ bv8 32) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.offset (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, ~list.offset)), #length[~list.base]) && ~bvule32(~bvadd32(4bv32, ~list.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, ~list.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, ~list.offset))); {4038#false} is VALID [2022-02-20 23:50:36,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:50:36,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:36,160 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:36,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117949841] [2022-02-20 23:50:36,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117949841] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:36,160 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:36,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:50:36,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639858399] [2022-02-20 23:50:36,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:36,160 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-02-20 23:50:36,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:36,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:36,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:36,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:50:36,229 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:36,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:50:36,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:50:36,230 INFO L87 Difference]: Start difference. First operand 34 states and 33 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:37,493 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2022-02-20 23:50:37,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:50:37,493 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-02-20 23:50:37,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 33 transitions. [2022-02-20 23:50:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 33 transitions. [2022-02-20 23:50:37,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 33 transitions. [2022-02-20 23:50:37,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:37,557 INFO L225 Difference]: With dead ends: 33 [2022-02-20 23:50:37,557 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 23:50:37,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:50:37,557 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:37,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 119 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:50:37,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 23:50:37,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 23:50:37,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:37,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.0) internal successors, (24), 24 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:37,560 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.0) internal successors, (24), 24 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:37,560 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.0) internal successors, (24), 24 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:37,561 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2022-02-20 23:50:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2022-02-20 23:50:37,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:37,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:37,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 24 states have (on average 1.0) internal successors, (24), 24 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-02-20 23:50:37,561 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.0) internal successors, (24), 24 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-02-20 23:50:37,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:37,562 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2022-02-20 23:50:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2022-02-20 23:50:37,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:37,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:37,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:37,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:37,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.0) internal successors, (24), 24 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2022-02-20 23:50:37,564 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 28 [2022-02-20 23:50:37,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:37,564 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2022-02-20 23:50:37,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2022-02-20 23:50:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:50:37,565 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:37,565 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:37,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:37,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:37,775 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:50:37,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:37,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1571524617, now seen corresponding path program 1 times [2022-02-20 23:50:37,775 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:37,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502285516] [2022-02-20 23:50:37,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:37,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:37,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:37,777 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:37,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-02-20 23:50:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:50:37,893 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:50:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:50:37,978 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 23:50:37,979 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:50:37,980 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2022-02-20 23:50:37,981 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_addErr0REQUIRES_VIOLATION (13 of 15 remaining) [2022-02-20 23:50:37,981 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_addErr1REQUIRES_VIOLATION (12 of 15 remaining) [2022-02-20 23:50:37,981 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (11 of 15 remaining) [2022-02-20 23:50:37,981 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION (10 of 15 remaining) [2022-02-20 23:50:37,981 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION (9 of 15 remaining) [2022-02-20 23:50:37,981 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION (8 of 15 remaining) [2022-02-20 23:50:37,982 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr0REQUIRES_VIOLATION (7 of 15 remaining) [2022-02-20 23:50:37,982 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr1REQUIRES_VIOLATION (6 of 15 remaining) [2022-02-20 23:50:37,982 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr2REQUIRES_VIOLATION (5 of 15 remaining) [2022-02-20 23:50:37,982 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr3REQUIRES_VIOLATION (4 of 15 remaining) [2022-02-20 23:50:37,982 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr4REQUIRES_VIOLATION (3 of 15 remaining) [2022-02-20 23:50:37,982 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr5REQUIRES_VIOLATION (2 of 15 remaining) [2022-02-20 23:50:37,982 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr6REQUIRES_VIOLATION (1 of 15 remaining) [2022-02-20 23:50:37,982 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr7REQUIRES_VIOLATION (0 of 15 remaining) [2022-02-20 23:50:38,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:38,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:38,185 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:38,187 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:50:38,217 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret38 := ldv_malloc(12bv32); [2022-02-20 23:50:38,218 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.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) 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:50:38,221 INFO L158 Benchmark]: Toolchain (without parser) took 35207.16ms. Allocated memory was 56.6MB in the beginning and 92.3MB in the end (delta: 35.7MB). Free memory was 33.3MB in the beginning and 49.9MB in the end (delta: -16.7MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-02-20 23:50:38,221 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 56.6MB. Free memory is still 38.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:50:38,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 738.58ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 33.1MB in the beginning and 50.8MB in the end (delta: -17.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 23:50:38,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.16ms. Allocated memory is still 75.5MB. Free memory was 50.8MB in the beginning and 48.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:50:38,222 INFO L158 Benchmark]: Boogie Preprocessor took 26.31ms. Allocated memory is still 75.5MB. Free memory was 48.6MB in the beginning and 46.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:50:38,222 INFO L158 Benchmark]: RCFGBuilder took 491.36ms. Allocated memory is still 75.5MB. Free memory was 46.6MB in the beginning and 52.7MB in the end (delta: -6.0MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2022-02-20 23:50:38,222 INFO L158 Benchmark]: TraceAbstraction took 33889.03ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 51.9MB in the beginning and 49.9MB in the end (delta: 2.0MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2022-02-20 23:50:38,223 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.20ms. Allocated memory is still 56.6MB. Free memory is still 38.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 738.58ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 33.1MB in the beginning and 50.8MB in the end (delta: -17.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.16ms. Allocated memory is still 75.5MB. Free memory was 50.8MB in the beginning and 48.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.31ms. Allocated memory is still 75.5MB. Free memory was 48.6MB in the beginning and 46.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 491.36ms. Allocated memory is still 75.5MB. Free memory was 46.6MB in the beginning and 52.7MB in the end (delta: -6.0MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * TraceAbstraction took 33889.03ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 51.9MB in the beginning and 49.9MB in the end (delta: 2.0MB). Peak memory consumption was 18.3MB. 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:50:38,260 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