./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety-realloc/array-realloc-3.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/array-memsafety-realloc/array-realloc-3.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 165c3d31baf6e9e6eb3241886fc1e2aed511e6788979a2e699609d2c8b9e748b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:43:02,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:43:02,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:43:03,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:43:03,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:43:03,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:43:03,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:43:03,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:43:03,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:43:03,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:43:03,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:43:03,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:43:03,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:43:03,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:43:03,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:43:03,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:43:03,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:43:03,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:43:03,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:43:03,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:43:03,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:43:03,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:43:03,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:43:03,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:43:03,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:43:03,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:43:03,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:43:03,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:43:03,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:43:03,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:43:03,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:43:03,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:43:03,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:43:03,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:43:03,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:43:03,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:43:03,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:43:03,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:43:03,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:43:03,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:43:03,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:43:03,047 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:43:03,073 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:43:03,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:43:03,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:43:03,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:43:03,075 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:43:03,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:43:03,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:43:03,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:43:03,076 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:43:03,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:43:03,077 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:43:03,077 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:43:03,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:43:03,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:43:03,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:43:03,078 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:43:03,078 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:43:03,078 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:43:03,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:43:03,078 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:43:03,078 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:43:03,078 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:43:03,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:43:03,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:43:03,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:43:03,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:03,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:43:03,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:43:03,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:43:03,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:43:03,081 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 -> 165c3d31baf6e9e6eb3241886fc1e2aed511e6788979a2e699609d2c8b9e748b [2022-02-20 23:43:03,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:43:03,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:43:03,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:43:03,311 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:43:03,311 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:43:03,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety-realloc/array-realloc-3.i [2022-02-20 23:43:03,368 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c15f48ce/97d41df86cc84c308161165a0019b920/FLAG31fe04328 [2022-02-20 23:43:03,778 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:43:03,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety-realloc/array-realloc-3.i [2022-02-20 23:43:03,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c15f48ce/97d41df86cc84c308161165a0019b920/FLAG31fe04328 [2022-02-20 23:43:03,804 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c15f48ce/97d41df86cc84c308161165a0019b920 [2022-02-20 23:43:03,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:43:03,807 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:43:03,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:03,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:43:03,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:43:03,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:03" (1/1) ... [2022-02-20 23:43:03,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de22abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:03, skipping insertion in model container [2022-02-20 23:43:03,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:03" (1/1) ... [2022-02-20 23:43:03,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:43:03,852 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:43:04,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:04,053 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:43:04,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@61cbc14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:04, skipping insertion in model container [2022-02-20 23:43:04,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:04,054 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:43:04,055 INFO L158 Benchmark]: Toolchain (without parser) took 247.88ms. Allocated memory is still 104.9MB. Free memory was 73.7MB in the beginning and 76.8MB in the end (delta: -3.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:43:04,056 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 60.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:43:04,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.46ms. Allocated memory is still 104.9MB. Free memory was 73.7MB in the beginning and 76.8MB in the end (delta: -3.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:43:04,057 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 104.9MB. Free memory is still 60.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.46ms. Allocated memory is still 104.9MB. Free memory was 73.7MB in the beginning and 76.8MB in the end (delta: -3.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 515]: 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/array-memsafety-realloc/array-realloc-3.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 165c3d31baf6e9e6eb3241886fc1e2aed511e6788979a2e699609d2c8b9e748b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:43:05,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:43:05,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:43:05,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:43:05,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:43:05,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:43:05,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:43:05,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:43:05,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:43:05,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:43:05,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:43:05,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:43:05,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:43:05,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:43:05,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:43:05,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:43:05,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:43:05,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:43:05,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:43:05,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:43:05,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:43:05,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:43:05,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:43:05,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:43:05,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:43:05,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:43:05,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:43:05,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:43:05,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:43:05,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:43:05,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:43:05,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:43:05,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:43:05,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:43:05,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:43:05,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:43:05,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:43:05,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:43:05,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:43:05,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:43:05,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:43:05,583 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:43:05,602 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:43:05,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:43:05,603 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:43:05,603 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:43:05,604 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:43:05,604 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:43:05,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:43:05,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:43:05,605 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:43:05,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:43:05,606 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:43:05,606 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:43:05,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:43:05,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:43:05,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:43:05,607 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:43:05,607 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:43:05,607 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:43:05,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:43:05,607 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:43:05,608 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:43:05,608 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:43:05,608 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:43:05,608 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:43:05,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:43:05,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:43:05,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:43:05,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:05,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:43:05,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:43:05,609 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:43:05,609 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:43:05,610 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:43:05,610 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 -> 165c3d31baf6e9e6eb3241886fc1e2aed511e6788979a2e699609d2c8b9e748b [2022-02-20 23:43:05,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:43:05,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:43:05,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:43:05,875 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:43:05,875 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:43:05,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety-realloc/array-realloc-3.i [2022-02-20 23:43:05,924 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e377792/a0f5dceccad448cabbcd7af3400b07cb/FLAG422034e0f [2022-02-20 23:43:06,294 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:43:06,294 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety-realloc/array-realloc-3.i [2022-02-20 23:43:06,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e377792/a0f5dceccad448cabbcd7af3400b07cb/FLAG422034e0f [2022-02-20 23:43:06,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e377792/a0f5dceccad448cabbcd7af3400b07cb [2022-02-20 23:43:06,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:43:06,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:43:06,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:06,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:43:06,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:43:06,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:06" (1/1) ... [2022-02-20 23:43:06,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b6bf04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:06, skipping insertion in model container [2022-02-20 23:43:06,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:06" (1/1) ... [2022-02-20 23:43:06,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:43:06,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:43:07,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:07,012 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:43:07,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:43:07,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:07,057 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:43:07,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:07,121 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:43:07,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:07 WrapperNode [2022-02-20 23:43:07,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:07,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:07,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:43:07,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:43:07,127 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:43:07" (1/1) ... [2022-02-20 23:43:07,155 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:43:07" (1/1) ... [2022-02-20 23:43:07,176 INFO L137 Inliner]: procedures = 118, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 49 [2022-02-20 23:43:07,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:07,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:43:07,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:43:07,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:43:07,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:07" (1/1) ... [2022-02-20 23:43:07,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:07" (1/1) ... [2022-02-20 23:43:07,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:07" (1/1) ... [2022-02-20 23:43:07,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:07" (1/1) ... [2022-02-20 23:43:07,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:07" (1/1) ... [2022-02-20 23:43:07,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:07" (1/1) ... [2022-02-20 23:43:07,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:07" (1/1) ... [2022-02-20 23:43:07,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:43:07,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:43:07,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:43:07,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:43:07,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:07" (1/1) ... [2022-02-20 23:43:07,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:07,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:07,236 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:43:07,247 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:43:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:43:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:43:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:43:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:43:07,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:43:07,362 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:43:07,363 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:43:07,497 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:43:07,501 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:43:07,501 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 23:43:07,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:07 BoogieIcfgContainer [2022-02-20 23:43:07,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:43:07,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:43:07,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:43:07,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:43:07,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:43:06" (1/3) ... [2022-02-20 23:43:07,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eac480a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:07, skipping insertion in model container [2022-02-20 23:43:07,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:07" (2/3) ... [2022-02-20 23:43:07,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eac480a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:07, skipping insertion in model container [2022-02-20 23:43:07,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:07" (3/3) ... [2022-02-20 23:43:07,508 INFO L111 eAbstractionObserver]: Analyzing ICFG array-realloc-3.i [2022-02-20 23:43:07,511 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:43:07,513 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-02-20 23:43:07,540 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:43:07,545 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:43:07,545 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 23:43:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:43:07,558 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:07,559 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:43:07,559 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:43:07,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:07,563 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-02-20 23:43:07,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:43:07,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999433707] [2022-02-20 23:43:07,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:07,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:43:07,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:43:07,575 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:43:07,576 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:43:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:07,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:43:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:07,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:07,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {20#true} is VALID [2022-02-20 23:43:07,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {28#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:43:07,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));main_#res#1 := 0bv32; {28#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:43:07,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {21#false} is VALID [2022-02-20 23:43:07,665 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:43:07,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:43:07,666 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:43:07,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999433707] [2022-02-20 23:43:07,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999433707] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:07,667 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:07,667 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:07,668 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990207583] [2022-02-20 23:43:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:07,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:43:07,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:07,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:07,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:07,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:43:07,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:07,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:07,695 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,772 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 23:43:07,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:07,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:43:07,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:07,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-20 23:43:07,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-20 23:43:07,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-02-20 23:43:07,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:07,807 INFO L225 Difference]: With dead ends: 18 [2022-02-20 23:43:07,807 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 23:43:07,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:07,811 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:07,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 27 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 23:43:07,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 23:43:07,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:07,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,829 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,829 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,830 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 23:43:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 23:43:07,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:07,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:07,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-20 23:43:07,831 INFO L87 Difference]: Start difference. First operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-20 23:43:07,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,833 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 23:43:07,833 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 23:43:07,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:07,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:07,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:07,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 23:43:07,835 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 4 [2022-02-20 23:43:07,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:07,836 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 23:43:07,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 23:43:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:43:07,837 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:07,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:43:07,855 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:43:08,043 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:43:08,044 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:43:08,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:08,046 INFO L85 PathProgramCache]: Analyzing trace with hash 28695810, now seen corresponding path program 1 times [2022-02-20 23:43:08,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:43:08,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697569768] [2022-02-20 23:43:08,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:08,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:43:08,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:43:08,049 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:43:08,051 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:43:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:08,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:43:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:08,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:08,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {97#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {97#true} is VALID [2022-02-20 23:43:08,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {97#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {97#true} is VALID [2022-02-20 23:43:08,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {97#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {108#(not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:43:08,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {108#(not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32)))} assume main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32;main_#res#1 := 0bv32; {98#false} is VALID [2022-02-20 23:43:08,112 INFO L290 TraceCheckUtils]: 4: Hoare triple {98#false} assume !(#valid == main_old_#valid#1); {98#false} is VALID [2022-02-20 23:43:08,112 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:43:08,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:43:08,112 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:43:08,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697569768] [2022-02-20 23:43:08,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697569768] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:08,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:08,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:43:08,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312355021] [2022-02-20 23:43:08,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:08,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:43:08,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:08,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:08,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:08,120 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:43:08,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:08,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:08,120 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:08,151 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-20 23:43:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:08,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:43:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-20 23:43:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-20 23:43:08,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2022-02-20 23:43:08,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:08,177 INFO L225 Difference]: With dead ends: 15 [2022-02-20 23:43:08,177 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 23:43:08,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:08,178 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:08,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 23:43:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 23:43:08,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:08,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,181 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,181 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:08,182 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-20 23:43:08,182 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 23:43:08,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:08,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:08,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-20 23:43:08,183 INFO L87 Difference]: Start difference. First operand has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-20 23:43:08,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:08,184 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-20 23:43:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 23:43:08,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:08,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:08,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:08,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-02-20 23:43:08,185 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 5 [2022-02-20 23:43:08,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:08,185 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-02-20 23:43:08,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,185 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 23:43:08,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:43:08,186 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:08,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:08,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:43:08,407 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:43:08,408 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:43:08,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:08,408 INFO L85 PathProgramCache]: Analyzing trace with hash 179641051, now seen corresponding path program 1 times [2022-02-20 23:43:08,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:43:08,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927011486] [2022-02-20 23:43:08,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:08,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:43:08,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:43:08,410 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:43:08,412 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:43:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:08,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:43:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:08,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:08,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {174#true} is VALID [2022-02-20 23:43:08,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {174#true} is VALID [2022-02-20 23:43:08,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {174#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {185#(and (bvsgt ~num~0 (_ bv0 32)) (bvslt ~num~0 (_ bv100 32)))} is VALID [2022-02-20 23:43:08,548 INFO L290 TraceCheckUtils]: 3: Hoare triple {185#(and (bvsgt ~num~0 (_ bv0 32)) (bvslt ~num~0 (_ bv100 32)))} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset; {189#(and (bvsgt ~num~0 (_ bv0 32)) (bvslt ~num~0 (_ bv100 32)) (= ~newsize~0 (_ bv0 32)))} is VALID [2022-02-20 23:43:08,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {189#(and (bvsgt ~num~0 (_ bv0 32)) (bvslt ~num~0 (_ bv100 32)) (= ~newsize~0 (_ bv0 32)))} assume !~bvslt32(~newsize~0, ~num~0); {175#false} is VALID [2022-02-20 23:43:08,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#false} expandArray_#res#1.base, expandArray_#res#1.offset := 0bv32, 0bv32; {175#false} is VALID [2022-02-20 23:43:08,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#false} main_#t~ret5#1.base, main_#t~ret5#1.offset := expandArray_#res#1.base, expandArray_#res#1.offset;assume { :end_inline_expandArray } true;havoc main_#t~ret5#1.base, main_#t~ret5#1.offset;main_#res#1 := 0bv32; {175#false} is VALID [2022-02-20 23:43:08,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#false} assume !(#valid == main_old_#valid#1); {175#false} is VALID [2022-02-20 23:43:08,549 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:43:08,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:43:08,550 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:43:08,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927011486] [2022-02-20 23:43:08,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927011486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:08,552 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:08,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:43:08,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511630032] [2022-02-20 23:43:08,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:08,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:43:08,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:08,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:08,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:08,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:43:08,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:08,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:08,569 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:08,651 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 23:43:08,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:43:08,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:43:08,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-20 23:43:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-20 23:43:08,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-02-20 23:43:08,674 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:43:08,675 INFO L225 Difference]: With dead ends: 16 [2022-02-20 23:43:08,675 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 23:43:08,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:08,676 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:08,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 23:43:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 23:43:08,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:08,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,677 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,678 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:08,678 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 23:43:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 23:43:08,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:08,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:08,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 23:43:08,679 INFO L87 Difference]: Start difference. First operand has 16 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 23:43:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:08,680 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 23:43:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 23:43:08,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:08,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:08,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:08,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:08,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-02-20 23:43:08,682 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2022-02-20 23:43:08,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:08,682 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-02-20 23:43:08,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 23:43:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:43:08,683 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:08,683 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:08,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:43:08,883 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:43:08,883 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:43:08,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash 179688781, now seen corresponding path program 1 times [2022-02-20 23:43:08,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:43:08,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238132620] [2022-02-20 23:43:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:08,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:43:08,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:43:08,885 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:43:08,886 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:43:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:08,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:43:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:08,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:08,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {265#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {265#true} is VALID [2022-02-20 23:43:08,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {265#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {265#true} is VALID [2022-02-20 23:43:08,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {265#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {276#(not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:43:08,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {276#(not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32)))} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset; {280#(not (= (_ bv0 32) |ULTIMATE.start_expandArray_~a~0#1.base|))} is VALID [2022-02-20 23:43:08,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {280#(not (= (_ bv0 32) |ULTIMATE.start_expandArray_~a~0#1.base|))} assume !!~bvslt32(~newsize~0, ~num~0);~newsize~0 := ~bvadd32(1bv32, ~newsize~0);expandArray_~b~0#1.base, expandArray_~b~0#1.offset := 0bv32, 0bv32;assume { :begin_inline_#Ultimate.C_realloc } true;#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1 := expandArray_~a~0#1.base, expandArray_~a~0#1.offset, ~bvmul32(4bv32, ~newsize~0);havoc #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset; {284#(not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:43:08,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {284#(not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ bv0 32)))} assume #Ultimate.C_realloc_ptr#1.base == 0bv32 && #Ultimate.C_realloc_ptr#1.offset == 0bv32;call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1); {266#false} is VALID [2022-02-20 23:43:08,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#false} expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset := #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset;assume { :end_inline_#Ultimate.C_realloc } true;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset; {266#false} is VALID [2022-02-20 23:43:08,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {266#false} assume !(1bv1 == #valid[expandArray_~b~0#1.base]); {266#false} is VALID [2022-02-20 23:43:08,992 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:43:08,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:43:08,992 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:43:08,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238132620] [2022-02-20 23:43:08,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238132620] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:08,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:08,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:43:08,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919946998] [2022-02-20 23:43:08,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:08,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:43:08,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:08,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:09,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:43:09,001 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:43:09,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:43:09,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:43:09,001 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:09,110 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 23:43:09,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:43:09,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:43:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-02-20 23:43:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-02-20 23:43:09,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-02-20 23:43:09,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:09,147 INFO L225 Difference]: With dead ends: 27 [2022-02-20 23:43:09,147 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 23:43:09,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:43:09,148 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 41 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:09,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 40 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 23:43:09,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2022-02-20 23:43:09,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:09,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 17 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,149 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 17 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,150 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 17 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:09,150 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 23:43:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-20 23:43:09,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:09,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:09,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states. [2022-02-20 23:43:09,151 INFO L87 Difference]: Start difference. First operand has 17 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states. [2022-02-20 23:43:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:09,153 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 23:43:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-20 23:43:09,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:09,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:09,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:09,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-02-20 23:43:09,154 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 8 [2022-02-20 23:43:09,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:09,154 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-02-20 23:43:09,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-20 23:43:09,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:43:09,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:09,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:09,164 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:43:09,361 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:43:09,362 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:43:09,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash 179690703, now seen corresponding path program 1 times [2022-02-20 23:43:09,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:43:09,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943874860] [2022-02-20 23:43:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:09,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:43:09,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:43:09,364 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:43:09,365 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:43:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:09,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:43:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:09,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:09,453 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:43:09,454 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-20 23:43:09,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {397#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {397#true} is VALID [2022-02-20 23:43:09,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {397#true} is VALID [2022-02-20 23:43:09,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {397#true} is VALID [2022-02-20 23:43:09,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {397#true} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset; {397#true} is VALID [2022-02-20 23:43:09,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {397#true} assume !!~bvslt32(~newsize~0, ~num~0);~newsize~0 := ~bvadd32(1bv32, ~newsize~0);expandArray_~b~0#1.base, expandArray_~b~0#1.offset := 0bv32, 0bv32;assume { :begin_inline_#Ultimate.C_realloc } true;#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1 := expandArray_~a~0#1.base, expandArray_~a~0#1.offset, ~bvmul32(4bv32, ~newsize~0);havoc #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset; {397#true} is VALID [2022-02-20 23:43:09,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#true} assume !(#Ultimate.C_realloc_ptr#1.base == 0bv32 && #Ultimate.C_realloc_ptr#1.offset == 0bv32);call ULTIMATE.dealloc(#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset);call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1);#memory_int := ~storeAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_ptr#1.base)); {417#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:43:09,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {417#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|)) (_ bv1 1)) (_ bv0 1))} expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset := #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset;assume { :end_inline_#Ultimate.C_realloc } true;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset; {421#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_expandArray_~b~0#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:43:09,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_expandArray_~b~0#1.base|)) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[expandArray_~b~0#1.base]); {398#false} is VALID [2022-02-20 23:43:09,498 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:43:09,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:43:09,499 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:43:09,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943874860] [2022-02-20 23:43:09,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943874860] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:09,499 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:09,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:43:09,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652308117] [2022-02-20 23:43:09,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:09,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:43:09,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:09,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:09,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:09,509 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:43:09,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:09,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:09,510 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:09,600 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 23:43:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:43:09,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:43:09,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-02-20 23:43:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-02-20 23:43:09,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 17 transitions. [2022-02-20 23:43:09,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:09,626 INFO L225 Difference]: With dead ends: 16 [2022-02-20 23:43:09,626 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 23:43:09,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:43:09,627 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:09,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 12 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 23:43:09,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 23:43:09,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:09,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,630 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,630 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:09,631 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 23:43:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 23:43:09,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:09,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:09,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 23:43:09,632 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 23:43:09,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:09,632 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 23:43:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 23:43:09,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:09,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:09,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:09,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-02-20 23:43:09,633 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2022-02-20 23:43:09,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:09,633 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-02-20 23:43:09,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 23:43:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:43:09,633 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:09,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:09,647 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:43:09,840 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:43:09,840 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:43:09,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:09,840 INFO L85 PathProgramCache]: Analyzing trace with hash 179690704, now seen corresponding path program 1 times [2022-02-20 23:43:09,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:43:09,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83866714] [2022-02-20 23:43:09,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:09,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:43:09,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:43:09,842 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:43:09,843 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:43:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:09,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:43:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:09,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:09,983 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 8 treesize of output 7 [2022-02-20 23:43:10,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {490#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {490#true} is VALID [2022-02-20 23:43:10,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {490#true} is VALID [2022-02-20 23:43:10,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {490#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {490#true} is VALID [2022-02-20 23:43:10,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {490#true} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset; {504#(= ~newsize~0 (_ bv0 32))} is VALID [2022-02-20 23:43:10,025 INFO L290 TraceCheckUtils]: 4: Hoare triple {504#(= ~newsize~0 (_ bv0 32))} assume !!~bvslt32(~newsize~0, ~num~0);~newsize~0 := ~bvadd32(1bv32, ~newsize~0);expandArray_~b~0#1.base, expandArray_~b~0#1.offset := 0bv32, 0bv32;assume { :begin_inline_#Ultimate.C_realloc } true;#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1 := expandArray_~a~0#1.base, expandArray_~a~0#1.offset, ~bvmul32(4bv32, ~newsize~0);havoc #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset; {508#(and (= |ULTIMATE.start_#Ultimate.C_realloc_size#1| (bvmul (_ bv4 32) ~newsize~0)) (= ~newsize~0 (_ bv1 32)))} is VALID [2022-02-20 23:43:10,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {508#(and (= |ULTIMATE.start_#Ultimate.C_realloc_size#1| (bvmul (_ bv4 32) ~newsize~0)) (= ~newsize~0 (_ bv1 32)))} assume !(#Ultimate.C_realloc_ptr#1.base == 0bv32 && #Ultimate.C_realloc_ptr#1.offset == 0bv32);call ULTIMATE.dealloc(#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset);call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1);#memory_int := ~storeAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_ptr#1.base)); {512#(and (= |ULTIMATE.start_#Ultimate.C_realloc_#res#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|) (bvmul (_ bv4 32) ~newsize~0)) (= ~newsize~0 (_ bv1 32)))} is VALID [2022-02-20 23:43:10,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {512#(and (= |ULTIMATE.start_#Ultimate.C_realloc_#res#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|) (bvmul (_ bv4 32) ~newsize~0)) (= ~newsize~0 (_ bv1 32)))} expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset := #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset;assume { :end_inline_#Ultimate.C_realloc } true;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset; {516#(and (= (select |#length| |ULTIMATE.start_expandArray_~b~0#1.base|) (bvmul (_ bv4 32) ~newsize~0)) (= ~newsize~0 (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_expandArray_~b~0#1.offset|))} is VALID [2022-02-20 23:43:10,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {516#(and (= (select |#length| |ULTIMATE.start_expandArray_~b~0#1.base|) (bvmul (_ bv4 32) ~newsize~0)) (= ~newsize~0 (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_expandArray_~b~0#1.offset|))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32)))), #length[expandArray_~b~0#1.base]) && ~bvule32(~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32))), ~bvadd32(4bv32, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32)))))) && ~bvule32(0bv32, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32))))); {491#false} is VALID [2022-02-20 23:43:10,028 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:43:10,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:43:10,028 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:43:10,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83866714] [2022-02-20 23:43:10,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83866714] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:10,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:10,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:43:10,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132883100] [2022-02-20 23:43:10,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:10,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:43:10,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:10,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:10,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:43:10,039 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:43:10,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:43:10,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:43:10,040 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:10,286 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-02-20 23:43:10,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:43:10,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:43:10,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-02-20 23:43:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-02-20 23:43:10,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-02-20 23:43:10,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:10,326 INFO L225 Difference]: With dead ends: 24 [2022-02-20 23:43:10,328 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 23:43:10,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:43:10,329 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:10,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:43:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 23:43:10,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2022-02-20 23:43:10,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:10,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 18 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,331 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 18 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,331 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 18 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:10,332 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-02-20 23:43:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-20 23:43:10,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:10,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:10,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2022-02-20 23:43:10,332 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2022-02-20 23:43:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:10,333 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-02-20 23:43:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-20 23:43:10,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:10,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:10,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:10,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-02-20 23:43:10,334 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 8 [2022-02-20 23:43:10,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:10,334 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-02-20 23:43:10,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 23:43:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:43:10,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:10,335 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:10,347 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:43:10,543 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:43:10,544 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:43:10,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:10,544 INFO L85 PathProgramCache]: Analyzing trace with hash 702944005, now seen corresponding path program 1 times [2022-02-20 23:43:10,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:43:10,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365774317] [2022-02-20 23:43:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:10,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:43:10,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:43:10,545 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:43:10,549 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:43:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:43:10,600 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:43:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:43:10,641 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 23:43:10,641 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:43:10,642 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (2 of 3 remaining) [2022-02-20 23:43:10,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (1 of 3 remaining) [2022-02-20 23:43:10,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (0 of 3 remaining) [2022-02-20 23:43:10,670 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:43:10,843 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:43:10,846 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:10,847 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:43:10,852 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,852 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,853 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,853 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,853 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,853 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,853 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,853 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,853 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,853 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,854 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,854 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,854 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,854 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,854 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,854 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,854 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,855 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,855 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,855 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,855 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,855 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,855 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,855 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,855 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,856 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,856 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,856 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,856 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,856 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,856 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,856 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:10,856 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,857 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:10,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:43:10 BoogieIcfgContainer [2022-02-20 23:43:10,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:43:10,871 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:43:10,871 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:43:10,871 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:43:10,876 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:07" (3/4) ... [2022-02-20 23:43:10,878 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 23:43:10,879 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:43:10,879 INFO L158 Benchmark]: Toolchain (without parser) took 4186.31ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 46.8MB in the beginning and 50.3MB in the end (delta: -3.4MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2022-02-20 23:43:10,880 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 67.1MB. Free memory was 49.0MB in the beginning and 49.0MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:43:10,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.03ms. Allocated memory is still 67.1MB. Free memory was 46.7MB in the beginning and 39.4MB in the end (delta: 7.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 23:43:10,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.97ms. Allocated memory is still 67.1MB. Free memory was 39.4MB in the beginning and 37.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:43:10,880 INFO L158 Benchmark]: Boogie Preprocessor took 34.70ms. Allocated memory is still 67.1MB. Free memory was 37.3MB in the beginning and 35.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:43:10,881 INFO L158 Benchmark]: RCFGBuilder took 290.36ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 35.7MB in the beginning and 56.9MB in the end (delta: -21.2MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-02-20 23:43:10,881 INFO L158 Benchmark]: TraceAbstraction took 3366.41ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 56.2MB in the beginning and 51.0MB in the end (delta: 5.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-02-20 23:43:10,881 INFO L158 Benchmark]: Witness Printer took 8.14ms. Allocated memory is still 98.6MB. Free memory was 51.0MB in the beginning and 50.3MB in the end (delta: 749.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:43:10,882 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.19ms. Allocated memory is still 67.1MB. Free memory was 49.0MB in the beginning and 49.0MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.03ms. Allocated memory is still 67.1MB. Free memory was 46.7MB in the beginning and 39.4MB in the end (delta: 7.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.97ms. Allocated memory is still 67.1MB. Free memory was 39.4MB in the beginning and 37.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.70ms. Allocated memory is still 67.1MB. Free memory was 37.3MB in the beginning and 35.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 290.36ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 35.7MB in the beginning and 56.9MB in the end (delta: -21.2MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3366.41ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 56.2MB in the beginning and 51.0MB in the end (delta: 5.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Witness Printer took 8.14ms. Allocated memory is still 98.6MB. Free memory was 51.0MB in the beginning and 50.3MB in the end (delta: 749.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 525]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 525. Possible FailurePath: [L512] int num; [L513] int ind, newsize, i = 1; VAL [i=1, ind=0, newsize=0, num=0] [L526] num = __VERIFIER_nondet_int() [L527] COND FALSE !(!(num > 0 && num < 100)) [L530] int *a = (int *)malloc(sizeof(int)); [L531] COND FALSE !(a == ((void *)0)) [L534] newsize = 0 [L535] CALL expandArray(a) [L515] int *a = (int *)arg; VAL [a={1:0}, arg={1:0}, arg={1:0}, i=1, ind=0, newsize=0, num=1] [L516] COND TRUE newsize < num [L517] newsize = newsize + 1 [L518] int *b = ((void *)0); [L519] EXPR, FCALL realloc(a, sizeof(int) * newsize) [L519] b = realloc(a, sizeof(int) * newsize) [L520] b[newsize - 1] = i VAL [a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L521] a = b VAL [a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L516] COND FALSE !(newsize < num) VAL [a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L523] return 0; VAL [\result={0:0}, a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L535] RET expandArray(a) [L536] return 0; VAL [\old(argc)=5, \result=0, a={1:0}, argc=5, argv={7:6}, argv={7:6}, i=1, ind=0, newsize=1, num=1] - UnprovableResult [Line: 520]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 520]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 146 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 81 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=6, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 116 SizeOfPredicates, 11 NumberOfNonLiveVariables, 268 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 23:43:10,909 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: UNKNOWN: Overapproximated counterexample