./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:49:49,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:49:49,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:49:49,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:49:49,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:49:49,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:49:49,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:49:49,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:49:49,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:49:49,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:49:49,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:49:49,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:49:49,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:49:49,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:49:49,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:49:49,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:49:49,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:49:49,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:49:49,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:49:49,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:49:49,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:49:49,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:49:49,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:49:49,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:49:49,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:49:49,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:49:49,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:49:49,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:49:49,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:49:49,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:49:49,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:49:49,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:49:49,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:49:49,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:49:49,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:49:49,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:49:49,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:49:49,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:49:49,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:49:49,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:49:49,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:49:49,596 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:49:49,609 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:49:49,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:49:49,610 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:49:49,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:49:49,611 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:49:49,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:49:49,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:49:49,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:49:49,612 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:49:49,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:49:49,612 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:49:49,612 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:49:49,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:49:49,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:49:49,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:49:49,613 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:49:49,613 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:49:49,614 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:49:49,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:49:49,614 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:49:49,614 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:49:49,614 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:49:49,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:49:49,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:49:49,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:49:49,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:49,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:49:49,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:49:49,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:49:49,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:49:49,616 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 -> 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 [2022-02-20 23:49:49,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:49:49,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:49:49,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:49:49,865 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:49:49,867 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:49:49,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2022-02-20 23:49:49,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d209c2518/5102f10a9e684546bb53e329bec1f1a0/FLAGa326f81a0 [2022-02-20 23:49:50,346 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:49:50,359 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2022-02-20 23:49:50,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d209c2518/5102f10a9e684546bb53e329bec1f1a0/FLAGa326f81a0 [2022-02-20 23:49:50,382 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d209c2518/5102f10a9e684546bb53e329bec1f1a0 [2022-02-20 23:49:50,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:49:50,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:49:50,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:50,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:49:50,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:49:50,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:50" (1/1) ... [2022-02-20 23:49:50,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@389ec282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:50, skipping insertion in model container [2022-02-20 23:49:50,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:50" (1/1) ... [2022-02-20 23:49:50,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:49:50,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:50,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:50,801 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-02-20 23:49:50,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2854a822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:50, skipping insertion in model container [2022-02-20 23:49:50,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:50,802 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:49:50,804 INFO L158 Benchmark]: Toolchain (without parser) took 417.87ms. Allocated memory is still 81.8MB. Free memory was 56.9MB in the beginning and 54.5MB in the end (delta: 2.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:49:50,804 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:49:50,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.13ms. Allocated memory is still 81.8MB. Free memory was 56.7MB in the beginning and 54.5MB in the end (delta: 2.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:49:50,806 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.17ms. Allocated memory is still 81.8MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.13ms. Allocated memory is still 81.8MB. Free memory was 56.7MB in the beginning and 54.5MB in the end (delta: 2.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:49:52,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:49:52,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:49:52,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:49:52,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:49:52,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:49:52,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:49:52,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:49:52,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:49:52,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:49:52,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:49:52,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:49:52,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:49:52,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:49:52,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:49:52,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:49:52,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:49:52,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:49:52,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:49:52,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:49:52,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:49:52,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:49:52,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:49:52,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:49:52,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:49:52,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:49:52,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:49:52,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:49:52,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:49:52,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:49:52,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:49:52,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:49:52,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:49:52,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:49:52,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:49:52,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:49:52,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:49:52,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:49:52,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:49:52,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:49:52,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:49:52,375 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:49:52,399 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:49:52,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:49:52,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:49:52,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:49:52,402 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:49:52,402 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:49:52,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:49:52,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:49:52,404 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:49:52,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:49:52,404 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:49:52,405 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:49:52,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:49:52,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:49:52,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:49:52,405 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:49:52,405 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:49:52,405 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:49:52,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:49:52,406 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:49:52,406 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:49:52,406 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:49:52,406 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:49:52,406 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:49:52,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:49:52,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:49:52,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:49:52,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:52,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:49:52,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:49:52,407 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:49:52,408 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:49:52,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:49:52,408 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 -> 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 [2022-02-20 23:49:52,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:49:52,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:49:52,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:49:52,667 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:49:52,668 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:49:52,668 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2022-02-20 23:49:52,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a70a534/b1ee8e9b832e4b6ba91e560f0c215cab/FLAG0e87121b8 [2022-02-20 23:49:53,143 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:49:53,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2022-02-20 23:49:53,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a70a534/b1ee8e9b832e4b6ba91e560f0c215cab/FLAG0e87121b8 [2022-02-20 23:49:53,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a70a534/b1ee8e9b832e4b6ba91e560f0c215cab [2022-02-20 23:49:53,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:49:53,169 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:49:53,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:53,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:49:53,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:49:53,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:53" (1/1) ... [2022-02-20 23:49:53,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a97725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:53, skipping insertion in model container [2022-02-20 23:49:53,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:53" (1/1) ... [2022-02-20 23:49:53,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:49:53,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:53,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:53,538 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:49:53,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:53,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:53,623 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:49:53,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:53,723 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:49:53,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:53 WrapperNode [2022-02-20 23:49:53,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:53,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:49:53,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:49:53,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:49:53,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:53" (1/1) ... [2022-02-20 23:49:53,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:53" (1/1) ... [2022-02-20 23:49:53,782 INFO L137 Inliner]: procedures = 169, calls = 87, calls flagged for inlining = 26, calls inlined = 8, statements flattened = 92 [2022-02-20 23:49:53,783 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:49:53,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:49:53,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:49:53,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:49:53,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:53" (1/1) ... [2022-02-20 23:49:53,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:53" (1/1) ... [2022-02-20 23:49:53,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:53" (1/1) ... [2022-02-20 23:49:53,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:53" (1/1) ... [2022-02-20 23:49:53,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:53" (1/1) ... [2022-02-20 23:49:53,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:53" (1/1) ... [2022-02-20 23:49:53,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:53" (1/1) ... [2022-02-20 23:49:53,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:49:53,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:49:53,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:49:53,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:49:53,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:53" (1/1) ... [2022-02-20 23:49:53,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:53,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:53,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:49:53,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:49:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:49:53,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:49:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2022-02-20 23:49:53,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2022-02-20 23:49:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:49:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:49:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:49:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:49:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:49:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:49:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:49:53,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:49:53,976 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:49:53,977 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:49:54,261 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:49:54,268 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:49:54,268 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:49:54,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:54 BoogieIcfgContainer [2022-02-20 23:49:54,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:49:54,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:49:54,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:49:54,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:49:54,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:49:53" (1/3) ... [2022-02-20 23:49:54,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4442ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:49:54, skipping insertion in model container [2022-02-20 23:49:54,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:53" (2/3) ... [2022-02-20 23:49:54,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4442ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:49:54, skipping insertion in model container [2022-02-20 23:49:54,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:54" (3/3) ... [2022-02-20 23:49:54,276 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test11_2.i [2022-02-20 23:49:54,279 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:49:54,280 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-02-20 23:49:54,313 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:49:54,320 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:49:54,321 INFO L340 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-02-20 23:49:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:49:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:49:54,342 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:54,343 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:54,344 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:49:54,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:54,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1738627509, now seen corresponding path program 1 times [2022-02-20 23:49:54,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:54,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267971728] [2022-02-20 23:49:54,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:54,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:54,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:54,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:49:54,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:49:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:54,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:49:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:54,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:54,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {88#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {88#true} is VALID [2022-02-20 23:49:54,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {88#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {88#true} is VALID [2022-02-20 23:49:54,538 INFO L272 TraceCheckUtils]: 2: Hoare triple {88#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {88#true} is VALID [2022-02-20 23:49:54,538 INFO L290 TraceCheckUtils]: 3: Hoare triple {88#true} ~size := #in~size; {88#true} is VALID [2022-02-20 23:49:54,539 INFO L290 TraceCheckUtils]: 4: Hoare triple {88#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {105#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:54,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {105#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {105#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:54,543 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {105#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {88#true} #118#return; {112#(not (= |ULTIMATE.start_entry_point_#t~ret43#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:54,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {112#(not (= |ULTIMATE.start_entry_point_#t~ret43#1.base| (_ bv0 32)))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {116#(not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:54,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {116#(not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32)))} assume entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32; {89#false} is VALID [2022-02-20 23:49:54,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {89#false} assume { :end_inline_entry_point } true; {89#false} is VALID [2022-02-20 23:49:54,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {89#false} assume !(#valid == main_old_#valid#1); {89#false} is VALID [2022-02-20 23:49:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:54,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:54,545 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:54,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267971728] [2022-02-20 23:49:54,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267971728] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:54,546 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:54,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:49:54,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482842440] [2022-02-20 23:49:54,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:54,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:49:54,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:54,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:54,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:54,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:49:54,579 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:54,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:49:54,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:54,599 INFO L87 Difference]: Start difference. First operand has 85 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:55,052 INFO L93 Difference]: Finished difference Result 157 states and 181 transitions. [2022-02-20 23:49:55,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:49:55,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:49:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-02-20 23:49:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-02-20 23:49:55,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 182 transitions. [2022-02-20 23:49:55,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:55,249 INFO L225 Difference]: With dead ends: 157 [2022-02-20 23:49:55,249 INFO L226 Difference]: Without dead ends: 153 [2022-02-20 23:49:55,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:55,253 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:55,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 357 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-02-20 23:49:55,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 87. [2022-02-20 23:49:55,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:55,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 87 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:55,279 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 87 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:55,279 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 87 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:55,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:55,287 INFO L93 Difference]: Finished difference Result 153 states and 177 transitions. [2022-02-20 23:49:55,287 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2022-02-20 23:49:55,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:55,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:55,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Second operand 153 states. [2022-02-20 23:49:55,290 INFO L87 Difference]: Start difference. First operand has 87 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Second operand 153 states. [2022-02-20 23:49:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:55,297 INFO L93 Difference]: Finished difference Result 153 states and 177 transitions. [2022-02-20 23:49:55,297 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2022-02-20 23:49:55,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:55,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:55,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:55,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2022-02-20 23:49:55,303 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 11 [2022-02-20 23:49:55,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:55,303 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2022-02-20 23:49:55,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2022-02-20 23:49:55,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:49:55,304 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:55,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:55,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:49:55,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:49:55,512 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:49:55,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:55,515 INFO L85 PathProgramCache]: Analyzing trace with hash -851123828, now seen corresponding path program 1 times [2022-02-20 23:49:55,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:55,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846754918] [2022-02-20 23:49:55,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:55,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:55,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:55,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:49:55,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:49:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:55,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:49:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:55,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:55,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {675#true} is VALID [2022-02-20 23:49:55,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {683#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:55,622 INFO L272 TraceCheckUtils]: 2: Hoare triple {683#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {687#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:55,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {687#(= |old(#valid)| |#valid|)} ~size := #in~size; {687#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:55,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {687#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {687#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:55,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {687#(= |old(#valid)| |#valid|)} assume true; {687#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:55,624 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {687#(= |old(#valid)| |#valid|)} {683#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #118#return; {683#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:55,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {683#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {683#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:55,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {683#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32; {683#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:55,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_entry_point } true; {683#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:55,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {683#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {676#false} is VALID [2022-02-20 23:49:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:55,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:55,627 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:55,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846754918] [2022-02-20 23:49:55,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846754918] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:55,627 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:55,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:49:55,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103020936] [2022-02-20 23:49:55,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:55,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:49:55,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:55,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:55,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:55,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:49:55,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:55,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:49:55,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:49:55,646 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:56,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:56,223 INFO L93 Difference]: Finished difference Result 153 states and 176 transitions. [2022-02-20 23:49:56,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:49:56,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:49:56,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-02-20 23:49:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-02-20 23:49:56,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 177 transitions. [2022-02-20 23:49:56,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:56,379 INFO L225 Difference]: With dead ends: 153 [2022-02-20 23:49:56,379 INFO L226 Difference]: Without dead ends: 151 [2022-02-20 23:49:56,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:49:56,380 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 66 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:56,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 304 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:49:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-02-20 23:49:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 83. [2022-02-20 23:49:56,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:56,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 83 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 74 states have internal predecessors, (79), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:49:56,393 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 83 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 74 states have internal predecessors, (79), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:49:56,394 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 83 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 74 states have internal predecessors, (79), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:49:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:56,402 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2022-02-20 23:49:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 174 transitions. [2022-02-20 23:49:56,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:56,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:56,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 74 states have internal predecessors, (79), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 151 states. [2022-02-20 23:49:56,409 INFO L87 Difference]: Start difference. First operand has 83 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 74 states have internal predecessors, (79), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 151 states. [2022-02-20 23:49:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:56,418 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2022-02-20 23:49:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 174 transitions. [2022-02-20 23:49:56,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:56,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:56,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:56,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 74 states have internal predecessors, (79), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:49:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-02-20 23:49:56,425 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 11 [2022-02-20 23:49:56,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:56,425 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-02-20 23:49:56,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-02-20 23:49:56,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:49:56,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:56,427 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:56,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:56,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:49:56,633 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:49:56,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:56,634 INFO L85 PathProgramCache]: Analyzing trace with hash -470294884, now seen corresponding path program 1 times [2022-02-20 23:49:56,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:56,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804422240] [2022-02-20 23:49:56,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:56,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:56,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:56,635 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:49:56,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:49:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:56,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:49:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:56,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:56,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {1249#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {1249#true} is VALID [2022-02-20 23:49:56,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {1249#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {1249#true} is VALID [2022-02-20 23:49:56,742 INFO L272 TraceCheckUtils]: 2: Hoare triple {1249#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {1249#true} is VALID [2022-02-20 23:49:56,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {1249#true} ~size := #in~size; {1249#true} is VALID [2022-02-20 23:49:56,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {1249#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1249#true} is VALID [2022-02-20 23:49:56,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {1249#true} assume true; {1249#true} is VALID [2022-02-20 23:49:56,743 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1249#true} {1249#true} #118#return; {1249#true} is VALID [2022-02-20 23:49:56,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {1249#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {1249#true} is VALID [2022-02-20 23:49:56,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {1249#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {1249#true} is VALID [2022-02-20 23:49:56,744 INFO L272 TraceCheckUtils]: 9: Hoare triple {1249#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {1249#true} is VALID [2022-02-20 23:49:56,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {1249#true} ~size := #in~size; {1249#true} is VALID [2022-02-20 23:49:56,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {1249#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1287#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:56,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {1287#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {1287#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:56,750 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1287#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {1249#true} #120#return; {1294#(not (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:56,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {1294#(not (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {1298#(not (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:56,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {1298#(not (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 32)))} assume entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32; {1250#false} is VALID [2022-02-20 23:49:56,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {1250#false} assume !(0bv32 == entry_point_~c11~0#1.offset); {1250#false} is VALID [2022-02-20 23:49:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:49:56,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:56,751 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:56,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804422240] [2022-02-20 23:49:56,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804422240] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:56,752 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:56,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:49:56,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445283651] [2022-02-20 23:49:56,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:56,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-02-20 23:49:56,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:56,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:56,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:56,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:49:56,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:56,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:49:56,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:56,767 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:57,139 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2022-02-20 23:49:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:49:57,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-02-20 23:49:57,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2022-02-20 23:49:57,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2022-02-20 23:49:57,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 171 transitions. [2022-02-20 23:49:57,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:57,269 INFO L225 Difference]: With dead ends: 150 [2022-02-20 23:49:57,270 INFO L226 Difference]: Without dead ends: 150 [2022-02-20 23:49:57,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:57,271 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 63 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:57,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 355 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-02-20 23:49:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 87. [2022-02-20 23:49:57,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:57,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 87 states, 51 states have (on average 1.607843137254902) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:57,279 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 87 states, 51 states have (on average 1.607843137254902) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:57,280 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 87 states, 51 states have (on average 1.607843137254902) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:57,288 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2022-02-20 23:49:57,288 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2022-02-20 23:49:57,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:57,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:57,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 51 states have (on average 1.607843137254902) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Second operand 150 states. [2022-02-20 23:49:57,290 INFO L87 Difference]: Start difference. First operand has 87 states, 51 states have (on average 1.607843137254902) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Second operand 150 states. [2022-02-20 23:49:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:57,295 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2022-02-20 23:49:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2022-02-20 23:49:57,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:57,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:57,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:57,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.607843137254902) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2022-02-20 23:49:57,302 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 17 [2022-02-20 23:49:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:57,302 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2022-02-20 23:49:57,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2022-02-20 23:49:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:49:57,304 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:57,304 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:57,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:57,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:49:57,505 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:49:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:57,506 INFO L85 PathProgramCache]: Analyzing trace with hash -470294895, now seen corresponding path program 1 times [2022-02-20 23:49:57,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:57,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770779295] [2022-02-20 23:49:57,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:57,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:57,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:57,507 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:49:57,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:49:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:57,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:49:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:57,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:57,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:49:57,718 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:49:57,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-02-20 23:49:57,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {1841#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {1841#true} is VALID [2022-02-20 23:49:57,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {1841#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {1841#true} is VALID [2022-02-20 23:49:57,750 INFO L272 TraceCheckUtils]: 2: Hoare triple {1841#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {1841#true} is VALID [2022-02-20 23:49:57,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {1841#true} ~size := #in~size; {1841#true} is VALID [2022-02-20 23:49:57,751 INFO L290 TraceCheckUtils]: 4: Hoare triple {1841#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1858#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:49:57,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {1858#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {1858#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:49:57,752 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1858#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {1841#true} #118#return; {1865#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:57,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {1865#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:57,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:57,754 INFO L272 TraceCheckUtils]: 9: Hoare triple {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {1876#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:57,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {1876#(= |old(#valid)| |#valid|)} ~size := #in~size; {1876#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:57,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {1876#(= |old(#valid)| |#valid|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1883#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_12 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_12) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:49:57,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {1883#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_12 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_12) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {1883#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_12 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_12) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:49:57,759 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1883#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_12 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_12) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} #120#return; {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:57,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:57,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:57,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~c11~0#1.base]); {1842#false} is VALID [2022-02-20 23:49:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:57,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:00,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~c11~0#1.base]); {1842#false} is VALID [2022-02-20 23:50:00,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:00,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:00,070 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1911#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} #120#return; {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:00,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {1911#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume true; {1911#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:50:00,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {1911#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1911#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:50:00,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {1911#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} ~size := #in~size; {1911#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:50:00,073 INFO L272 TraceCheckUtils]: 9: Hoare triple {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {1911#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:50:00,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:00,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {1865#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {1869#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:00,075 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1858#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {1841#true} #118#return; {1865#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:00,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {1858#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {1858#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:00,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {1841#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1858#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:00,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {1841#true} ~size := #in~size; {1841#true} is VALID [2022-02-20 23:50:00,076 INFO L272 TraceCheckUtils]: 2: Hoare triple {1841#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {1841#true} is VALID [2022-02-20 23:50:00,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {1841#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {1841#true} is VALID [2022-02-20 23:50:00,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {1841#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {1841#true} is VALID [2022-02-20 23:50:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:50:00,077 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:00,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770779295] [2022-02-20 23:50:00,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770779295] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:50:00,078 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:00,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2022-02-20 23:50:00,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236827301] [2022-02-20 23:50:00,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:00,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2022-02-20 23:50:00,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:00,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:00,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:00,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:00,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:00,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:00,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=40, Unknown=1, NotChecked=0, Total=56 [2022-02-20 23:50:00,119 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:00,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:00,629 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-02-20 23:50:00,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:50:00,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2022-02-20 23:50:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2022-02-20 23:50:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2022-02-20 23:50:00,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 118 transitions. [2022-02-20 23:50:00,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:00,732 INFO L225 Difference]: With dead ends: 107 [2022-02-20 23:50:00,732 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 23:50:00,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=20, Invalid=51, Unknown=1, NotChecked=0, Total=72 [2022-02-20 23:50:00,733 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 10 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:00,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 317 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 50 Unchecked, 0.1s Time] [2022-02-20 23:50:00,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 23:50:00,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2022-02-20 23:50:00,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:00,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 104 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 90 states have internal predecessors, (101), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-20 23:50:00,737 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 104 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 90 states have internal predecessors, (101), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-20 23:50:00,738 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 104 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 90 states have internal predecessors, (101), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-20 23:50:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:00,740 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-02-20 23:50:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2022-02-20 23:50:00,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:00,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:00,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 90 states have internal predecessors, (101), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) Second operand 107 states. [2022-02-20 23:50:00,741 INFO L87 Difference]: Start difference. First operand has 104 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 90 states have internal predecessors, (101), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) Second operand 107 states. [2022-02-20 23:50:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:00,743 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-02-20 23:50:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2022-02-20 23:50:00,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:00,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:00,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:00,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 90 states have internal predecessors, (101), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-20 23:50:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2022-02-20 23:50:00,746 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 17 [2022-02-20 23:50:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:00,746 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2022-02-20 23:50:00,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2022-02-20 23:50:00,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:50:00,747 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:00,747 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:00,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:00,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:00,954 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:50:00,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:00,954 INFO L85 PathProgramCache]: Analyzing trace with hash -470294894, now seen corresponding path program 1 times [2022-02-20 23:50:00,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:00,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908874926] [2022-02-20 23:50:00,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:00,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:00,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:00,956 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:00,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:50:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:01,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:50:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:01,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:01,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:50:01,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:50:03,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:03,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:03,235 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:03,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:50:03,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {2374#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {2374#true} is VALID [2022-02-20 23:50:03,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {2374#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {2374#true} is VALID [2022-02-20 23:50:03,282 INFO L272 TraceCheckUtils]: 2: Hoare triple {2374#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {2374#true} is VALID [2022-02-20 23:50:03,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {2374#true} ~size := #in~size; {2388#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:03,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {2388#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {2392#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:03,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {2392#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {2392#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:03,285 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2392#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {2374#true} #118#return; {2399#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:03,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {2399#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {2403#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:03,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {2403#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {2403#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:03,287 INFO L272 TraceCheckUtils]: 9: Hoare triple {2403#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {2410#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:03,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {2410#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {2410#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:03,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {2410#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {2417#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:03,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {2417#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {2417#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:03,291 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2417#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {2403#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} #120#return; {2424#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:03,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {2424#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {2424#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:03,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {2424#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {2424#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:03,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {2424#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, entry_point_~c11~0#1.offset), #length[entry_point_~c11~0#1.base]) && ~bvule32(entry_point_~c11~0#1.offset, ~bvadd32(4bv32, entry_point_~c11~0#1.offset))) && ~bvule32(0bv32, entry_point_~c11~0#1.offset)); {2375#false} is VALID [2022-02-20 23:50:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:50:03,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:03,534 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:03,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908874926] [2022-02-20 23:50:03,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908874926] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:03,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1297786010] [2022-02-20 23:50:03,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:03,535 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:03,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:50:03,536 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:50:03,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-02-20 23:50:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:03,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:50:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:03,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:03,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:50:03,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:50:05,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:05,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:05,816 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:05,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:50:05,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {2374#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {2374#true} is VALID [2022-02-20 23:50:05,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {2374#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {2374#true} is VALID [2022-02-20 23:50:05,839 INFO L272 TraceCheckUtils]: 2: Hoare triple {2374#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {2374#true} is VALID [2022-02-20 23:50:05,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {2374#true} ~size := #in~size; {2388#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:05,840 INFO L290 TraceCheckUtils]: 4: Hoare triple {2388#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {2392#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {2392#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {2392#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,842 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2392#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {2374#true} #118#return; {2399#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:05,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {2399#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {2403#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {2403#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {2403#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,844 INFO L272 TraceCheckUtils]: 9: Hoare triple {2403#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {2410#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:05,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {2410#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {2410#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:05,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {2410#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {2417#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:05,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {2417#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {2417#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:05,847 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2417#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {2403#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} #120#return; {2424#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {2424#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {2424#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {2424#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {2424#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {2424#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, entry_point_~c11~0#1.offset), #length[entry_point_~c11~0#1.base]) && ~bvule32(entry_point_~c11~0#1.offset, ~bvadd32(4bv32, entry_point_~c11~0#1.offset))) && ~bvule32(0bv32, entry_point_~c11~0#1.offset)); {2375#false} is VALID [2022-02-20 23:50:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:50:05,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:06,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1297786010] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:06,041 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:06,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-02-20 23:50:06,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808340220] [2022-02-20 23:50:06,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:06,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-02-20 23:50:06,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:06,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:06,057 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:50:06,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:50:06,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:06,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:50:06,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2022-02-20 23:50:06,058 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:07,993 INFO L93 Difference]: Finished difference Result 179 states and 200 transitions. [2022-02-20 23:50:07,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:07,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-02-20 23:50:07,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2022-02-20 23:50:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2022-02-20 23:50:07,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 197 transitions. [2022-02-20 23:50:08,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:08,165 INFO L225 Difference]: With dead ends: 179 [2022-02-20 23:50:08,165 INFO L226 Difference]: Without dead ends: 179 [2022-02-20 23:50:08,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2022-02-20 23:50:08,166 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 139 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:08,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 559 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 391 Invalid, 0 Unknown, 78 Unchecked, 0.6s Time] [2022-02-20 23:50:08,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-02-20 23:50:08,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 138. [2022-02-20 23:50:08,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:08,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 138 states, 95 states have (on average 1.5894736842105264) internal successors, (151), 120 states have internal predecessors, (151), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2022-02-20 23:50:08,172 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 138 states, 95 states have (on average 1.5894736842105264) internal successors, (151), 120 states have internal predecessors, (151), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2022-02-20 23:50:08,172 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 138 states, 95 states have (on average 1.5894736842105264) internal successors, (151), 120 states have internal predecessors, (151), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2022-02-20 23:50:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:08,176 INFO L93 Difference]: Finished difference Result 179 states and 200 transitions. [2022-02-20 23:50:08,176 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 200 transitions. [2022-02-20 23:50:08,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:08,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:08,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 95 states have (on average 1.5894736842105264) internal successors, (151), 120 states have internal predecessors, (151), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) Second operand 179 states. [2022-02-20 23:50:08,178 INFO L87 Difference]: Start difference. First operand has 138 states, 95 states have (on average 1.5894736842105264) internal successors, (151), 120 states have internal predecessors, (151), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) Second operand 179 states. [2022-02-20 23:50:08,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:08,182 INFO L93 Difference]: Finished difference Result 179 states and 200 transitions. [2022-02-20 23:50:08,182 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 200 transitions. [2022-02-20 23:50:08,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:08,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:08,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:08,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 95 states have (on average 1.5894736842105264) internal successors, (151), 120 states have internal predecessors, (151), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2022-02-20 23:50:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 180 transitions. [2022-02-20 23:50:08,186 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 180 transitions. Word has length 17 [2022-02-20 23:50:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:08,186 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 180 transitions. [2022-02-20 23:50:08,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 180 transitions. [2022-02-20 23:50:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:50:08,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:08,187 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:08,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:08,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:08,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:08,589 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:50:08,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:08,590 INFO L85 PathProgramCache]: Analyzing trace with hash -763697902, now seen corresponding path program 1 times [2022-02-20 23:50:08,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:08,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750699401] [2022-02-20 23:50:08,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:08,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:08,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:08,591 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:08,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:50:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:08,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:08,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:08,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {3186#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {3186#true} is VALID [2022-02-20 23:50:08,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {3186#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {3186#true} is VALID [2022-02-20 23:50:08,701 INFO L272 TraceCheckUtils]: 2: Hoare triple {3186#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {3186#true} is VALID [2022-02-20 23:50:08,701 INFO L290 TraceCheckUtils]: 3: Hoare triple {3186#true} ~size := #in~size; {3186#true} is VALID [2022-02-20 23:50:08,702 INFO L290 TraceCheckUtils]: 4: Hoare triple {3186#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {3203#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:08,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {3203#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {3203#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:08,703 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3203#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {3186#true} #118#return; {3210#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= |ULTIMATE.start_entry_point_#t~ret43#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:08,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {3210#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= |ULTIMATE.start_entry_point_#t~ret43#1.base| (_ bv0 32)))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {3214#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:08,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {3214#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32)))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {3187#false} is VALID [2022-02-20 23:50:08,704 INFO L272 TraceCheckUtils]: 9: Hoare triple {3187#false} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {3187#false} is VALID [2022-02-20 23:50:08,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {3187#false} ~size := #in~size; {3187#false} is VALID [2022-02-20 23:50:08,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {3187#false} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3187#false} is VALID [2022-02-20 23:50:08,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {3187#false} assume true; {3187#false} is VALID [2022-02-20 23:50:08,705 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3187#false} {3187#false} #120#return; {3187#false} is VALID [2022-02-20 23:50:08,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {3187#false} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {3187#false} is VALID [2022-02-20 23:50:08,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {3187#false} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {3187#false} is VALID [2022-02-20 23:50:08,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {3187#false} assume !(1bv1 == #valid[entry_point_~c11~0#1.base]); {3187#false} is VALID [2022-02-20 23:50:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:50:08,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:08,706 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:08,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750699401] [2022-02-20 23:50:08,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750699401] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:08,706 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:08,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:08,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233957968] [2022-02-20 23:50:08,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:08,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-02-20 23:50:08,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:08,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:08,726 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:50:08,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:08,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:08,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:08,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:08,727 INFO L87 Difference]: Start difference. First operand 138 states and 180 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:09,073 INFO L93 Difference]: Finished difference Result 129 states and 165 transitions. [2022-02-20 23:50:09,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:09,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-02-20 23:50:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-02-20 23:50:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:09,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-02-20 23:50:09,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 96 transitions. [2022-02-20 23:50:09,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:09,147 INFO L225 Difference]: With dead ends: 129 [2022-02-20 23:50:09,147 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 23:50:09,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:09,148 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:09,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:50:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 23:50:09,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-02-20 23:50:09,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:09,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 88 states have (on average 1.6022727272727273) internal successors, (141), 112 states have internal predecessors, (141), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:09,153 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 88 states have (on average 1.6022727272727273) internal successors, (141), 112 states have internal predecessors, (141), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:09,153 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 88 states have (on average 1.6022727272727273) internal successors, (141), 112 states have internal predecessors, (141), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:09,156 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2022-02-20 23:50:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2022-02-20 23:50:09,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:09,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:09,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 88 states have (on average 1.6022727272727273) internal successors, (141), 112 states have internal predecessors, (141), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) Second operand 127 states. [2022-02-20 23:50:09,157 INFO L87 Difference]: Start difference. First operand has 127 states, 88 states have (on average 1.6022727272727273) internal successors, (141), 112 states have internal predecessors, (141), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) Second operand 127 states. [2022-02-20 23:50:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:09,160 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2022-02-20 23:50:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2022-02-20 23:50:09,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:09,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:09,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:09,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 88 states have (on average 1.6022727272727273) internal successors, (141), 112 states have internal predecessors, (141), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 163 transitions. [2022-02-20 23:50:09,163 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 163 transitions. Word has length 17 [2022-02-20 23:50:09,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:09,163 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 163 transitions. [2022-02-20 23:50:09,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2022-02-20 23:50:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:50:09,164 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:09,164 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:09,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:09,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:09,371 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:50:09,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:09,371 INFO L85 PathProgramCache]: Analyzing trace with hash -806735705, now seen corresponding path program 1 times [2022-02-20 23:50:09,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:09,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230400524] [2022-02-20 23:50:09,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:09,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:09,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:09,372 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:09,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:50:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:09,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:50:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:09,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:09,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {3751#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {3756#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:09,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {3756#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {3756#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:09,649 INFO L272 TraceCheckUtils]: 2: Hoare triple {3756#(bvult (_ bv0 32) |#StackHeapBarrier|)} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {3756#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:09,650 INFO L290 TraceCheckUtils]: 3: Hoare triple {3756#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {3756#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:09,650 INFO L290 TraceCheckUtils]: 4: Hoare triple {3756#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3769#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:09,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {3769#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} assume true; {3769#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:09,651 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3769#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} {3756#(bvult (_ bv0 32) |#StackHeapBarrier|)} #118#return; {3776#(and (not (= |ULTIMATE.start_entry_point_#t~ret43#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_entry_point_#t~ret43#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:50:09,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {3776#(and (not (= |ULTIMATE.start_entry_point_#t~ret43#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_entry_point_#t~ret43#1.base| |#StackHeapBarrier|))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {3780#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:09,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {3780#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {3780#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:09,654 INFO L272 TraceCheckUtils]: 9: Hoare triple {3780#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {3787#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} is VALID [2022-02-20 23:50:09,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {3787#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} ~size := #in~size; {3787#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} is VALID [2022-02-20 23:50:09,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {3787#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {3787#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} is VALID [2022-02-20 23:50:09,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {3787#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} assume true; {3787#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} is VALID [2022-02-20 23:50:09,668 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3787#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} {3780#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} #120#return; {3780#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:09,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {3780#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {3780#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:09,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {3780#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} assume entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32; {3780#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:09,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {3780#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} assume 0bv32 == entry_point_~c11~0#1.offset; {3780#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:09,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {3780#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} assume !~bvult32(entry_point_~c11~0#1.base, #StackHeapBarrier); {3752#false} is VALID [2022-02-20 23:50:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:50:09,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:09,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {3812#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} assume !~bvult32(entry_point_~c11~0#1.base, #StackHeapBarrier); {3752#false} is VALID [2022-02-20 23:50:09,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {3812#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} assume 0bv32 == entry_point_~c11~0#1.offset; {3812#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:09,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {3812#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} assume entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32; {3812#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:09,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {3812#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {3812#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:09,791 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3751#true} {3812#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} #120#return; {3812#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:09,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {3751#true} assume true; {3751#true} is VALID [2022-02-20 23:50:09,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {3751#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {3751#true} is VALID [2022-02-20 23:50:09,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {3751#true} ~size := #in~size; {3751#true} is VALID [2022-02-20 23:50:09,792 INFO L272 TraceCheckUtils]: 9: Hoare triple {3812#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {3751#true} is VALID [2022-02-20 23:50:09,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {3812#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {3812#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:09,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {3843#(bvult |ULTIMATE.start_entry_point_#t~ret43#1.base| |#StackHeapBarrier|)} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {3812#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:09,793 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3850#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} {3751#true} #118#return; {3843#(bvult |ULTIMATE.start_entry_point_#t~ret43#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:09,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {3850#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} assume true; {3850#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:09,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {3751#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3850#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:09,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {3751#true} ~size := #in~size; {3751#true} is VALID [2022-02-20 23:50:09,793 INFO L272 TraceCheckUtils]: 2: Hoare triple {3751#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {3751#true} is VALID [2022-02-20 23:50:09,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {3751#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {3751#true} is VALID [2022-02-20 23:50:09,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {3751#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {3751#true} is VALID [2022-02-20 23:50:09,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:09,794 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:09,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230400524] [2022-02-20 23:50:09,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230400524] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:50:09,794 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:09,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2022-02-20 23:50:09,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876337857] [2022-02-20 23:50:09,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:09,795 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2022-02-20 23:50:09,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:09,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:09,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:09,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:50:09,827 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:09,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:50:09,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:50:09,827 INFO L87 Difference]: Start difference. First operand 127 states and 163 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:10,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:10,309 INFO L93 Difference]: Finished difference Result 136 states and 169 transitions. [2022-02-20 23:50:10,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:50:10,309 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2022-02-20 23:50:10,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2022-02-20 23:50:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2022-02-20 23:50:10,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 107 transitions. [2022-02-20 23:50:10,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:10,400 INFO L225 Difference]: With dead ends: 136 [2022-02-20 23:50:10,400 INFO L226 Difference]: Without dead ends: 134 [2022-02-20 23:50:10,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:50:10,401 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 19 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:10,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 375 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 21 Unchecked, 0.0s Time] [2022-02-20 23:50:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-02-20 23:50:10,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2022-02-20 23:50:10,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:10,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 131 states, 91 states have (on average 1.5714285714285714) internal successors, (143), 115 states have internal predecessors, (143), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:10,404 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 131 states, 91 states have (on average 1.5714285714285714) internal successors, (143), 115 states have internal predecessors, (143), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:10,405 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 131 states, 91 states have (on average 1.5714285714285714) internal successors, (143), 115 states have internal predecessors, (143), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:10,407 INFO L93 Difference]: Finished difference Result 134 states and 167 transitions. [2022-02-20 23:50:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 167 transitions. [2022-02-20 23:50:10,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:10,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:10,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 91 states have (on average 1.5714285714285714) internal successors, (143), 115 states have internal predecessors, (143), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) Second operand 134 states. [2022-02-20 23:50:10,408 INFO L87 Difference]: Start difference. First operand has 131 states, 91 states have (on average 1.5714285714285714) internal successors, (143), 115 states have internal predecessors, (143), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) Second operand 134 states. [2022-02-20 23:50:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:10,421 INFO L93 Difference]: Finished difference Result 134 states and 167 transitions. [2022-02-20 23:50:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 167 transitions. [2022-02-20 23:50:10,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:10,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:10,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:10,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 91 states have (on average 1.5714285714285714) internal successors, (143), 115 states have internal predecessors, (143), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 165 transitions. [2022-02-20 23:50:10,424 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 165 transitions. Word has length 18 [2022-02-20 23:50:10,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:10,425 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 165 transitions. [2022-02-20 23:50:10,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 165 transitions. [2022-02-20 23:50:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:50:10,425 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:10,425 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:10,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:10,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:10,634 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:50:10,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:10,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1173731936, now seen corresponding path program 1 times [2022-02-20 23:50:10,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:10,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888198767] [2022-02-20 23:50:10,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:10,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:10,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:10,635 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:10,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:50:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:10,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:50:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:10,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:10,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {4402#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {4402#true} is VALID [2022-02-20 23:50:10,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {4402#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {4410#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:10,869 INFO L272 TraceCheckUtils]: 2: Hoare triple {4410#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {4414#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:10,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {4414#(= |old(#valid)| |#valid|)} ~size := #in~size; {4414#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:10,870 INFO L290 TraceCheckUtils]: 4: Hoare triple {4414#(= |old(#valid)| |#valid|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {4421#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:10,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {4421#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} assume true; {4421#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:10,872 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4421#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} {4410#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #118#return; {4428#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base|))) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:10,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {4428#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base|))) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base| v_ArrVal_44) |#valid|)))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {4432#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:10,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {4432#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {4432#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:10,876 INFO L272 TraceCheckUtils]: 9: Hoare triple {4432#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {4414#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:10,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {4414#(= |old(#valid)| |#valid|)} ~size := #in~size; {4414#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:10,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {4414#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {4414#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:10,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {4414#(= |old(#valid)| |#valid|)} assume true; {4414#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:10,878 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4414#(= |old(#valid)| |#valid|)} {4432#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} #120#return; {4432#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:10,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {4432#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {4432#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:10,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {4432#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} assume entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32; {4432#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:10,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {4432#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} assume 0bv32 == entry_point_~c11~0#1.offset; {4432#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:10,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {4432#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} assume ~bvult32(entry_point_~c11~0#1.base, #StackHeapBarrier); {4432#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:10,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {4432#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} assume 0bv32 == entry_point_~c11~0#1.base || 1bv1 == #valid[entry_point_~c11~0#1.base];call ULTIMATE.dealloc(entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset); {4466#(exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1)) |#valid|) (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:10,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {4466#(exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1)) |#valid|) (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1))))} assume { :end_inline_entry_point } true; {4466#(exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1)) |#valid|) (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:10,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {4466#(exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1)) |#valid|) (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1))))} assume !(#valid == main_old_#valid#1); {4403#false} is VALID [2022-02-20 23:50:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:10,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:15,096 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:15,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888198767] [2022-02-20 23:50:15,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888198767] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:15,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [53795259] [2022-02-20 23:50:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:15,096 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:15,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:50:15,097 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:50:15,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-02-20 23:50:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:15,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:50:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:15,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:15,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {4402#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {4521#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} is VALID [2022-02-20 23:50:15,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {4521#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {4525#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} is VALID [2022-02-20 23:50:15,411 INFO L272 TraceCheckUtils]: 2: Hoare triple {4525#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {4414#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:15,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {4414#(= |old(#valid)| |#valid|)} ~size := #in~size; {4414#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:15,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {4414#(= |old(#valid)| |#valid|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {4421#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:15,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {4421#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} assume true; {4421#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:15,414 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4421#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} {4525#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} #118#return; {4541#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base|))) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:15,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {4541#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base|))) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {4545#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:15,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {4545#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {4545#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:15,416 INFO L272 TraceCheckUtils]: 9: Hoare triple {4545#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {4414#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:15,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {4414#(= |old(#valid)| |#valid|)} ~size := #in~size; {4414#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:15,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {4414#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {4414#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:15,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {4414#(= |old(#valid)| |#valid|)} assume true; {4414#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:15,418 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4414#(= |old(#valid)| |#valid|)} {4545#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} #120#return; {4545#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:15,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {4545#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {4545#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:15,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {4545#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32; {4545#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:15,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {4545#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume 0bv32 == entry_point_~c11~0#1.offset; {4545#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:15,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {4545#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume ~bvult32(entry_point_~c11~0#1.base, #StackHeapBarrier); {4545#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:15,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {4545#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume 0bv32 == entry_point_~c11~0#1.base || 1bv1 == #valid[entry_point_~c11~0#1.base];call ULTIMATE.dealloc(entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset); {4525#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} is VALID [2022-02-20 23:50:15,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {4525#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} assume { :end_inline_entry_point } true; {4525#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} is VALID [2022-02-20 23:50:15,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {4525#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} assume !(#valid == main_old_#valid#1); {4403#false} is VALID [2022-02-20 23:50:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:15,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:19,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [53795259] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:19,576 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:19,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2022-02-20 23:50:19,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826801392] [2022-02-20 23:50:19,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:19,577 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2022-02-20 23:50:19,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:19,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:19,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:19,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:50:19,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:19,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:50:19,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=166, Unknown=2, NotChecked=0, Total=210 [2022-02-20 23:50:19,606 INFO L87 Difference]: Start difference. First operand 131 states and 165 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:20,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:20,306 INFO L93 Difference]: Finished difference Result 134 states and 167 transitions. [2022-02-20 23:50:20,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:20,306 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2022-02-20 23:50:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2022-02-20 23:50:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2022-02-20 23:50:20,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 104 transitions. [2022-02-20 23:50:20,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:20,401 INFO L225 Difference]: With dead ends: 134 [2022-02-20 23:50:20,401 INFO L226 Difference]: Without dead ends: 129 [2022-02-20 23:50:20,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=50, Invalid=220, Unknown=2, NotChecked=0, Total=272 [2022-02-20 23:50:20,402 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 13 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:20,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 481 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 203 Unchecked, 0.1s Time] [2022-02-20 23:50:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-20 23:50:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2022-02-20 23:50:20,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:20,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 124 states, 85 states have (on average 1.6) internal successors, (136), 109 states have internal predecessors, (136), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-20 23:50:20,410 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 124 states, 85 states have (on average 1.6) internal successors, (136), 109 states have internal predecessors, (136), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-20 23:50:20,411 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 124 states, 85 states have (on average 1.6) internal successors, (136), 109 states have internal predecessors, (136), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-20 23:50:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:20,418 INFO L93 Difference]: Finished difference Result 129 states and 162 transitions. [2022-02-20 23:50:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 162 transitions. [2022-02-20 23:50:20,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:20,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:20,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 85 states have (on average 1.6) internal successors, (136), 109 states have internal predecessors, (136), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) Second operand 129 states. [2022-02-20 23:50:20,419 INFO L87 Difference]: Start difference. First operand has 124 states, 85 states have (on average 1.6) internal successors, (136), 109 states have internal predecessors, (136), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) Second operand 129 states. [2022-02-20 23:50:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:20,427 INFO L93 Difference]: Finished difference Result 129 states and 162 transitions. [2022-02-20 23:50:20,427 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 162 transitions. [2022-02-20 23:50:20,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:20,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:20,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:20,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 85 states have (on average 1.6) internal successors, (136), 109 states have internal predecessors, (136), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-20 23:50:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 157 transitions. [2022-02-20 23:50:20,430 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 157 transitions. Word has length 21 [2022-02-20 23:50:20,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:20,431 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 157 transitions. [2022-02-20 23:50:20,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:20,431 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-02-20 23:50:20,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:50:20,431 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:20,431 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:20,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:20,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:20,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:20,834 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:50:20,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:20,834 INFO L85 PathProgramCache]: Analyzing trace with hash -624729604, now seen corresponding path program 1 times [2022-02-20 23:50:20,834 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:20,834 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148136583] [2022-02-20 23:50:20,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:20,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:20,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:20,835 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:20,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:50:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:20,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:50:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:20,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:20,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:50:21,001 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:50:21,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:50:21,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {5149#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {5149#true} is VALID [2022-02-20 23:50:21,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {5149#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {5149#true} is VALID [2022-02-20 23:50:21,016 INFO L272 TraceCheckUtils]: 2: Hoare triple {5149#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {5149#true} is VALID [2022-02-20 23:50:21,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {5149#true} ~size := #in~size; {5149#true} is VALID [2022-02-20 23:50:21,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {5149#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5149#true} is VALID [2022-02-20 23:50:21,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {5149#true} assume true; {5149#true} is VALID [2022-02-20 23:50:21,017 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5149#true} {5149#true} #118#return; {5149#true} is VALID [2022-02-20 23:50:21,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {5149#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {5149#true} is VALID [2022-02-20 23:50:21,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {5149#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {5149#true} is VALID [2022-02-20 23:50:21,017 INFO L272 TraceCheckUtils]: 9: Hoare triple {5149#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {5149#true} is VALID [2022-02-20 23:50:21,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {5149#true} ~size := #in~size; {5149#true} is VALID [2022-02-20 23:50:21,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {5149#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5187#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:21,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {5187#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {5187#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:21,019 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5187#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {5149#true} #120#return; {5194#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:21,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {5194#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:21,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:21,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L807 {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:21,021 INFO L272 TraceCheckUtils]: 17: Hoare triple {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {5208#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:21,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {5208#(= |old(#valid)| |#valid|)} ~size := #in~size; {5208#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:21,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {5208#(= |old(#valid)| |#valid|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5215#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:50:21,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {5215#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} assume true; {5215#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:50:21,024 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5215#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} #122#return; {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:21,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:21,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:21,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~cfg~1#1.base]); {5150#false} is VALID [2022-02-20 23:50:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:21,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:21,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~cfg~1#1.base]); {5150#false} is VALID [2022-02-20 23:50:21,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:21,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:21,193 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5243#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} #122#return; {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:21,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {5243#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume true; {5243#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:50:21,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {5243#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5243#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:50:21,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {5243#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} ~size := #in~size; {5243#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:50:21,197 INFO L272 TraceCheckUtils]: 17: Hoare triple {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {5243#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:50:21,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L807 {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:21,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:21,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {5194#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {5198#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:21,199 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5187#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {5149#true} #120#return; {5194#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:21,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {5187#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {5187#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:21,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {5149#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5187#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:21,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {5149#true} ~size := #in~size; {5149#true} is VALID [2022-02-20 23:50:21,201 INFO L272 TraceCheckUtils]: 9: Hoare triple {5149#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {5149#true} is VALID [2022-02-20 23:50:21,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {5149#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {5149#true} is VALID [2022-02-20 23:50:21,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {5149#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {5149#true} is VALID [2022-02-20 23:50:21,208 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5149#true} {5149#true} #118#return; {5149#true} is VALID [2022-02-20 23:50:21,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {5149#true} assume true; {5149#true} is VALID [2022-02-20 23:50:21,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {5149#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5149#true} is VALID [2022-02-20 23:50:21,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {5149#true} ~size := #in~size; {5149#true} is VALID [2022-02-20 23:50:21,211 INFO L272 TraceCheckUtils]: 2: Hoare triple {5149#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {5149#true} is VALID [2022-02-20 23:50:21,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {5149#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {5149#true} is VALID [2022-02-20 23:50:21,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {5149#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {5149#true} is VALID [2022-02-20 23:50:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:21,211 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:21,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148136583] [2022-02-20 23:50:21,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148136583] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:50:21,212 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:21,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2022-02-20 23:50:21,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439633156] [2022-02-20 23:50:21,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:21,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-02-20 23:50:21,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:21,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:21,240 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:50:21,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:21,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:21,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:21,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:50:21,242 INFO L87 Difference]: Start difference. First operand 124 states and 157 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:22,268 INFO L93 Difference]: Finished difference Result 179 states and 226 transitions. [2022-02-20 23:50:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:22,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-02-20 23:50:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2022-02-20 23:50:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2022-02-20 23:50:22,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 144 transitions. [2022-02-20 23:50:22,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:22,384 INFO L225 Difference]: With dead ends: 179 [2022-02-20 23:50:22,384 INFO L226 Difference]: Without dead ends: 179 [2022-02-20 23:50:22,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:22,384 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 52 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:22,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 474 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 126 Unchecked, 0.3s Time] [2022-02-20 23:50:22,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-02-20 23:50:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 142. [2022-02-20 23:50:22,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:22,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 142 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 124 states have internal predecessors, (160), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2022-02-20 23:50:22,388 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 142 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 124 states have internal predecessors, (160), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2022-02-20 23:50:22,389 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 142 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 124 states have internal predecessors, (160), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2022-02-20 23:50:22,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:22,395 INFO L93 Difference]: Finished difference Result 179 states and 226 transitions. [2022-02-20 23:50:22,395 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 226 transitions. [2022-02-20 23:50:22,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:22,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:22,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 124 states have internal predecessors, (160), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) Second operand 179 states. [2022-02-20 23:50:22,396 INFO L87 Difference]: Start difference. First operand has 142 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 124 states have internal predecessors, (160), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) Second operand 179 states. [2022-02-20 23:50:22,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:22,399 INFO L93 Difference]: Finished difference Result 179 states and 226 transitions. [2022-02-20 23:50:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 226 transitions. [2022-02-20 23:50:22,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:22,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:22,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:22,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 124 states have internal predecessors, (160), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2022-02-20 23:50:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2022-02-20 23:50:22,407 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 25 [2022-02-20 23:50:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:22,408 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2022-02-20 23:50:22,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2022-02-20 23:50:22,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:50:22,408 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:22,409 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:22,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-02-20 23:50:22,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:22,615 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:50:22,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:22,616 INFO L85 PathProgramCache]: Analyzing trace with hash -624729603, now seen corresponding path program 1 times [2022-02-20 23:50:22,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:22,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810169891] [2022-02-20 23:50:22,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:22,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:22,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:22,617 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:22,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:50:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:22,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:50:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:22,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:22,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:50:26,869 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:50:26,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:26,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {5984#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {5984#true} is VALID [2022-02-20 23:50:26,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {5984#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {5984#true} is VALID [2022-02-20 23:50:26,893 INFO L272 TraceCheckUtils]: 2: Hoare triple {5984#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {5984#true} is VALID [2022-02-20 23:50:26,894 INFO L290 TraceCheckUtils]: 3: Hoare triple {5984#true} ~size := #in~size; {5984#true} is VALID [2022-02-20 23:50:26,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {5984#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5984#true} is VALID [2022-02-20 23:50:26,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {5984#true} assume true; {5984#true} is VALID [2022-02-20 23:50:26,894 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5984#true} {5984#true} #118#return; {5984#true} is VALID [2022-02-20 23:50:26,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {5984#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {5984#true} is VALID [2022-02-20 23:50:26,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {5984#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {5984#true} is VALID [2022-02-20 23:50:26,894 INFO L272 TraceCheckUtils]: 9: Hoare triple {5984#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {5984#true} is VALID [2022-02-20 23:50:26,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {5984#true} ~size := #in~size; {6019#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:26,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {6019#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {6023#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:26,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {6023#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {6023#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:26,896 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6023#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {5984#true} #120#return; {6030#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:26,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {6030#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:26,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:26,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L807 {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:26,898 INFO L272 TraceCheckUtils]: 17: Hoare triple {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {6044#(= |#length| |old(#length)|)} is VALID [2022-02-20 23:50:26,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {6044#(= |#length| |old(#length)|)} ~size := #in~size; {6048#(and (= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:26,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {6048#(and (= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {6052#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} is VALID [2022-02-20 23:50:26,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {6052#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} assume true; {6052#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} is VALID [2022-02-20 23:50:26,901 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6052#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} #122#return; {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:26,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:26,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:26,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, entry_point_~cfg~1#1.offset), #length[entry_point_~cfg~1#1.base]) && ~bvule32(entry_point_~cfg~1#1.offset, ~bvadd32(4bv32, entry_point_~cfg~1#1.offset))) && ~bvule32(0bv32, entry_point_~cfg~1#1.offset)); {5985#false} is VALID [2022-02-20 23:50:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:50:26,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:27,096 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:27,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810169891] [2022-02-20 23:50:27,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810169891] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:27,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1624569805] [2022-02-20 23:50:27,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:27,096 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:27,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:50:27,097 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:50:27,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-02-20 23:50:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:27,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:50:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:27,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:27,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:50:27,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:50:31,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:31,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:31,482 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:31,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:50:31,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {5984#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {5984#true} is VALID [2022-02-20 23:50:31,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {5984#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {5984#true} is VALID [2022-02-20 23:50:31,502 INFO L272 TraceCheckUtils]: 2: Hoare triple {5984#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {5984#true} is VALID [2022-02-20 23:50:31,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {5984#true} ~size := #in~size; {5984#true} is VALID [2022-02-20 23:50:31,502 INFO L290 TraceCheckUtils]: 4: Hoare triple {5984#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5984#true} is VALID [2022-02-20 23:50:31,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {5984#true} assume true; {5984#true} is VALID [2022-02-20 23:50:31,502 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5984#true} {5984#true} #118#return; {5984#true} is VALID [2022-02-20 23:50:31,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {5984#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {5984#true} is VALID [2022-02-20 23:50:31,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {5984#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {5984#true} is VALID [2022-02-20 23:50:31,502 INFO L272 TraceCheckUtils]: 9: Hoare triple {5984#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {5984#true} is VALID [2022-02-20 23:50:31,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {5984#true} ~size := #in~size; {6019#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:31,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {6019#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {6115#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:31,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {6115#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {6115#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:31,505 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6115#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {5984#true} #120#return; {6122#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:31,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {6122#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {6126#(and (= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:31,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {6126#(and (= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {6126#(and (= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:31,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {6126#(and (= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L807 {6126#(and (= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:31,507 INFO L272 TraceCheckUtils]: 17: Hoare triple {6126#(and (= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {6136#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:31,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {6136#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {6136#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:31,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {6136#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {6143#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_102 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_102))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:31,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {6143#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_102 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_102))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {6143#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_102 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_102))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:31,510 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6143#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_102 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_102))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {6126#(and (= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} #122#return; {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:31,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:31,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:31,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {6034#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, entry_point_~cfg~1#1.offset), #length[entry_point_~cfg~1#1.base]) && ~bvule32(entry_point_~cfg~1#1.offset, ~bvadd32(4bv32, entry_point_~cfg~1#1.offset))) && ~bvule32(0bv32, entry_point_~cfg~1#1.offset)); {5985#false} is VALID [2022-02-20 23:50:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:50:31,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:34,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1624569805] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:34,026 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:34,026 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-02-20 23:50:34,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685890087] [2022-02-20 23:50:34,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:34,026 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2022-02-20 23:50:34,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:34,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 23:50:34,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:34,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:50:34,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:34,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:50:34,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=224, Unknown=5, NotChecked=0, Total=272 [2022-02-20 23:50:34,059 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 23:50:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:40,543 INFO L93 Difference]: Finished difference Result 238 states and 306 transitions. [2022-02-20 23:50:40,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:40,543 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2022-02-20 23:50:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 23:50:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2022-02-20 23:50:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 23:50:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2022-02-20 23:50:40,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 180 transitions. [2022-02-20 23:50:40,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:40,696 INFO L225 Difference]: With dead ends: 238 [2022-02-20 23:50:40,696 INFO L226 Difference]: Without dead ends: 238 [2022-02-20 23:50:40,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=56, Invalid=280, Unknown=6, NotChecked=0, Total=342 [2022-02-20 23:50:40,697 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 114 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:40,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 788 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 488 Invalid, 0 Unknown, 129 Unchecked, 0.7s Time] [2022-02-20 23:50:40,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-02-20 23:50:40,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 196. [2022-02-20 23:50:40,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:40,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 196 states, 149 states have (on average 1.5838926174496644) internal successors, (236), 172 states have internal predecessors, (236), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2022-02-20 23:50:40,702 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 196 states, 149 states have (on average 1.5838926174496644) internal successors, (236), 172 states have internal predecessors, (236), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2022-02-20 23:50:40,702 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 196 states, 149 states have (on average 1.5838926174496644) internal successors, (236), 172 states have internal predecessors, (236), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2022-02-20 23:50:40,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:40,708 INFO L93 Difference]: Finished difference Result 238 states and 306 transitions. [2022-02-20 23:50:40,708 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 306 transitions. [2022-02-20 23:50:40,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:40,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:40,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 149 states have (on average 1.5838926174496644) internal successors, (236), 172 states have internal predecessors, (236), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) Second operand 238 states. [2022-02-20 23:50:40,709 INFO L87 Difference]: Start difference. First operand has 196 states, 149 states have (on average 1.5838926174496644) internal successors, (236), 172 states have internal predecessors, (236), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) Second operand 238 states. [2022-02-20 23:50:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:40,713 INFO L93 Difference]: Finished difference Result 238 states and 306 transitions. [2022-02-20 23:50:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 306 transitions. [2022-02-20 23:50:40,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:40,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:40,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:40,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:40,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 149 states have (on average 1.5838926174496644) internal successors, (236), 172 states have internal predecessors, (236), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2022-02-20 23:50:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 275 transitions. [2022-02-20 23:50:40,717 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 275 transitions. Word has length 25 [2022-02-20 23:50:40,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:40,717 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 275 transitions. [2022-02-20 23:50:40,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 23:50:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 275 transitions. [2022-02-20 23:50:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:50:40,718 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:40,718 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:40,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:40,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:41,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:41,121 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:50:41,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:41,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1130288229, now seen corresponding path program 1 times [2022-02-20 23:50:41,121 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:41,121 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69251529] [2022-02-20 23:50:41,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:41,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:41,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:41,123 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:41,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:50:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:41,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:41,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:41,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {7086#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {7086#true} is VALID [2022-02-20 23:50:41,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {7086#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {7086#true} is VALID [2022-02-20 23:50:41,261 INFO L272 TraceCheckUtils]: 2: Hoare triple {7086#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {7086#true} is VALID [2022-02-20 23:50:41,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {7086#true} ~size := #in~size; {7086#true} is VALID [2022-02-20 23:50:41,261 INFO L290 TraceCheckUtils]: 4: Hoare triple {7086#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {7086#true} is VALID [2022-02-20 23:50:41,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {7086#true} assume true; {7086#true} is VALID [2022-02-20 23:50:41,261 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7086#true} {7086#true} #118#return; {7086#true} is VALID [2022-02-20 23:50:41,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {7086#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {7086#true} is VALID [2022-02-20 23:50:41,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {7086#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {7086#true} is VALID [2022-02-20 23:50:41,262 INFO L272 TraceCheckUtils]: 9: Hoare triple {7086#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {7086#true} is VALID [2022-02-20 23:50:41,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {7086#true} ~size := #in~size; {7086#true} is VALID [2022-02-20 23:50:41,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {7086#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {7124#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:41,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {7124#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {7124#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:41,263 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {7124#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {7086#true} #120#return; {7131#(and (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:41,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {7131#(and (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {7135#(and (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:41,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {7135#(and (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {7087#false} is VALID [2022-02-20 23:50:41,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {7087#false} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L807 {7087#false} is VALID [2022-02-20 23:50:41,264 INFO L272 TraceCheckUtils]: 17: Hoare triple {7087#false} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {7087#false} is VALID [2022-02-20 23:50:41,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {7087#false} ~size := #in~size; {7087#false} is VALID [2022-02-20 23:50:41,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {7087#false} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {7087#false} is VALID [2022-02-20 23:50:41,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {7087#false} assume true; {7087#false} is VALID [2022-02-20 23:50:41,264 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7087#false} {7087#false} #122#return; {7087#false} is VALID [2022-02-20 23:50:41,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {7087#false} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {7087#false} is VALID [2022-02-20 23:50:41,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {7087#false} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {7087#false} is VALID [2022-02-20 23:50:41,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {7087#false} assume !(1bv1 == #valid[entry_point_~cfg~1#1.base]); {7087#false} is VALID [2022-02-20 23:50:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:41,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:41,264 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:41,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69251529] [2022-02-20 23:50:41,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69251529] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:41,265 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:41,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:41,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708200834] [2022-02-20 23:50:41,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:41,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 23:50:41,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:41,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:41,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:41,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:41,286 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:41,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:41,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:41,286 INFO L87 Difference]: Start difference. First operand 196 states and 275 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:41,595 INFO L93 Difference]: Finished difference Result 153 states and 198 transitions. [2022-02-20 23:50:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:41,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 23:50:41,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-02-20 23:50:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-02-20 23:50:41,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 92 transitions. [2022-02-20 23:50:41,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:41,665 INFO L225 Difference]: With dead ends: 153 [2022-02-20 23:50:41,665 INFO L226 Difference]: Without dead ends: 149 [2022-02-20 23:50:41,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:41,665 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:41,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:50:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-02-20 23:50:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-02-20 23:50:41,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:41,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 149 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 131 states have internal predecessors, (169), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:41,669 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 149 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 131 states have internal predecessors, (169), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:41,669 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 149 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 131 states have internal predecessors, (169), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:41,671 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2022-02-20 23:50:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2022-02-20 23:50:41,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:41,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:41,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 131 states have internal predecessors, (169), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 149 states. [2022-02-20 23:50:41,672 INFO L87 Difference]: Start difference. First operand has 149 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 131 states have internal predecessors, (169), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 149 states. [2022-02-20 23:50:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:41,675 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2022-02-20 23:50:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2022-02-20 23:50:41,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:41,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:41,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:41,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 131 states have internal predecessors, (169), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 194 transitions. [2022-02-20 23:50:41,677 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 194 transitions. Word has length 25 [2022-02-20 23:50:41,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:41,678 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 194 transitions. [2022-02-20 23:50:41,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:41,678 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2022-02-20 23:50:41,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:50:41,678 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:41,678 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:41,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:41,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:41,887 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:50:41,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:41,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2108218693, now seen corresponding path program 1 times [2022-02-20 23:50:41,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:41,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598507030] [2022-02-20 23:50:41,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:41,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:41,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:41,896 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:41,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 23:50:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:41,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:50:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:41,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:42,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {7765#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {7765#true} is VALID [2022-02-20 23:50:42,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {7765#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {7765#true} is VALID [2022-02-20 23:50:42,007 INFO L272 TraceCheckUtils]: 2: Hoare triple {7765#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {7765#true} is VALID [2022-02-20 23:50:42,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {7765#true} ~size := #in~size; {7765#true} is VALID [2022-02-20 23:50:42,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {7765#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {7765#true} is VALID [2022-02-20 23:50:42,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {7765#true} assume true; {7765#true} is VALID [2022-02-20 23:50:42,007 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7765#true} {7765#true} #118#return; {7765#true} is VALID [2022-02-20 23:50:42,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {7765#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {7765#true} is VALID [2022-02-20 23:50:42,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {7765#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {7765#true} is VALID [2022-02-20 23:50:42,008 INFO L272 TraceCheckUtils]: 9: Hoare triple {7765#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {7765#true} is VALID [2022-02-20 23:50:42,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {7765#true} ~size := #in~size; {7765#true} is VALID [2022-02-20 23:50:42,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {7765#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {7765#true} is VALID [2022-02-20 23:50:42,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {7765#true} assume true; {7765#true} is VALID [2022-02-20 23:50:42,009 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {7765#true} {7765#true} #120#return; {7765#true} is VALID [2022-02-20 23:50:42,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {7765#true} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {7765#true} is VALID [2022-02-20 23:50:42,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {7765#true} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {7765#true} is VALID [2022-02-20 23:50:42,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {7765#true} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L807 {7765#true} is VALID [2022-02-20 23:50:42,009 INFO L272 TraceCheckUtils]: 17: Hoare triple {7765#true} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {7765#true} is VALID [2022-02-20 23:50:42,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {7765#true} ~size := #in~size; {7765#true} is VALID [2022-02-20 23:50:42,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {7765#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {7827#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:42,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {7827#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {7827#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:42,010 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7827#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {7765#true} #122#return; {7834#(not (= |ULTIMATE.start_entry_point_#t~ret45#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:42,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {7834#(not (= |ULTIMATE.start_entry_point_#t~ret45#1.base| (_ bv0 32)))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {7838#(not (= |ULTIMATE.start_entry_point_~fe~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:42,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {7838#(not (= |ULTIMATE.start_entry_point_~fe~1#1.base| (_ bv0 32)))} assume entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32; {7766#false} is VALID [2022-02-20 23:50:42,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {7766#false} assume 0bv32 == entry_point_~cfg~1#1.offset; {7766#false} is VALID [2022-02-20 23:50:42,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {7766#false} assume !~bvult32(entry_point_~cfg~1#1.base, #StackHeapBarrier); {7766#false} is VALID [2022-02-20 23:50:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:50:42,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:42,013 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:42,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598507030] [2022-02-20 23:50:42,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598507030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:42,013 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:42,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:42,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329536456] [2022-02-20 23:50:42,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:42,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 23:50:42,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:42,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:50:42,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:42,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:42,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:42,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:42,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:42,029 INFO L87 Difference]: Start difference. First operand 149 states and 194 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:50:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:42,451 INFO L93 Difference]: Finished difference Result 194 states and 237 transitions. [2022-02-20 23:50:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:42,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 23:50:42,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:50:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2022-02-20 23:50:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:50:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2022-02-20 23:50:42,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 153 transitions. [2022-02-20 23:50:42,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:42,565 INFO L225 Difference]: With dead ends: 194 [2022-02-20 23:50:42,565 INFO L226 Difference]: Without dead ends: 194 [2022-02-20 23:50:42,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:42,566 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 54 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:42,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 431 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:50:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-02-20 23:50:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 146. [2022-02-20 23:50:42,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:42,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 146 states, 107 states have (on average 1.5327102803738317) internal successors, (164), 128 states have internal predecessors, (164), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:42,569 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 146 states, 107 states have (on average 1.5327102803738317) internal successors, (164), 128 states have internal predecessors, (164), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:42,569 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 146 states, 107 states have (on average 1.5327102803738317) internal successors, (164), 128 states have internal predecessors, (164), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:42,572 INFO L93 Difference]: Finished difference Result 194 states and 237 transitions. [2022-02-20 23:50:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 237 transitions. [2022-02-20 23:50:42,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:42,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:42,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 107 states have (on average 1.5327102803738317) internal successors, (164), 128 states have internal predecessors, (164), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 194 states. [2022-02-20 23:50:42,573 INFO L87 Difference]: Start difference. First operand has 146 states, 107 states have (on average 1.5327102803738317) internal successors, (164), 128 states have internal predecessors, (164), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 194 states. [2022-02-20 23:50:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:42,575 INFO L93 Difference]: Finished difference Result 194 states and 237 transitions. [2022-02-20 23:50:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 237 transitions. [2022-02-20 23:50:42,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:42,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:42,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:42,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.5327102803738317) internal successors, (164), 128 states have internal predecessors, (164), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2022-02-20 23:50:42,578 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 26 [2022-02-20 23:50:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:42,578 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2022-02-20 23:50:42,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:50:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2022-02-20 23:50:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:50:42,579 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:42,579 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:42,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:42,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:42,785 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:50:42,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:42,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1299244922, now seen corresponding path program 1 times [2022-02-20 23:50:42,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:42,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016879453] [2022-02-20 23:50:42,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:42,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:42,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:42,787 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:42,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-02-20 23:50:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:42,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:42,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:43,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {8575#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {8580#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:43,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {8580#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {8580#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:43,427 INFO L272 TraceCheckUtils]: 2: Hoare triple {8580#(bvult (_ bv0 32) |#StackHeapBarrier|)} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {8580#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:43,428 INFO L290 TraceCheckUtils]: 3: Hoare triple {8580#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {8580#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:43,431 INFO L290 TraceCheckUtils]: 4: Hoare triple {8580#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:43,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} assume true; {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:43,433 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} {8580#(bvult (_ bv0 32) |#StackHeapBarrier|)} #118#return; {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:43,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:43,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:43,438 INFO L272 TraceCheckUtils]: 9: Hoare triple {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:43,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} ~size := #in~size; {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:43,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {8615#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:43,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {8615#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} assume true; {8615#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:43,446 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8615#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} #120#return; {8622#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))) (bvult |ULTIMATE.start_entry_point_#t~ret44#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:50:43,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {8622#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))) (bvult |ULTIMATE.start_entry_point_#t~ret44#1.base| |#StackHeapBarrier|))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {8626#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:43,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {8626#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {8626#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:43,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {8626#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L807 {8626#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:43,457 INFO L272 TraceCheckUtils]: 17: Hoare triple {8626#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:43,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} ~size := #in~size; {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:43,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:43,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} assume true; {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:43,469 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8593#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} {8626#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} #122#return; {8626#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:43,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {8626#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {8626#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:43,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {8626#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} assume entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32; {8626#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:43,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {8626#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} assume 0bv32 == entry_point_~cfg~1#1.offset; {8626#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:43,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {8626#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} assume !~bvult32(entry_point_~cfg~1#1.base, #StackHeapBarrier); {8576#false} is VALID [2022-02-20 23:50:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:50:43,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:43,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {8660#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} assume !~bvult32(entry_point_~cfg~1#1.base, #StackHeapBarrier); {8576#false} is VALID [2022-02-20 23:50:43,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {8660#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} assume 0bv32 == entry_point_~cfg~1#1.offset; {8660#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:43,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {8660#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} assume entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32; {8660#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:43,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {8660#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {8660#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:43,660 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8575#true} {8660#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} #122#return; {8660#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:43,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {8575#true} assume true; {8575#true} is VALID [2022-02-20 23:50:43,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {8575#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {8575#true} is VALID [2022-02-20 23:50:43,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {8575#true} ~size := #in~size; {8575#true} is VALID [2022-02-20 23:50:43,660 INFO L272 TraceCheckUtils]: 17: Hoare triple {8660#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {8575#true} is VALID [2022-02-20 23:50:43,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {8660#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L807 {8660#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:43,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {8660#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {8660#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:43,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {8694#(bvult |ULTIMATE.start_entry_point_#t~ret44#1.base| |#StackHeapBarrier|)} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {8660#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:43,661 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8701#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} {8575#true} #120#return; {8694#(bvult |ULTIMATE.start_entry_point_#t~ret44#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:43,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {8701#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} assume true; {8701#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:43,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {8575#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {8701#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:43,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {8575#true} ~size := #in~size; {8575#true} is VALID [2022-02-20 23:50:43,662 INFO L272 TraceCheckUtils]: 9: Hoare triple {8575#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {8575#true} is VALID [2022-02-20 23:50:43,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {8575#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {8575#true} is VALID [2022-02-20 23:50:43,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {8575#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {8575#true} is VALID [2022-02-20 23:50:43,662 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8575#true} {8575#true} #118#return; {8575#true} is VALID [2022-02-20 23:50:43,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {8575#true} assume true; {8575#true} is VALID [2022-02-20 23:50:43,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {8575#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {8575#true} is VALID [2022-02-20 23:50:43,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {8575#true} ~size := #in~size; {8575#true} is VALID [2022-02-20 23:50:43,662 INFO L272 TraceCheckUtils]: 2: Hoare triple {8575#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {8575#true} is VALID [2022-02-20 23:50:43,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {8575#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {8575#true} is VALID [2022-02-20 23:50:43,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {8575#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {8575#true} is VALID [2022-02-20 23:50:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:50:43,662 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:43,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016879453] [2022-02-20 23:50:43,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016879453] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:50:43,663 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:43,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2022-02-20 23:50:43,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299246323] [2022-02-20 23:50:43,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:43,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-02-20 23:50:43,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:43,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:43,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:43,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:50:43,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:43,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:50:43,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:50:43,732 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:44,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:44,317 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2022-02-20 23:50:44,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:44,317 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-02-20 23:50:44,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2022-02-20 23:50:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2022-02-20 23:50:44,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 135 transitions. [2022-02-20 23:50:44,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:44,455 INFO L225 Difference]: With dead ends: 173 [2022-02-20 23:50:44,455 INFO L226 Difference]: Without dead ends: 173 [2022-02-20 23:50:44,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:50:44,456 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 58 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:44,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 419 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 91 Unchecked, 0.1s Time] [2022-02-20 23:50:44,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-02-20 23:50:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2022-02-20 23:50:44,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:44,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 157 states, 115 states have (on average 1.5130434782608695) internal successors, (174), 137 states have internal predecessors, (174), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:44,459 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 157 states, 115 states have (on average 1.5130434782608695) internal successors, (174), 137 states have internal predecessors, (174), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:44,460 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 157 states, 115 states have (on average 1.5130434782608695) internal successors, (174), 137 states have internal predecessors, (174), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:44,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:44,462 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2022-02-20 23:50:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 209 transitions. [2022-02-20 23:50:44,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:44,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:44,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 115 states have (on average 1.5130434782608695) internal successors, (174), 137 states have internal predecessors, (174), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 173 states. [2022-02-20 23:50:44,463 INFO L87 Difference]: Start difference. First operand has 157 states, 115 states have (on average 1.5130434782608695) internal successors, (174), 137 states have internal predecessors, (174), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 173 states. [2022-02-20 23:50:44,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:44,465 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2022-02-20 23:50:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 209 transitions. [2022-02-20 23:50:44,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:44,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:44,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:44,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.5130434782608695) internal successors, (174), 137 states have internal predecessors, (174), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:44,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 199 transitions. [2022-02-20 23:50:44,467 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 199 transitions. Word has length 26 [2022-02-20 23:50:44,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:44,468 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 199 transitions. [2022-02-20 23:50:44,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 199 transitions. [2022-02-20 23:50:44,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:50:44,468 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:44,468 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:44,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:44,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:44,675 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:50:44,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:44,675 INFO L85 PathProgramCache]: Analyzing trace with hash 930272189, now seen corresponding path program 1 times [2022-02-20 23:50:44,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:44,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680488004] [2022-02-20 23:50:44,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:44,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:44,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:44,677 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:44,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-02-20 23:50:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:44,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:50:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:44,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:44,823 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:50:44,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:50:44,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {9414#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {9414#true} is VALID [2022-02-20 23:50:44,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {9414#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {9414#true} is VALID [2022-02-20 23:50:44,847 INFO L272 TraceCheckUtils]: 2: Hoare triple {9414#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {9414#true} is VALID [2022-02-20 23:50:44,847 INFO L290 TraceCheckUtils]: 3: Hoare triple {9414#true} ~size := #in~size; {9414#true} is VALID [2022-02-20 23:50:44,847 INFO L290 TraceCheckUtils]: 4: Hoare triple {9414#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {9414#true} is VALID [2022-02-20 23:50:44,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {9414#true} assume true; {9414#true} is VALID [2022-02-20 23:50:44,848 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9414#true} {9414#true} #118#return; {9414#true} is VALID [2022-02-20 23:50:44,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {9414#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {9414#true} is VALID [2022-02-20 23:50:44,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {9414#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {9414#true} is VALID [2022-02-20 23:50:44,848 INFO L272 TraceCheckUtils]: 9: Hoare triple {9414#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {9414#true} is VALID [2022-02-20 23:50:44,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {9414#true} ~size := #in~size; {9414#true} is VALID [2022-02-20 23:50:44,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {9414#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {9414#true} is VALID [2022-02-20 23:50:44,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {9414#true} assume true; {9414#true} is VALID [2022-02-20 23:50:44,848 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {9414#true} {9414#true} #120#return; {9414#true} is VALID [2022-02-20 23:50:44,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {9414#true} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {9414#true} is VALID [2022-02-20 23:50:44,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {9414#true} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {9414#true} is VALID [2022-02-20 23:50:44,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {9414#true} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L807 {9467#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:44,849 INFO L272 TraceCheckUtils]: 17: Hoare triple {9467#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {9471#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:44,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {9471#(= |old(#valid)| |#valid|)} ~size := #in~size; {9471#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:44,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {9471#(= |old(#valid)| |#valid|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {9478#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:50:44,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {9478#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} assume true; {9478#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:50:44,851 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9478#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} {9467#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} #122#return; {9467#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:44,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {9467#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {9467#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:44,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {9467#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {9467#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:44,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {9467#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, 4bv32); srcloc: L811 {9467#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:44,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {9467#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume { :begin_inline_alloc_3_11 } true;alloc_3_11_#in~client#1.base, alloc_3_11_#in~client#1.offset := entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset;havoc alloc_3_11_#res#1;havoc alloc_3_11_#t~mem39#1.base, alloc_3_11_#t~mem39#1.offset, alloc_3_11_#t~mem40#1.base, alloc_3_11_#t~mem40#1.offset, alloc_3_11_#t~ret41#1.base, alloc_3_11_#t~ret41#1.offset, alloc_3_11_~client#1.base, alloc_3_11_~client#1.offset, alloc_3_11_~cfg~0#1.base, alloc_3_11_~cfg~0#1.offset, alloc_3_11_~fe~0#1.base, alloc_3_11_~fe~0#1.offset, alloc_3_11_~priv~0#1.base, alloc_3_11_~priv~0#1.offset;alloc_3_11_~client#1.base, alloc_3_11_~client#1.offset := alloc_3_11_#in~client#1.base, alloc_3_11_#in~client#1.offset; {9497#(= (select |#valid| |ULTIMATE.start_alloc_3_11_~client#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:44,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {9497#(= (select |#valid| |ULTIMATE.start_alloc_3_11_~client#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[alloc_3_11_~client#1.base]); {9415#false} is VALID [2022-02-20 23:50:44,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:50:44,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:44,853 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:44,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680488004] [2022-02-20 23:50:44,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680488004] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:44,853 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:44,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:44,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187108242] [2022-02-20 23:50:44,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:44,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-02-20 23:50:44,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:44,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:44,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:44,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:44,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:44,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:44,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:44,873 INFO L87 Difference]: Start difference. First operand 157 states and 199 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,596 INFO L93 Difference]: Finished difference Result 174 states and 211 transitions. [2022-02-20 23:50:45,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:45,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-02-20 23:50:45,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2022-02-20 23:50:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2022-02-20 23:50:45,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 126 transitions. [2022-02-20 23:50:45,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:45,717 INFO L225 Difference]: With dead ends: 174 [2022-02-20 23:50:45,717 INFO L226 Difference]: Without dead ends: 174 [2022-02-20 23:50:45,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:50:45,718 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 82 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:45,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 306 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 129 Invalid, 0 Unknown, 61 Unchecked, 0.2s Time] [2022-02-20 23:50:45,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-02-20 23:50:45,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 156. [2022-02-20 23:50:45,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:45,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 156 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 136 states have internal predecessors, (172), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:45,721 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 156 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 136 states have internal predecessors, (172), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:45,721 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 156 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 136 states have internal predecessors, (172), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,723 INFO L93 Difference]: Finished difference Result 174 states and 211 transitions. [2022-02-20 23:50:45,723 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 211 transitions. [2022-02-20 23:50:45,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:45,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:45,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 136 states have internal predecessors, (172), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 174 states. [2022-02-20 23:50:45,724 INFO L87 Difference]: Start difference. First operand has 156 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 136 states have internal predecessors, (172), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 174 states. [2022-02-20 23:50:45,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,727 INFO L93 Difference]: Finished difference Result 174 states and 211 transitions. [2022-02-20 23:50:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 211 transitions. [2022-02-20 23:50:45,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:45,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:45,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:45,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 136 states have internal predecessors, (172), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 197 transitions. [2022-02-20 23:50:45,729 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 197 transitions. Word has length 27 [2022-02-20 23:50:45,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:45,730 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 197 transitions. [2022-02-20 23:50:45,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 197 transitions. [2022-02-20 23:50:45,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:50:45,730 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:45,730 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:45,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:45,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:45,948 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:50:45,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:45,948 INFO L85 PathProgramCache]: Analyzing trace with hash 930272190, now seen corresponding path program 1 times [2022-02-20 23:50:45,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:45,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513963669] [2022-02-20 23:50:45,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:45,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:45,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:45,950 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:45,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-02-20 23:50:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:46,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 23:50:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:46,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:46,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:50:46,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:50:48,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:48,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:48,237 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:48,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:50:50,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:50,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:50,369 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:50,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:50:50,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {10180#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {10180#true} is VALID [2022-02-20 23:50:50,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {10180#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {10180#true} is VALID [2022-02-20 23:50:50,422 INFO L272 TraceCheckUtils]: 2: Hoare triple {10180#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {10180#true} is VALID [2022-02-20 23:50:50,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {10180#true} ~size := #in~size; {10194#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:50,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {10194#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {10198#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:50,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {10198#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {10198#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:50,424 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10198#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {10180#true} #118#return; {10205#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:50,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {10205#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:50,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:50,426 INFO L272 TraceCheckUtils]: 9: Hoare triple {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:50,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:50,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {10223#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:50,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {10223#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {10223#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:50,429 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {10223#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} #120#return; {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:50,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:50,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:50,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L807 {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:50,431 INFO L272 TraceCheckUtils]: 17: Hoare triple {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:50,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:50,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {10223#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:50,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {10223#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {10223#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:50,433 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10223#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} #122#return; {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:50,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:50,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:50,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, 4bv32); srcloc: L811 {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:50,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume { :begin_inline_alloc_3_11 } true;alloc_3_11_#in~client#1.base, alloc_3_11_#in~client#1.offset := entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset;havoc alloc_3_11_#res#1;havoc alloc_3_11_#t~mem39#1.base, alloc_3_11_#t~mem39#1.offset, alloc_3_11_#t~mem40#1.base, alloc_3_11_#t~mem40#1.offset, alloc_3_11_#t~ret41#1.base, alloc_3_11_#t~ret41#1.offset, alloc_3_11_~client#1.base, alloc_3_11_~client#1.offset, alloc_3_11_~cfg~0#1.base, alloc_3_11_~cfg~0#1.offset, alloc_3_11_~fe~0#1.base, alloc_3_11_~fe~0#1.offset, alloc_3_11_~priv~0#1.base, alloc_3_11_~priv~0#1.offset;alloc_3_11_~client#1.base, alloc_3_11_~client#1.offset := alloc_3_11_#in~client#1.base, alloc_3_11_#in~client#1.offset; {10267#(and (= |ULTIMATE.start_alloc_3_11_~client#1.offset| (_ bv0 32)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_alloc_3_11_~client#1.base|)))} is VALID [2022-02-20 23:50:50,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {10267#(and (= |ULTIMATE.start_alloc_3_11_~client#1.offset| (_ bv0 32)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_alloc_3_11_~client#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, alloc_3_11_~client#1.offset), #length[alloc_3_11_~client#1.base]) && ~bvule32(alloc_3_11_~client#1.offset, ~bvadd32(4bv32, alloc_3_11_~client#1.offset))) && ~bvule32(0bv32, alloc_3_11_~client#1.offset)); {10181#false} is VALID [2022-02-20 23:50:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:50:50,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:50,746 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:50,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513963669] [2022-02-20 23:50:50,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513963669] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:50,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [354758108] [2022-02-20 23:50:50,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:50,747 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:50,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:50:50,748 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:50:50,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-02-20 23:50:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:50,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 23:50:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:50,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:50,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:50:50,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:50:51,038 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:51,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:50:51,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:53,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:53,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:53,191 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:53,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:50:53,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {10180#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {10180#true} is VALID [2022-02-20 23:50:53,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {10180#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {10180#true} is VALID [2022-02-20 23:50:53,230 INFO L272 TraceCheckUtils]: 2: Hoare triple {10180#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {10180#true} is VALID [2022-02-20 23:50:53,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {10180#true} ~size := #in~size; {10194#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:53,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {10194#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {10198#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:53,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {10198#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {10198#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:53,232 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10198#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {10180#true} #118#return; {10205#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:53,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {10205#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:53,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:53,233 INFO L272 TraceCheckUtils]: 9: Hoare triple {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:53,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:53,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {10325#(and (exists ((v_ArrVal_202 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_202))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:50:53,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {10325#(and (exists ((v_ArrVal_202 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_202))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} assume true; {10325#(and (exists ((v_ArrVal_202 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_202))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:50:53,236 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {10325#(and (exists ((v_ArrVal_202 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_202))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} #120#return; {10332#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:53,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {10332#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:53,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:53,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L807 {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:53,238 INFO L272 TraceCheckUtils]: 17: Hoare triple {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:53,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:53,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {10216#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {10223#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:53,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {10223#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {10223#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:53,241 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10223#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {10209#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} #122#return; {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:53,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:53,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:53,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, 4bv32); srcloc: L811 {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:53,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {10230#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume { :begin_inline_alloc_3_11 } true;alloc_3_11_#in~client#1.base, alloc_3_11_#in~client#1.offset := entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset;havoc alloc_3_11_#res#1;havoc alloc_3_11_#t~mem39#1.base, alloc_3_11_#t~mem39#1.offset, alloc_3_11_#t~mem40#1.base, alloc_3_11_#t~mem40#1.offset, alloc_3_11_#t~ret41#1.base, alloc_3_11_#t~ret41#1.offset, alloc_3_11_~client#1.base, alloc_3_11_~client#1.offset, alloc_3_11_~cfg~0#1.base, alloc_3_11_~cfg~0#1.offset, alloc_3_11_~fe~0#1.base, alloc_3_11_~fe~0#1.offset, alloc_3_11_~priv~0#1.base, alloc_3_11_~priv~0#1.offset;alloc_3_11_~client#1.base, alloc_3_11_~client#1.offset := alloc_3_11_#in~client#1.base, alloc_3_11_#in~client#1.offset; {10267#(and (= |ULTIMATE.start_alloc_3_11_~client#1.offset| (_ bv0 32)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_alloc_3_11_~client#1.base|)))} is VALID [2022-02-20 23:50:53,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {10267#(and (= |ULTIMATE.start_alloc_3_11_~client#1.offset| (_ bv0 32)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_alloc_3_11_~client#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, alloc_3_11_~client#1.offset), #length[alloc_3_11_~client#1.base]) && ~bvule32(alloc_3_11_~client#1.offset, ~bvadd32(4bv32, alloc_3_11_~client#1.offset))) && ~bvule32(0bv32, alloc_3_11_~client#1.offset)); {10181#false} is VALID [2022-02-20 23:50:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:53,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:55,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [354758108] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:55,477 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:55,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 11 [2022-02-20 23:50:55,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32779221] [2022-02-20 23:50:55,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:55,477 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-02-20 23:50:55,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:55,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:55,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:55,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:50:55,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:55,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:50:55,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=174, Unknown=1, NotChecked=0, Total=210 [2022-02-20 23:50:55,504 INFO L87 Difference]: Start difference. First operand 156 states and 197 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:00,061 INFO L93 Difference]: Finished difference Result 201 states and 220 transitions. [2022-02-20 23:51:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:51:00,061 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-02-20 23:51:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2022-02-20 23:51:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2022-02-20 23:51:00,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 193 transitions. [2022-02-20 23:51:00,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:00,250 INFO L225 Difference]: With dead ends: 201 [2022-02-20 23:51:00,250 INFO L226 Difference]: Without dead ends: 201 [2022-02-20 23:51:00,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=60, Invalid=280, Unknown=2, NotChecked=0, Total=342 [2022-02-20 23:51:00,251 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 196 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:00,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 724 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 490 Invalid, 0 Unknown, 75 Unchecked, 0.7s Time] [2022-02-20 23:51:00,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-02-20 23:51:00,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 127. [2022-02-20 23:51:00,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:00,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 127 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 110 states have internal predecessors, (131), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-20 23:51:00,253 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 127 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 110 states have internal predecessors, (131), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-20 23:51:00,253 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 127 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 110 states have internal predecessors, (131), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-20 23:51:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:00,257 INFO L93 Difference]: Finished difference Result 201 states and 220 transitions. [2022-02-20 23:51:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 220 transitions. [2022-02-20 23:51:00,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:00,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:00,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 110 states have internal predecessors, (131), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 201 states. [2022-02-20 23:51:00,258 INFO L87 Difference]: Start difference. First operand has 127 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 110 states have internal predecessors, (131), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 201 states. [2022-02-20 23:51:00,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:00,263 INFO L93 Difference]: Finished difference Result 201 states and 220 transitions. [2022-02-20 23:51:00,263 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 220 transitions. [2022-02-20 23:51:00,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:00,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:00,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:00,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 110 states have internal predecessors, (131), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-20 23:51:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 149 transitions. [2022-02-20 23:51:00,265 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 149 transitions. Word has length 27 [2022-02-20 23:51:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:00,265 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 149 transitions. [2022-02-20 23:51:00,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 149 transitions. [2022-02-20 23:51:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:51:00,266 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:00,266 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:00,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:00,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:00,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:00,669 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2022-02-20 23:51:00,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:00,669 INFO L85 PathProgramCache]: Analyzing trace with hash 638376382, now seen corresponding path program 1 times [2022-02-20 23:51:00,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:00,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500278257] [2022-02-20 23:51:00,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:00,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:00,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:00,671 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:00,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-02-20 23:51:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:00,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 23:51:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:00,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:00,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:51:00,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:51:00,992 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-02-20 23:51:00,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2022-02-20 23:51:01,114 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:51:01,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2022-02-20 23:51:01,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {11127#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {11127#true} is VALID [2022-02-20 23:51:01,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {11127#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {11127#true} is VALID [2022-02-20 23:51:01,290 INFO L272 TraceCheckUtils]: 2: Hoare triple {11127#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {11127#true} is VALID [2022-02-20 23:51:01,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {11127#true} ~size := #in~size; {11127#true} is VALID [2022-02-20 23:51:01,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {11127#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {11144#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:01,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {11144#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {11144#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:01,292 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {11144#(= |ldv_malloc_#res.offset| (_ bv0 32))} {11127#true} #118#return; {11151#(= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|)} is VALID [2022-02-20 23:51:01,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {11151#(= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|)} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {11155#(= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:01,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {11155#(= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {11155#(= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:01,292 INFO L272 TraceCheckUtils]: 9: Hoare triple {11155#(= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {11127#true} is VALID [2022-02-20 23:51:01,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {11127#true} ~size := #in~size; {11127#true} is VALID [2022-02-20 23:51:01,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {11127#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {11144#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:01,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {11144#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {11144#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:01,294 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11144#(= |ldv_malloc_#res.offset| (_ bv0 32))} {11155#(= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32))} #120#return; {11174#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:01,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {11174#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {11178#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:01,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {11178#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {11178#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:01,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {11178#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L807 {11185#(and (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:01,295 INFO L272 TraceCheckUtils]: 17: Hoare triple {11185#(and (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {11127#true} is VALID [2022-02-20 23:51:01,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {11127#true} ~size := #in~size; {11127#true} is VALID [2022-02-20 23:51:01,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {11127#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {11195#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:51:01,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {11195#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {11195#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:51:01,297 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11195#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {11185#(and (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} #122#return; {11202#(and (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret45#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:51:01,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {11202#(and (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret45#1.base|) (_ bv1 1)))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {11206#(and (= (select |#valid| |ULTIMATE.start_entry_point_~fe~1#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:01,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {11206#(and (= (select |#valid| |ULTIMATE.start_entry_point_~fe~1#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {11206#(and (= (select |#valid| |ULTIMATE.start_entry_point_~fe~1#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:01,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {11206#(and (= (select |#valid| |ULTIMATE.start_entry_point_~fe~1#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, 4bv32); srcloc: L811 {11213#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (or (and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv0 32))) (_ bv1 1))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (_ bv0 32))) (_ bv1 1)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|))))))} is VALID [2022-02-20 23:51:01,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {11213#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (or (and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv0 32))) (_ bv1 1))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (_ bv0 32))) (_ bv1 1)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|))))))} assume { :begin_inline_alloc_3_11 } true;alloc_3_11_#in~client#1.base, alloc_3_11_#in~client#1.offset := entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset;havoc alloc_3_11_#res#1;havoc alloc_3_11_#t~mem39#1.base, alloc_3_11_#t~mem39#1.offset, alloc_3_11_#t~mem40#1.base, alloc_3_11_#t~mem40#1.offset, alloc_3_11_#t~ret41#1.base, alloc_3_11_#t~ret41#1.offset, alloc_3_11_~client#1.base, alloc_3_11_~client#1.offset, alloc_3_11_~cfg~0#1.base, alloc_3_11_~cfg~0#1.offset, alloc_3_11_~fe~0#1.base, alloc_3_11_~fe~0#1.offset, alloc_3_11_~priv~0#1.base, alloc_3_11_~priv~0#1.offset;alloc_3_11_~client#1.base, alloc_3_11_~client#1.offset := alloc_3_11_#in~client#1.base, alloc_3_11_#in~client#1.offset; {11217#(and (or (and (= (select |#valid| |ULTIMATE.start_alloc_3_11_~client#1.base|) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_3_11_~client#1.base|) (_ bv0 32))) (_ bv1 1))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_3_11_~client#1.base|) |ULTIMATE.start_alloc_3_11_~client#1.offset|)) (_ bv0 32))) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_3_11_~client#1.base|) |ULTIMATE.start_alloc_3_11_~client#1.offset|)) (_ bv1 1)))) (= |ULTIMATE.start_alloc_3_11_~client#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:01,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {11217#(and (or (and (= (select |#valid| |ULTIMATE.start_alloc_3_11_~client#1.base|) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_3_11_~client#1.base|) (_ bv0 32))) (_ bv1 1))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_3_11_~client#1.base|) |ULTIMATE.start_alloc_3_11_~client#1.offset|)) (_ bv0 32))) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_3_11_~client#1.base|) |ULTIMATE.start_alloc_3_11_~client#1.offset|)) (_ bv1 1)))) (= |ULTIMATE.start_alloc_3_11_~client#1.offset| (_ bv0 32)))} SUMMARY for call alloc_3_11_#t~mem39#1.base, alloc_3_11_#t~mem39#1.offset := read~$Pointer$(alloc_3_11_~client#1.base, alloc_3_11_~client#1.offset, 4bv32); srcloc: L784 {11221#(exists ((|ULTIMATE.start_alloc_3_11_~client#1.base| (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (and (or (not (= |ULTIMATE.start_alloc_3_11_~client#1.base| |ULTIMATE.start_alloc_3_11_#t~mem39#1.base|)) (= |ULTIMATE.start_alloc_3_11_#t~mem39#1.base| v_arrayElimCell_28)) (or (and (= (select |#valid| |ULTIMATE.start_alloc_3_11_#t~mem39#1.base|) (_ bv1 1)) (= (select |#valid| |ULTIMATE.start_alloc_3_11_~client#1.base|) (_ bv1 1))) (and (= (select |#valid| |ULTIMATE.start_alloc_3_11_#t~mem39#1.base|) (_ bv1 1)) (= (_ bv1 1) (select |#valid| v_arrayElimCell_28))))))} is VALID [2022-02-20 23:51:01,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {11221#(exists ((|ULTIMATE.start_alloc_3_11_~client#1.base| (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (and (or (not (= |ULTIMATE.start_alloc_3_11_~client#1.base| |ULTIMATE.start_alloc_3_11_#t~mem39#1.base|)) (= |ULTIMATE.start_alloc_3_11_#t~mem39#1.base| v_arrayElimCell_28)) (or (and (= (select |#valid| |ULTIMATE.start_alloc_3_11_#t~mem39#1.base|) (_ bv1 1)) (= (select |#valid| |ULTIMATE.start_alloc_3_11_~client#1.base|) (_ bv1 1))) (and (= (select |#valid| |ULTIMATE.start_alloc_3_11_#t~mem39#1.base|) (_ bv1 1)) (= (_ bv1 1) (select |#valid| v_arrayElimCell_28))))))} alloc_3_11_~cfg~0#1.base, alloc_3_11_~cfg~0#1.offset := alloc_3_11_#t~mem39#1.base, alloc_3_11_#t~mem39#1.offset;havoc alloc_3_11_#t~mem39#1.base, alloc_3_11_#t~mem39#1.offset; {11225#(exists ((|ULTIMATE.start_alloc_3_11_~client#1.base| (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (and (or (= v_arrayElimCell_28 |ULTIMATE.start_alloc_3_11_~cfg~0#1.base|) (not (= |ULTIMATE.start_alloc_3_11_~client#1.base| |ULTIMATE.start_alloc_3_11_~cfg~0#1.base|))) (or (and (= (_ bv1 1) (select |#valid| v_arrayElimCell_28)) (= (select |#valid| |ULTIMATE.start_alloc_3_11_~cfg~0#1.base|) (_ bv1 1))) (and (= (select |#valid| |ULTIMATE.start_alloc_3_11_~client#1.base|) (_ bv1 1)) (= (select |#valid| |ULTIMATE.start_alloc_3_11_~cfg~0#1.base|) (_ bv1 1))))))} is VALID [2022-02-20 23:51:01,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {11225#(exists ((|ULTIMATE.start_alloc_3_11_~client#1.base| (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (and (or (= v_arrayElimCell_28 |ULTIMATE.start_alloc_3_11_~cfg~0#1.base|) (not (= |ULTIMATE.start_alloc_3_11_~client#1.base| |ULTIMATE.start_alloc_3_11_~cfg~0#1.base|))) (or (and (= (_ bv1 1) (select |#valid| v_arrayElimCell_28)) (= (select |#valid| |ULTIMATE.start_alloc_3_11_~cfg~0#1.base|) (_ bv1 1))) (and (= (select |#valid| |ULTIMATE.start_alloc_3_11_~client#1.base|) (_ bv1 1)) (= (select |#valid| |ULTIMATE.start_alloc_3_11_~cfg~0#1.base|) (_ bv1 1))))))} assume !(1bv1 == #valid[alloc_3_11_~cfg~0#1.base]); {11128#false} is VALID [2022-02-20 23:51:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:51:01,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:01,534 INFO L356 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-02-20 23:51:01,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 64 [2022-02-20 23:51:01,590 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:01,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500278257] [2022-02-20 23:51:01,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500278257] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:51:01,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [991367922] [2022-02-20 23:51:01,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:01,590 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:51:01,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:51:01,592 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:51:01,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-02-20 23:51:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:01,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:51:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:01,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:01,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:51:01,890 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:51:01,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:51:01,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7