./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:47:01,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:47:01,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:47:01,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:47:01,474 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:47:01,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:47:01,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:47:01,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:47:01,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:47:01,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:47:01,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:47:01,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:47:01,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:47:01,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:47:01,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:47:01,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:47:01,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:47:01,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:47:01,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:47:01,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:47:01,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:47:01,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:47:01,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:47:01,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:47:01,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:47:01,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:47:01,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:47:01,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:47:01,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:47:01,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:47:01,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:47:01,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:47:01,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:47:01,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:47:01,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:47:01,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:47:01,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:47:01,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:47:01,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:47:01,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:47:01,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:47:01,530 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:47:01,565 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:47:01,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:47:01,566 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:47:01,566 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:47:01,567 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:47:01,567 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:47:01,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:47:01,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:47:01,568 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:47:01,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:47:01,569 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:47:01,569 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:47:01,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:47:01,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:47:01,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:47:01,570 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:47:01,570 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:47:01,570 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:47:01,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:47:01,571 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:47:01,571 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:47:01,571 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:47:01,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:47:01,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:47:01,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:47:01,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:01,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:47:01,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:47:01,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:47:01,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:47:01,573 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 -> 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 [2022-02-20 23:47:01,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:47:01,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:47:01,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:47:01,855 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:47:01,859 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:47:01,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2022-02-20 23:47:01,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6841590b1/6b306901e2374d6a894fc6a8d4a1bd6d/FLAG771d5797d [2022-02-20 23:47:02,351 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:47:02,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2022-02-20 23:47:02,370 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6841590b1/6b306901e2374d6a894fc6a8d4a1bd6d/FLAG771d5797d [2022-02-20 23:47:02,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6841590b1/6b306901e2374d6a894fc6a8d4a1bd6d [2022-02-20 23:47:02,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:47:02,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:47:02,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:02,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:47:02,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:47:02,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:02" (1/1) ... [2022-02-20 23:47:02,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4853ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:02, skipping insertion in model container [2022-02-20 23:47:02,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:02" (1/1) ... [2022-02-20 23:47:02,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:47:02,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:47:02,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:03,012 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:47:03,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@bae196a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:03, skipping insertion in model container [2022-02-20 23:47:03,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:03,014 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:47:03,017 INFO L158 Benchmark]: Toolchain (without parser) took 330.51ms. Allocated memory is still 86.0MB. Free memory was 63.8MB in the beginning and 58.8MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:47:03,018 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 86.0MB. Free memory was 62.8MB in the beginning and 62.7MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:47:03,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.85ms. Allocated memory is still 86.0MB. Free memory was 63.5MB in the beginning and 58.8MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:47:03,020 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.21ms. Allocated memory is still 86.0MB. Free memory was 62.8MB in the beginning and 62.7MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.85ms. Allocated memory is still 86.0MB. Free memory was 63.5MB in the beginning and 58.8MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: 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/memsafety-ext2/complex_data_creation_test02-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:47:04,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:47:04,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:47:04,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:47:04,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:47:04,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:47:04,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:47:04,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:47:04,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:47:04,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:47:04,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:47:04,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:47:04,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:47:04,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:47:04,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:47:04,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:47:04,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:47:04,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:47:04,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:47:04,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:47:04,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:47:04,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:47:04,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:47:04,789 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:47:04,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:47:04,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:47:04,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:47:04,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:47:04,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:47:04,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:47:04,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:47:04,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:47:04,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:47:04,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:47:04,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:47:04,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:47:04,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:47:04,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:47:04,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:47:04,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:47:04,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:47:04,808 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:47:04,842 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:47:04,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:47:04,844 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:47:04,844 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:47:04,845 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:47:04,845 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:47:04,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:47:04,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:47:04,846 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:47:04,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:47:04,847 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:47:04,848 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:47:04,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:47:04,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:47:04,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:47:04,849 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:47:04,849 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:47:04,849 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:47:04,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:47:04,849 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:47:04,850 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:47:04,850 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:47:04,850 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:47:04,850 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:47:04,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:47:04,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:47:04,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:47:04,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:04,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:47:04,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:47:04,852 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:47:04,852 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:47:04,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:47:04,853 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 -> 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 [2022-02-20 23:47:05,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:47:05,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:47:05,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:47:05,179 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:47:05,181 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:47:05,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2022-02-20 23:47:05,242 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be19bd4fd/427698eb79e449e780e23347cac8325b/FLAG112cd1aa6 [2022-02-20 23:47:05,692 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:47:05,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2022-02-20 23:47:05,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be19bd4fd/427698eb79e449e780e23347cac8325b/FLAG112cd1aa6 [2022-02-20 23:47:06,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be19bd4fd/427698eb79e449e780e23347cac8325b [2022-02-20 23:47:06,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:47:06,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:47:06,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:06,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:47:06,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:47:06,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:06" (1/1) ... [2022-02-20 23:47:06,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e4671a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:06, skipping insertion in model container [2022-02-20 23:47:06,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:06" (1/1) ... [2022-02-20 23:47:06,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:47:06,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:47:06,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:06,438 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:47:06,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:47:06,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:06,493 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:47:06,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:06,589 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:47:06,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:06 WrapperNode [2022-02-20 23:47:06,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:06,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:47:06,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:47:06,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:47:06,597 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:47:06" (1/1) ... [2022-02-20 23:47:06,621 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:47:06" (1/1) ... [2022-02-20 23:47:06,645 INFO L137 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-02-20 23:47:06,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:47:06,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:47:06,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:47:06,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:47:06,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:06" (1/1) ... [2022-02-20 23:47:06,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:06" (1/1) ... [2022-02-20 23:47:06,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:06" (1/1) ... [2022-02-20 23:47:06,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:06" (1/1) ... [2022-02-20 23:47:06,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:06" (1/1) ... [2022-02-20 23:47:06,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:06" (1/1) ... [2022-02-20 23:47:06,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:06" (1/1) ... [2022-02-20 23:47:06,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:47:06,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:47:06,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:47:06,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:47:06,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:06" (1/1) ... [2022-02-20 23:47:06,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:06,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:06,774 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:47:06,780 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:47:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:47:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:47:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2022-02-20 23:47:06,804 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2022-02-20 23:47:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:47:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:47:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:47:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:47:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:47:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:47:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:47:06,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:47:06,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:47:06,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:47:06,953 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:47:06,955 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:47:07,770 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:47:07,777 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:47:07,777 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 23:47:07,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:07 BoogieIcfgContainer [2022-02-20 23:47:07,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:47:07,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:47:07,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:47:07,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:47:07,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:47:06" (1/3) ... [2022-02-20 23:47:07,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c4aecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:07, skipping insertion in model container [2022-02-20 23:47:07,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:06" (2/3) ... [2022-02-20 23:47:07,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c4aecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:07, skipping insertion in model container [2022-02-20 23:47:07,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:07" (3/3) ... [2022-02-20 23:47:07,789 INFO L111 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-1.i [2022-02-20 23:47:07,793 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:47:07,793 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2022-02-20 23:47:07,843 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:47:07,850 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:47:07,851 INFO L340 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2022-02-20 23:47:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 94 states have (on average 2.148936170212766) internal successors, (202), 186 states have internal predecessors, (202), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:07,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:47:07,888 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:07,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:47:07,888 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:07,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash 5083689, now seen corresponding path program 1 times [2022-02-20 23:47:07,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:07,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600284893] [2022-02-20 23:47:07,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:07,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:07,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:07,909 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:47:07,946 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:47:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:07,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 23:47:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:08,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:08,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {193#true} is VALID [2022-02-20 23:47:08,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {193#true} is VALID [2022-02-20 23:47:08,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {193#true} assume !true; {194#false} is VALID [2022-02-20 23:47:08,052 INFO L290 TraceCheckUtils]: 3: Hoare triple {194#false} assume !(1bv1 == #valid[main_~#list~0#1.base]); {194#false} is VALID [2022-02-20 23:47:08,054 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:47:08,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:08,055 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:08,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600284893] [2022-02-20 23:47:08,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600284893] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:08,056 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:08,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:08,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715988605] [2022-02-20 23:47:08,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:08,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:47:08,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:08,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:08,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:47:08,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:08,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:47:08,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:47:08,117 INFO L87 Difference]: Start difference. First operand has 190 states, 94 states have (on average 2.148936170212766) internal successors, (202), 186 states have internal predecessors, (202), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:08,494 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2022-02-20 23:47:08,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:47:08,494 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:47:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 206 transitions. [2022-02-20 23:47:08,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 206 transitions. [2022-02-20 23:47:08,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 206 transitions. [2022-02-20 23:47:08,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:08,827 INFO L225 Difference]: With dead ends: 190 [2022-02-20 23:47:08,830 INFO L226 Difference]: Without dead ends: 188 [2022-02-20 23:47:08,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:47:08,835 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:08,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-02-20 23:47:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-02-20 23:47:08,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:08,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 188 states, 93 states have (on average 2.096774193548387) internal successors, (195), 184 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:08,878 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 188 states, 93 states have (on average 2.096774193548387) internal successors, (195), 184 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:08,879 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 188 states, 93 states have (on average 2.096774193548387) internal successors, (195), 184 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:08,891 INFO L93 Difference]: Finished difference Result 188 states and 199 transitions. [2022-02-20 23:47:08,891 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 199 transitions. [2022-02-20 23:47:08,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:08,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:08,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 93 states have (on average 2.096774193548387) internal successors, (195), 184 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 188 states. [2022-02-20 23:47:08,895 INFO L87 Difference]: Start difference. First operand has 188 states, 93 states have (on average 2.096774193548387) internal successors, (195), 184 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 188 states. [2022-02-20 23:47:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:08,905 INFO L93 Difference]: Finished difference Result 188 states and 199 transitions. [2022-02-20 23:47:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 199 transitions. [2022-02-20 23:47:08,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:08,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:08,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:08,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 93 states have (on average 2.096774193548387) internal successors, (195), 184 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 199 transitions. [2022-02-20 23:47:08,918 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 199 transitions. Word has length 4 [2022-02-20 23:47:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:08,918 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 199 transitions. [2022-02-20 23:47:08,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 199 transitions. [2022-02-20 23:47:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:47:08,919 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:08,919 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:47:08,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:09,128 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:47:09,128 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:09,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:09,129 INFO L85 PathProgramCache]: Analyzing trace with hash 5081478, now seen corresponding path program 1 times [2022-02-20 23:47:09,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:09,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795128231] [2022-02-20 23:47:09,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:09,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:09,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:09,131 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:47:09,133 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:47:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:09,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:47:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:09,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:09,252 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:47:09,259 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:47:09,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:09,353 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:47:09,372 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:09,376 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 11 treesize of output 11 [2022-02-20 23:47:09,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {960#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {960#true} is VALID [2022-02-20 23:47:09,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {960#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {968#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} is VALID [2022-02-20 23:47:09,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {968#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {972#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} is VALID [2022-02-20 23:47:09,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {972#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, append_~pointerToList#1.offset), #length[append_~pointerToList#1.base]) && ~bvule32(append_~pointerToList#1.offset, ~bvadd32(4bv32, append_~pointerToList#1.offset))) && ~bvule32(0bv32, append_~pointerToList#1.offset)); {961#false} is VALID [2022-02-20 23:47:09,404 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:47:09,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:09,404 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:09,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795128231] [2022-02-20 23:47:09,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795128231] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:09,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:09,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:09,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228004568] [2022-02-20 23:47:09,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:09,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:47:09,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:09,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:09,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:09,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:09,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:09,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:09,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:09,416 INFO L87 Difference]: Start difference. First operand 188 states and 199 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:11,000 INFO L93 Difference]: Finished difference Result 206 states and 220 transitions. [2022-02-20 23:47:11,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:47:11,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:47:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-02-20 23:47:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-02-20 23:47:11,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 222 transitions. [2022-02-20 23:47:11,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:11,263 INFO L225 Difference]: With dead ends: 206 [2022-02-20 23:47:11,264 INFO L226 Difference]: Without dead ends: 206 [2022-02-20 23:47:11,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:11,265 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 32 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:11,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 355 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:47:11,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-02-20 23:47:11,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 193. [2022-02-20 23:47:11,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:11,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 193 states, 98 states have (on average 2.0816326530612246) internal successors, (204), 189 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:11,275 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 193 states, 98 states have (on average 2.0816326530612246) internal successors, (204), 189 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:11,275 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 193 states, 98 states have (on average 2.0816326530612246) internal successors, (204), 189 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:11,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:11,287 INFO L93 Difference]: Finished difference Result 206 states and 220 transitions. [2022-02-20 23:47:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 220 transitions. [2022-02-20 23:47:11,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:11,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:11,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 98 states have (on average 2.0816326530612246) internal successors, (204), 189 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 206 states. [2022-02-20 23:47:11,290 INFO L87 Difference]: Start difference. First operand has 193 states, 98 states have (on average 2.0816326530612246) internal successors, (204), 189 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 206 states. [2022-02-20 23:47:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:11,302 INFO L93 Difference]: Finished difference Result 206 states and 220 transitions. [2022-02-20 23:47:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 220 transitions. [2022-02-20 23:47:11,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:11,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:11,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:11,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 98 states have (on average 2.0816326530612246) internal successors, (204), 189 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 208 transitions. [2022-02-20 23:47:11,314 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 208 transitions. Word has length 4 [2022-02-20 23:47:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:11,314 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 208 transitions. [2022-02-20 23:47:11,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,315 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 208 transitions. [2022-02-20 23:47:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:47:11,315 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:11,315 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:47:11,330 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:47:11,524 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:47:11,524 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:11,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash 5081477, now seen corresponding path program 1 times [2022-02-20 23:47:11,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:11,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161225801] [2022-02-20 23:47:11,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:11,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:11,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:11,527 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:47:11,529 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:47:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:11,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:47:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:11,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:11,600 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:47:11,652 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:47:11,653 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:47:11,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {1788#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {1788#true} is VALID [2022-02-20 23:47:11,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {1788#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {1796#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:11,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {1796#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {1800#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:47:11,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {1800#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[append_~pointerToList#1.base]); {1789#false} is VALID [2022-02-20 23:47:11,681 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:47:11,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:11,681 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:11,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161225801] [2022-02-20 23:47:11,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161225801] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:11,684 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:11,684 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:11,684 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179545141] [2022-02-20 23:47:11,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:11,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:47:11,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:11,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:11,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:11,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:11,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:11,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:11,696 INFO L87 Difference]: Start difference. First operand 193 states and 208 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:12,815 INFO L93 Difference]: Finished difference Result 212 states and 226 transitions. [2022-02-20 23:47:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:12,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:47:12,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2022-02-20 23:47:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2022-02-20 23:47:12,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 229 transitions. [2022-02-20 23:47:13,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:13,064 INFO L225 Difference]: With dead ends: 212 [2022-02-20 23:47:13,064 INFO L226 Difference]: Without dead ends: 212 [2022-02-20 23:47:13,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:13,066 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 149 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:13,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 290 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-02-20 23:47:13,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 187. [2022-02-20 23:47:13,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:13,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 187 states, 98 states have (on average 2.0) internal successors, (196), 183 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:13,078 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 187 states, 98 states have (on average 2.0) internal successors, (196), 183 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:13,079 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 187 states, 98 states have (on average 2.0) internal successors, (196), 183 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:13,085 INFO L93 Difference]: Finished difference Result 212 states and 226 transitions. [2022-02-20 23:47:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 226 transitions. [2022-02-20 23:47:13,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:13,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:13,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 98 states have (on average 2.0) internal successors, (196), 183 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 212 states. [2022-02-20 23:47:13,087 INFO L87 Difference]: Start difference. First operand has 187 states, 98 states have (on average 2.0) internal successors, (196), 183 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 212 states. [2022-02-20 23:47:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:13,093 INFO L93 Difference]: Finished difference Result 212 states and 226 transitions. [2022-02-20 23:47:13,093 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 226 transitions. [2022-02-20 23:47:13,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:13,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:13,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:13,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 98 states have (on average 2.0) internal successors, (196), 183 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:13,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2022-02-20 23:47:13,099 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 4 [2022-02-20 23:47:13,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:13,099 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2022-02-20 23:47:13,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:13,100 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2022-02-20 23:47:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:47:13,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:13,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:47:13,111 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:47:13,308 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:47:13,308 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:13,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash 157525902, now seen corresponding path program 1 times [2022-02-20 23:47:13,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:13,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266503905] [2022-02-20 23:47:13,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:13,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:13,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:13,311 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:47:13,313 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:47:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:13,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:47:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:13,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:13,386 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:47:13,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {2628#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {2628#true} is VALID [2022-02-20 23:47:13,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {2628#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {2628#true} is VALID [2022-02-20 23:47:13,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {2628#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {2639#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:13,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {2639#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {2639#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:13,398 INFO L290 TraceCheckUtils]: 4: Hoare triple {2639#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[append_~node~0#1.base]); {2629#false} is VALID [2022-02-20 23:47:13,399 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:47:13,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:13,399 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:13,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266503905] [2022-02-20 23:47:13,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266503905] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:13,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:13,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:13,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830819636] [2022-02-20 23:47:13,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:13,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:47:13,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:13,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:13,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:13,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:13,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:13,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:13,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:13,408 INFO L87 Difference]: Start difference. First operand 187 states and 200 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:14,040 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2022-02-20 23:47:14,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:14,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:47:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2022-02-20 23:47:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2022-02-20 23:47:14,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 220 transitions. [2022-02-20 23:47:14,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:14,259 INFO L225 Difference]: With dead ends: 210 [2022-02-20 23:47:14,260 INFO L226 Difference]: Without dead ends: 210 [2022-02-20 23:47:14,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:14,261 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 64 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:14,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 234 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-02-20 23:47:14,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 185. [2022-02-20 23:47:14,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:14,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 185 states, 98 states have (on average 1.969387755102041) internal successors, (193), 181 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:14,268 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 185 states, 98 states have (on average 1.969387755102041) internal successors, (193), 181 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:14,269 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 185 states, 98 states have (on average 1.969387755102041) internal successors, (193), 181 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:14,275 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2022-02-20 23:47:14,275 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2022-02-20 23:47:14,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:14,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:14,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 98 states have (on average 1.969387755102041) internal successors, (193), 181 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 210 states. [2022-02-20 23:47:14,277 INFO L87 Difference]: Start difference. First operand has 185 states, 98 states have (on average 1.969387755102041) internal successors, (193), 181 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 210 states. [2022-02-20 23:47:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:14,283 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2022-02-20 23:47:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2022-02-20 23:47:14,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:14,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:14,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:14,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 98 states have (on average 1.969387755102041) internal successors, (193), 181 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2022-02-20 23:47:14,289 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 5 [2022-02-20 23:47:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:14,289 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2022-02-20 23:47:14,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2022-02-20 23:47:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:47:14,290 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:14,290 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:47:14,299 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:47:14,495 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:47:14,495 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:14,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash 157525903, now seen corresponding path program 1 times [2022-02-20 23:47:14,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:14,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800416099] [2022-02-20 23:47:14,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:14,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:14,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:14,498 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:47:14,500 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:47:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:14,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:14,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:14,566 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:47:14,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {3460#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {3460#true} is VALID [2022-02-20 23:47:14,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {3460#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {3460#true} is VALID [2022-02-20 23:47:14,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {3460#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {3471#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:14,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {3471#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {3471#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:14,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {3471#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, append_~node~0#1.offset)), #length[append_~node~0#1.base]) && ~bvule32(~bvadd32(4bv32, append_~node~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, append_~node~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, append_~node~0#1.offset))); {3461#false} is VALID [2022-02-20 23:47:14,587 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:47:14,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:14,588 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:14,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800416099] [2022-02-20 23:47:14,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800416099] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:14,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:14,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:14,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428468044] [2022-02-20 23:47:14,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:14,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:47:14,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:14,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:14,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:14,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:14,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:14,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:14,599 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:15,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:15,399 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2022-02-20 23:47:15,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:15,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:47:15,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:15,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2022-02-20 23:47:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2022-02-20 23:47:15,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2022-02-20 23:47:15,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:15,608 INFO L225 Difference]: With dead ends: 183 [2022-02-20 23:47:15,609 INFO L226 Difference]: Without dead ends: 183 [2022-02-20 23:47:15,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:15,609 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 11 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:15,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 275 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-02-20 23:47:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-02-20 23:47:15,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:15,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 183 states, 98 states have (on average 1.9387755102040816) internal successors, (190), 179 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:15,615 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 183 states, 98 states have (on average 1.9387755102040816) internal successors, (190), 179 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:15,616 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 183 states, 98 states have (on average 1.9387755102040816) internal successors, (190), 179 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:15,620 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2022-02-20 23:47:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2022-02-20 23:47:15,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:15,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:15,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 98 states have (on average 1.9387755102040816) internal successors, (190), 179 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 183 states. [2022-02-20 23:47:15,622 INFO L87 Difference]: Start difference. First operand has 183 states, 98 states have (on average 1.9387755102040816) internal successors, (190), 179 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 183 states. [2022-02-20 23:47:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:15,627 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2022-02-20 23:47:15,627 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2022-02-20 23:47:15,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:15,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:15,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:15,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 98 states have (on average 1.9387755102040816) internal successors, (190), 179 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 194 transitions. [2022-02-20 23:47:15,633 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 194 transitions. Word has length 5 [2022-02-20 23:47:15,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:15,633 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 194 transitions. [2022-02-20 23:47:15,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:15,633 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2022-02-20 23:47:15,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:47:15,634 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:15,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:15,646 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:47:15,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:15,842 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:15,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1322502935, now seen corresponding path program 1 times [2022-02-20 23:47:15,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:15,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320689771] [2022-02-20 23:47:15,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:15,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:15,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:15,845 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:15,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:47:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:15,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:47:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:15,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:15,947 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:47:15,992 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:15,992 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 11 treesize of output 11 [2022-02-20 23:47:16,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 23:47:16,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 23:47:16,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:47:16,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:47:16,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {4209#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {4209#true} is VALID [2022-02-20 23:47:16,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {4209#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {4217#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:16,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {4217#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {4221#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_append_~pointerToList#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:16,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {4221#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_append_~pointerToList#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {4221#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_append_~pointerToList#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:16,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {4221#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_append_~pointerToList#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {4228#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:16,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {4228#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {4228#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:16,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {4228#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {4235#(and (= |ULTIMATE.start_append_#t~mem26#1.base| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_append_#t~mem26#1.offset|))} is VALID [2022-02-20 23:47:16,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {4235#(and (= |ULTIMATE.start_append_#t~mem26#1.base| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_append_#t~mem26#1.offset|))} assume !(append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32);havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {4210#false} is VALID [2022-02-20 23:47:16,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {4210#false} SUMMARY for call append_#t~mem28#1.base, append_#t~mem28#1.offset := read~$Pointer$(append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L593 {4210#false} is VALID [2022-02-20 23:47:16,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {4210#false} assume !(1bv1 == #valid[append_#t~mem28#1.base]); {4210#false} is VALID [2022-02-20 23:47:16,183 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:47:16,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:16,183 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:16,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320689771] [2022-02-20 23:47:16,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320689771] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:16,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:16,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:47:16,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488682222] [2022-02-20 23:47:16,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:16,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:47:16,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:16,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:16,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:16,198 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:16,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:16,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:16,199 INFO L87 Difference]: Start difference. First operand 183 states and 194 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:17,628 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2022-02-20 23:47:17,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:47:17,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:47:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2022-02-20 23:47:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2022-02-20 23:47:17,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 198 transitions. [2022-02-20 23:47:17,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:17,850 INFO L225 Difference]: With dead ends: 185 [2022-02-20 23:47:17,851 INFO L226 Difference]: Without dead ends: 185 [2022-02-20 23:47:17,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:47:17,852 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 5 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:17,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 610 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-20 23:47:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2022-02-20 23:47:17,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:17,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 184 states, 99 states have (on average 1.9292929292929293) internal successors, (191), 180 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:17,863 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 184 states, 99 states have (on average 1.9292929292929293) internal successors, (191), 180 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:17,864 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 184 states, 99 states have (on average 1.9292929292929293) internal successors, (191), 180 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:17,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:17,884 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2022-02-20 23:47:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2022-02-20 23:47:17,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:17,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:17,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 99 states have (on average 1.9292929292929293) internal successors, (191), 180 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 185 states. [2022-02-20 23:47:17,886 INFO L87 Difference]: Start difference. First operand has 184 states, 99 states have (on average 1.9292929292929293) internal successors, (191), 180 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 185 states. [2022-02-20 23:47:17,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:17,890 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2022-02-20 23:47:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2022-02-20 23:47:17,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:17,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:17,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:17,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 99 states have (on average 1.9292929292929293) internal successors, (191), 180 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 195 transitions. [2022-02-20 23:47:17,894 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 195 transitions. Word has length 10 [2022-02-20 23:47:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:17,895 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 195 transitions. [2022-02-20 23:47:17,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:17,895 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 195 transitions. [2022-02-20 23:47:17,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:47:17,895 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:17,895 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:17,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:18,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:18,104 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:18,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:18,105 INFO L85 PathProgramCache]: Analyzing trace with hash -388286564, now seen corresponding path program 1 times [2022-02-20 23:47:18,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:18,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259279527] [2022-02-20 23:47:18,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:18,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:18,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:18,106 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:47:18,107 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:47:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:18,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:47:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:18,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:18,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {4987#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {4987#true} is VALID [2022-02-20 23:47:18,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {4987#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {4987#true} is VALID [2022-02-20 23:47:18,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {4987#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {4987#true} is VALID [2022-02-20 23:47:18,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {4987#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {4987#true} is VALID [2022-02-20 23:47:18,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {4987#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {4987#true} is VALID [2022-02-20 23:47:18,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {4987#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {4987#true} is VALID [2022-02-20 23:47:18,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {4987#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {4987#true} is VALID [2022-02-20 23:47:18,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {4987#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {4987#true} is VALID [2022-02-20 23:47:18,239 INFO L272 TraceCheckUtils]: 8: Hoare triple {4987#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {5016#(and (= (_ bv0 32) |create_data_#in~prevData.offset|) (= |create_data_#in~prevData.base| (_ bv0 32)))} is VALID [2022-02-20 23:47:18,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {5016#(and (= (_ bv0 32) |create_data_#in~prevData.offset|) (= |create_data_#in~prevData.base| (_ bv0 32)))} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {5020#(not |create_data_#t~short4|)} is VALID [2022-02-20 23:47:18,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {5020#(not |create_data_#t~short4|)} assume #t~short4; {4988#false} is VALID [2022-02-20 23:47:18,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {4988#false} assume !(1bv1 == #valid[~prevData.base]); {4988#false} is VALID [2022-02-20 23:47:18,240 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:47:18,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:18,241 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:18,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259279527] [2022-02-20 23:47:18,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259279527] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:18,241 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:18,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:18,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082839409] [2022-02-20 23:47:18,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:18,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:47:18,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:18,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:18,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:18,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:18,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:18,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:18,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:18,253 INFO L87 Difference]: Start difference. First operand 184 states and 195 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,010 INFO L93 Difference]: Finished difference Result 262 states and 277 transitions. [2022-02-20 23:47:19,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:19,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:47:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 274 transitions. [2022-02-20 23:47:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 274 transitions. [2022-02-20 23:47:19,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 274 transitions. [2022-02-20 23:47:19,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:19,321 INFO L225 Difference]: With dead ends: 262 [2022-02-20 23:47:19,321 INFO L226 Difference]: Without dead ends: 262 [2022-02-20 23:47:19,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:19,322 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 81 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:19,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 551 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-02-20 23:47:19,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 226. [2022-02-20 23:47:19,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:19,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 226 states, 140 states have (on average 1.95) internal successors, (273), 221 states have internal predecessors, (273), 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:47:19,327 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 226 states, 140 states have (on average 1.95) internal successors, (273), 221 states have internal predecessors, (273), 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:47:19,328 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 226 states, 140 states have (on average 1.95) internal successors, (273), 221 states have internal predecessors, (273), 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:47:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,333 INFO L93 Difference]: Finished difference Result 262 states and 277 transitions. [2022-02-20 23:47:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 277 transitions. [2022-02-20 23:47:19,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:19,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:19,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 140 states have (on average 1.95) internal successors, (273), 221 states have internal predecessors, (273), 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) Second operand 262 states. [2022-02-20 23:47:19,335 INFO L87 Difference]: Start difference. First operand has 226 states, 140 states have (on average 1.95) internal successors, (273), 221 states have internal predecessors, (273), 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) Second operand 262 states. [2022-02-20 23:47:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,341 INFO L93 Difference]: Finished difference Result 262 states and 277 transitions. [2022-02-20 23:47:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 277 transitions. [2022-02-20 23:47:19,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:19,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:19,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:19,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 140 states have (on average 1.95) internal successors, (273), 221 states have internal predecessors, (273), 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:47:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 277 transitions. [2022-02-20 23:47:19,347 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 277 transitions. Word has length 12 [2022-02-20 23:47:19,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:19,347 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 277 transitions. [2022-02-20 23:47:19,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,348 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 277 transitions. [2022-02-20 23:47:19,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:47:19,348 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:19,348 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:19,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-02-20 23:47:19,557 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:47:19,557 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash 848024593, now seen corresponding path program 1 times [2022-02-20 23:47:19,558 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:19,558 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548594630] [2022-02-20 23:47:19,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:19,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:19,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:19,559 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:47:19,560 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:47:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:19,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:19,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:19,698 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:47:19,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14 [2022-02-20 23:47:19,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {6040#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {6040#true} is VALID [2022-02-20 23:47:19,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {6040#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {6040#true} is VALID [2022-02-20 23:47:19,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {6040#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {6040#true} is VALID [2022-02-20 23:47:19,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {6040#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {6040#true} is VALID [2022-02-20 23:47:19,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {6040#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {6040#true} is VALID [2022-02-20 23:47:19,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {6040#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {6040#true} is VALID [2022-02-20 23:47:19,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {6040#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {6040#true} is VALID [2022-02-20 23:47:19,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {6040#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {6040#true} is VALID [2022-02-20 23:47:19,722 INFO L272 TraceCheckUtils]: 8: Hoare triple {6040#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {6040#true} is VALID [2022-02-20 23:47:19,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {6040#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {6040#true} is VALID [2022-02-20 23:47:19,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {6040#true} assume !#t~short4; {6040#true} is VALID [2022-02-20 23:47:19,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {6040#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {6078#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| create_data_~data~0.base))) (_ bv1 1)))} is VALID [2022-02-20 23:47:19,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {6078#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| create_data_~data~0.base))) (_ bv1 1)))} assume !(1bv1 == #valid[~data~0.base]); {6041#false} is VALID [2022-02-20 23:47:19,727 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:47:19,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:19,727 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:19,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548594630] [2022-02-20 23:47:19,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548594630] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:19,728 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:19,728 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:19,728 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870609123] [2022-02-20 23:47:19,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:19,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:47:19,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:19,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:19,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:19,744 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:19,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:19,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:19,745 INFO L87 Difference]: Start difference. First operand 226 states and 277 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:20,342 INFO L93 Difference]: Finished difference Result 229 states and 273 transitions. [2022-02-20 23:47:20,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:20,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:47:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:20,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2022-02-20 23:47:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:20,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2022-02-20 23:47:20,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 201 transitions. [2022-02-20 23:47:20,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:20,576 INFO L225 Difference]: With dead ends: 229 [2022-02-20 23:47:20,576 INFO L226 Difference]: Without dead ends: 229 [2022-02-20 23:47:20,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:20,577 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 63 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:20,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 204 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-02-20 23:47:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 220. [2022-02-20 23:47:20,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:20,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 220 states, 146 states have (on average 1.8013698630136987) internal successors, (263), 215 states have internal predecessors, (263), 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:47:20,582 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 220 states, 146 states have (on average 1.8013698630136987) internal successors, (263), 215 states have internal predecessors, (263), 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:47:20,583 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 220 states, 146 states have (on average 1.8013698630136987) internal successors, (263), 215 states have internal predecessors, (263), 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:47:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:20,588 INFO L93 Difference]: Finished difference Result 229 states and 273 transitions. [2022-02-20 23:47:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 273 transitions. [2022-02-20 23:47:20,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:20,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:20,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 220 states, 146 states have (on average 1.8013698630136987) internal successors, (263), 215 states have internal predecessors, (263), 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) Second operand 229 states. [2022-02-20 23:47:20,590 INFO L87 Difference]: Start difference. First operand has 220 states, 146 states have (on average 1.8013698630136987) internal successors, (263), 215 states have internal predecessors, (263), 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) Second operand 229 states. [2022-02-20 23:47:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:20,594 INFO L93 Difference]: Finished difference Result 229 states and 273 transitions. [2022-02-20 23:47:20,595 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 273 transitions. [2022-02-20 23:47:20,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:20,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:20,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:20,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 146 states have (on average 1.8013698630136987) internal successors, (263), 215 states have internal predecessors, (263), 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:47:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 267 transitions. [2022-02-20 23:47:20,600 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 267 transitions. Word has length 13 [2022-02-20 23:47:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:20,601 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 267 transitions. [2022-02-20 23:47:20,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 267 transitions. [2022-02-20 23:47:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:47:20,602 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:20,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:20,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 23:47:20,811 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:47:20,811 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:20,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:20,811 INFO L85 PathProgramCache]: Analyzing trace with hash 848024594, now seen corresponding path program 1 times [2022-02-20 23:47:20,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:20,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198098706] [2022-02-20 23:47:20,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:20,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:20,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:20,813 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:47:20,814 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:47:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:20,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:47:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:20,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:20,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:20,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2022-02-20 23:47:20,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 23:47:20,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {6988#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {6988#true} is VALID [2022-02-20 23:47:20,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {6988#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {6988#true} is VALID [2022-02-20 23:47:20,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {6988#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {6988#true} is VALID [2022-02-20 23:47:20,972 INFO L290 TraceCheckUtils]: 3: Hoare triple {6988#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {6988#true} is VALID [2022-02-20 23:47:20,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {6988#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {6988#true} is VALID [2022-02-20 23:47:20,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {6988#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {6988#true} is VALID [2022-02-20 23:47:20,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {6988#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {6988#true} is VALID [2022-02-20 23:47:20,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {6988#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {6988#true} is VALID [2022-02-20 23:47:20,973 INFO L272 TraceCheckUtils]: 8: Hoare triple {6988#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {6988#true} is VALID [2022-02-20 23:47:20,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {6988#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {6988#true} is VALID [2022-02-20 23:47:20,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {6988#true} assume !#t~short4; {6988#true} is VALID [2022-02-20 23:47:20,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {6988#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {7026#(and (= (_ bv16 32) (select |#length| create_data_~data~0.base)) (= create_data_~data~0.offset (_ bv0 32)))} is VALID [2022-02-20 23:47:20,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {7026#(and (= (_ bv16 32) (select |#length| create_data_~data~0.base)) (= create_data_~data~0.offset (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, ~data~0.offset)), #length[~data~0.base]) && ~bvule32(~bvadd32(4bv32, ~data~0.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, ~data~0.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, ~data~0.offset))); {6989#false} is VALID [2022-02-20 23:47:20,976 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:47:20,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:20,977 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:20,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198098706] [2022-02-20 23:47:20,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1198098706] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:20,977 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:20,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:20,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113623189] [2022-02-20 23:47:20,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:20,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:47:20,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:20,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:20,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:20,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:20,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:20,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:20,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:20,996 INFO L87 Difference]: Start difference. First operand 220 states and 267 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:21,700 INFO L93 Difference]: Finished difference Result 241 states and 281 transitions. [2022-02-20 23:47:21,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:21,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:47:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2022-02-20 23:47:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2022-02-20 23:47:21,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 205 transitions. [2022-02-20 23:47:21,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:21,925 INFO L225 Difference]: With dead ends: 241 [2022-02-20 23:47:21,926 INFO L226 Difference]: Without dead ends: 241 [2022-02-20 23:47:21,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:21,927 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 50 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:21,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 214 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-02-20 23:47:21,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 221. [2022-02-20 23:47:21,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:21,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand has 221 states, 156 states have (on average 1.6474358974358974) internal successors, (257), 216 states have internal predecessors, (257), 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:47:21,932 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand has 221 states, 156 states have (on average 1.6474358974358974) internal successors, (257), 216 states have internal predecessors, (257), 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:47:21,932 INFO L87 Difference]: Start difference. First operand 241 states. Second operand has 221 states, 156 states have (on average 1.6474358974358974) internal successors, (257), 216 states have internal predecessors, (257), 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:47:21,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:21,937 INFO L93 Difference]: Finished difference Result 241 states and 281 transitions. [2022-02-20 23:47:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 281 transitions. [2022-02-20 23:47:21,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:21,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:21,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 156 states have (on average 1.6474358974358974) internal successors, (257), 216 states have internal predecessors, (257), 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) Second operand 241 states. [2022-02-20 23:47:21,939 INFO L87 Difference]: Start difference. First operand has 221 states, 156 states have (on average 1.6474358974358974) internal successors, (257), 216 states have internal predecessors, (257), 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) Second operand 241 states. [2022-02-20 23:47:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:21,944 INFO L93 Difference]: Finished difference Result 241 states and 281 transitions. [2022-02-20 23:47:21,944 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 281 transitions. [2022-02-20 23:47:21,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:21,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:21,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:21,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 156 states have (on average 1.6474358974358974) internal successors, (257), 216 states have internal predecessors, (257), 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:47:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 261 transitions. [2022-02-20 23:47:21,949 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 261 transitions. Word has length 13 [2022-02-20 23:47:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:21,949 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 261 transitions. [2022-02-20 23:47:21,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 261 transitions. [2022-02-20 23:47:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:21,950 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:21,950 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:21,963 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:47:22,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:22,159 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:22,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:22,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1586642756, now seen corresponding path program 1 times [2022-02-20 23:47:22,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:22,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252614633] [2022-02-20 23:47:22,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:22,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:22,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:22,161 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:22,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:47:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:22,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:47:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:22,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:22,291 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:47:22,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-20 23:47:22,316 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 13 treesize of output 9 [2022-02-20 23:47:22,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-02-20 23:47:22,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {7973#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {7973#true} is VALID [2022-02-20 23:47:22,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {7973#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {7973#true} is VALID [2022-02-20 23:47:22,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {7973#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {7973#true} is VALID [2022-02-20 23:47:22,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {7973#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {7973#true} is VALID [2022-02-20 23:47:22,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {7973#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {7973#true} is VALID [2022-02-20 23:47:22,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {7973#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {7973#true} is VALID [2022-02-20 23:47:22,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {7973#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {7973#true} is VALID [2022-02-20 23:47:22,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {7973#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {7973#true} is VALID [2022-02-20 23:47:22,357 INFO L272 TraceCheckUtils]: 8: Hoare triple {7973#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {7973#true} is VALID [2022-02-20 23:47:22,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {7973#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {7973#true} is VALID [2022-02-20 23:47:22,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {7973#true} assume !#t~short4; {7973#true} is VALID [2022-02-20 23:47:22,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {7973#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {8011#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |create_data_#t~malloc7.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:47:22,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {8011#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |create_data_#t~malloc7.base|)) (_ bv1 1)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {8015#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} is VALID [2022-02-20 23:47:22,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {8015#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {8015#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} is VALID [2022-02-20 23:47:22,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {8015#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} assume !!~bvslt32(~counter~0, 3bv32); {8015#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} is VALID [2022-02-20 23:47:22,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {8015#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {8025#(= (bvadd (bvneg (select |#valid| |create_data_#t~mem9.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:47:22,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {8025#(= (bvadd (bvneg (select |#valid| |create_data_#t~mem9.base|)) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[#t~mem9.base]); {7974#false} is VALID [2022-02-20 23:47:22,362 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:47:22,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:22,363 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:22,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252614633] [2022-02-20 23:47:22,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252614633] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:22,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:22,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:22,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224145475] [2022-02-20 23:47:22,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:22,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:47:22,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:22,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:22,380 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:47:22,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:22,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:22,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:22,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:22,381 INFO L87 Difference]: Start difference. First operand 221 states and 261 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:23,973 INFO L93 Difference]: Finished difference Result 274 states and 327 transitions. [2022-02-20 23:47:23,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:23,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:47:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2022-02-20 23:47:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2022-02-20 23:47:23,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 203 transitions. [2022-02-20 23:47:24,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:24,238 INFO L225 Difference]: With dead ends: 274 [2022-02-20 23:47:24,238 INFO L226 Difference]: Without dead ends: 274 [2022-02-20 23:47:24,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:24,239 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 26 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:24,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 417 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:47:24,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-02-20 23:47:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 227. [2022-02-20 23:47:24,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:24,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand has 227 states, 162 states have (on average 1.6481481481481481) internal successors, (267), 222 states have internal predecessors, (267), 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:47:24,246 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand has 227 states, 162 states have (on average 1.6481481481481481) internal successors, (267), 222 states have internal predecessors, (267), 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:47:24,246 INFO L87 Difference]: Start difference. First operand 274 states. Second operand has 227 states, 162 states have (on average 1.6481481481481481) internal successors, (267), 222 states have internal predecessors, (267), 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:47:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:24,251 INFO L93 Difference]: Finished difference Result 274 states and 327 transitions. [2022-02-20 23:47:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 327 transitions. [2022-02-20 23:47:24,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:24,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:24,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 227 states, 162 states have (on average 1.6481481481481481) internal successors, (267), 222 states have internal predecessors, (267), 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) Second operand 274 states. [2022-02-20 23:47:24,253 INFO L87 Difference]: Start difference. First operand has 227 states, 162 states have (on average 1.6481481481481481) internal successors, (267), 222 states have internal predecessors, (267), 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) Second operand 274 states. [2022-02-20 23:47:24,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:24,258 INFO L93 Difference]: Finished difference Result 274 states and 327 transitions. [2022-02-20 23:47:24,259 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 327 transitions. [2022-02-20 23:47:24,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:24,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:24,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:24,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 162 states have (on average 1.6481481481481481) internal successors, (267), 222 states have internal predecessors, (267), 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:47:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 271 transitions. [2022-02-20 23:47:24,264 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 271 transitions. Word has length 17 [2022-02-20 23:47:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:24,266 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 271 transitions. [2022-02-20 23:47:24,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 271 transitions. [2022-02-20 23:47:24,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:24,266 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:24,266 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:24,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:24,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:24,475 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:24,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:24,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1586642755, now seen corresponding path program 1 times [2022-02-20 23:47:24,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:24,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395307303] [2022-02-20 23:47:24,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:24,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:24,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:24,478 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:47:24,480 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:47:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:24,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:47:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:24,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:24,635 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:47:24,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:47:24,663 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 13 treesize of output 9 [2022-02-20 23:47:24,670 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 13 treesize of output 9 [2022-02-20 23:47:24,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-02-20 23:47:24,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:47:24,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {9081#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {9081#true} is VALID [2022-02-20 23:47:24,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {9081#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {9081#true} is VALID [2022-02-20 23:47:24,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {9081#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {9081#true} is VALID [2022-02-20 23:47:24,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {9081#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {9081#true} is VALID [2022-02-20 23:47:24,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {9081#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {9081#true} is VALID [2022-02-20 23:47:24,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {9081#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {9081#true} is VALID [2022-02-20 23:47:24,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {9081#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {9081#true} is VALID [2022-02-20 23:47:24,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {9081#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {9081#true} is VALID [2022-02-20 23:47:24,779 INFO L272 TraceCheckUtils]: 8: Hoare triple {9081#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {9081#true} is VALID [2022-02-20 23:47:24,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {9081#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {9081#true} is VALID [2022-02-20 23:47:24,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {9081#true} assume !#t~short4; {9081#true} is VALID [2022-02-20 23:47:24,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {9081#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {9119#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)))} is VALID [2022-02-20 23:47:24,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {9119#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {9123#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:24,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {9123#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {9127#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:24,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {9127#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!~bvslt32(~counter~0, 3bv32); {9127#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:24,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {9127#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {9134#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= create_data_~counter~0 (_ bv0 32)) (= |create_data_#t~mem9.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:24,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {9134#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= create_data_~counter~0 (_ bv0 32)) (= |create_data_#t~mem9.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))), #length[#t~mem9.base]) && ~bvule32(~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), ~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))))) && ~bvule32(0bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)))); {9082#false} is VALID [2022-02-20 23:47:24,787 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:47:24,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:24,787 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:24,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395307303] [2022-02-20 23:47:24,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395307303] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:24,787 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:24,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:47:24,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175114621] [2022-02-20 23:47:24,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:24,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:47:24,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:24,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:24,815 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:47:24,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:24,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:24,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:24,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:24,816 INFO L87 Difference]: Start difference. First operand 227 states and 271 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:26,981 INFO L93 Difference]: Finished difference Result 229 states and 269 transitions. [2022-02-20 23:47:26,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:26,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:47:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2022-02-20 23:47:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2022-02-20 23:47:26,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 174 transitions. [2022-02-20 23:47:27,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:27,194 INFO L225 Difference]: With dead ends: 229 [2022-02-20 23:47:27,194 INFO L226 Difference]: Without dead ends: 229 [2022-02-20 23:47:27,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:47:27,195 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 4 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:27,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 513 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 23:47:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-02-20 23:47:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2022-02-20 23:47:27,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:27,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 227 states, 162 states have (on average 1.623456790123457) internal successors, (263), 222 states have internal predecessors, (263), 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:47:27,201 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 227 states, 162 states have (on average 1.623456790123457) internal successors, (263), 222 states have internal predecessors, (263), 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:47:27,201 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 227 states, 162 states have (on average 1.623456790123457) internal successors, (263), 222 states have internal predecessors, (263), 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:47:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:27,205 INFO L93 Difference]: Finished difference Result 229 states and 269 transitions. [2022-02-20 23:47:27,205 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 269 transitions. [2022-02-20 23:47:27,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:27,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:27,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 227 states, 162 states have (on average 1.623456790123457) internal successors, (263), 222 states have internal predecessors, (263), 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) Second operand 229 states. [2022-02-20 23:47:27,207 INFO L87 Difference]: Start difference. First operand has 227 states, 162 states have (on average 1.623456790123457) internal successors, (263), 222 states have internal predecessors, (263), 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) Second operand 229 states. [2022-02-20 23:47:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:27,215 INFO L93 Difference]: Finished difference Result 229 states and 269 transitions. [2022-02-20 23:47:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 269 transitions. [2022-02-20 23:47:27,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:27,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:27,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:27,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 162 states have (on average 1.623456790123457) internal successors, (263), 222 states have internal predecessors, (263), 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:47:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 267 transitions. [2022-02-20 23:47:27,220 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 267 transitions. Word has length 17 [2022-02-20 23:47:27,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:27,220 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 267 transitions. [2022-02-20 23:47:27,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 267 transitions. [2022-02-20 23:47:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:47:27,221 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:27,221 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:27,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:27,430 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:47:27,430 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:27,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:27,431 INFO L85 PathProgramCache]: Analyzing trace with hash 509612229, now seen corresponding path program 1 times [2022-02-20 23:47:27,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:27,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511947397] [2022-02-20 23:47:27,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:27,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:27,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:27,448 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:47:27,449 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:47:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:27,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:47:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:27,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:27,626 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:47:27,626 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 20 treesize of output 22 [2022-02-20 23:47:27,676 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 13 treesize of output 9 [2022-02-20 23:47:27,770 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:27,771 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 37 treesize of output 38 [2022-02-20 23:47:27,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-02-20 23:47:27,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {10055#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {10055#true} is VALID [2022-02-20 23:47:27,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {10055#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {10055#true} is VALID [2022-02-20 23:47:27,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {10055#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {10055#true} is VALID [2022-02-20 23:47:27,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {10055#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {10055#true} is VALID [2022-02-20 23:47:27,848 INFO L290 TraceCheckUtils]: 4: Hoare triple {10055#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {10055#true} is VALID [2022-02-20 23:47:27,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {10055#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {10055#true} is VALID [2022-02-20 23:47:27,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {10055#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {10055#true} is VALID [2022-02-20 23:47:27,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {10055#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {10055#true} is VALID [2022-02-20 23:47:27,848 INFO L272 TraceCheckUtils]: 8: Hoare triple {10055#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {10055#true} is VALID [2022-02-20 23:47:27,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {10055#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {10055#true} is VALID [2022-02-20 23:47:27,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {10055#true} assume !#t~short4; {10055#true} is VALID [2022-02-20 23:47:27,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {10055#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {10093#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| |create_data_#t~malloc7.base|)) (_ bv1 1))) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} is VALID [2022-02-20 23:47:27,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {10093#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| |create_data_#t~malloc7.base|)) (_ bv1 1))) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {10097#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:27,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {10097#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {10097#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:27,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {10097#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} assume !!~bvslt32(~counter~0, 3bv32); {10097#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:27,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {10097#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {10107#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:27,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {10107#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {10097#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:27,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {10097#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {10097#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:27,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {10097#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {10097#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:27,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {10097#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} assume !!~bvslt32(~counter~0, 3bv32); {10097#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:27,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {10097#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {10123#(= (bvadd (bvneg (select |#valid| |create_data_#t~mem9.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:47:27,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {10123#(= (bvadd (bvneg (select |#valid| |create_data_#t~mem9.base|)) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[#t~mem9.base]); {10056#false} is VALID [2022-02-20 23:47:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:47:27,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:27,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_178) c_create_data_~data~0.base) .cse0)))) (_ bv1 1)))) is different from false [2022-02-20 23:47:28,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:28,000 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-02-20 23:47:28,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2022-02-20 23:47:28,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-02-20 23:47:28,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {10123#(= (bvadd (bvneg (select |#valid| |create_data_#t~mem9.base|)) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[#t~mem9.base]); {10056#false} is VALID [2022-02-20 23:47:28,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {10130#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {10123#(= (bvadd (bvneg (select |#valid| |create_data_#t~mem9.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:47:28,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {10130#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} assume !!~bvslt32(~counter~0, 3bv32); {10130#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} is VALID [2022-02-20 23:47:28,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {10130#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {10130#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} is VALID [2022-02-20 23:47:28,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {10130#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {10130#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} is VALID [2022-02-20 23:47:28,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {10143#(forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_178) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (_ bv0 1)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {10130#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} is VALID [2022-02-20 23:47:28,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {10147#(forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_178) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {10143#(forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_178) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (_ bv0 1)))} is VALID [2022-02-20 23:47:28,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {10147#(forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_178) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))))} assume !!~bvslt32(~counter~0, 3bv32); {10147#(forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_178) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))))} is VALID [2022-02-20 23:47:28,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {10147#(forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_178) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {10147#(forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_178) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))))} is VALID [2022-02-20 23:47:28,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {10157#(or (forall ((v_arrayElimCell_19 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| v_arrayElimCell_19)) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (bvneg (select |#valid| |create_data_#t~malloc7.base|)) (_ bv1 1))) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|))))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {10147#(forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_178) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1))))} is VALID [2022-02-20 23:47:28,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {10055#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {10157#(or (forall ((v_arrayElimCell_19 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| v_arrayElimCell_19)) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (bvneg (select |#valid| |create_data_#t~malloc7.base|)) (_ bv1 1))) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|))))} is VALID [2022-02-20 23:47:28,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {10055#true} assume !#t~short4; {10055#true} is VALID [2022-02-20 23:47:28,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {10055#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {10055#true} is VALID [2022-02-20 23:47:28,086 INFO L272 TraceCheckUtils]: 8: Hoare triple {10055#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {10055#true} is VALID [2022-02-20 23:47:28,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {10055#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {10055#true} is VALID [2022-02-20 23:47:28,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {10055#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {10055#true} is VALID [2022-02-20 23:47:28,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {10055#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {10055#true} is VALID [2022-02-20 23:47:28,087 INFO L290 TraceCheckUtils]: 4: Hoare triple {10055#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {10055#true} is VALID [2022-02-20 23:47:28,087 INFO L290 TraceCheckUtils]: 3: Hoare triple {10055#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {10055#true} is VALID [2022-02-20 23:47:28,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {10055#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {10055#true} is VALID [2022-02-20 23:47:28,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {10055#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {10055#true} is VALID [2022-02-20 23:47:28,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {10055#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {10055#true} is VALID [2022-02-20 23:47:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-20 23:47:28,088 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:28,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511947397] [2022-02-20 23:47:28,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511947397] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:28,088 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:28,088 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2022-02-20 23:47:28,088 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385100918] [2022-02-20 23:47:28,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:28,089 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:28,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:28,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:28,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:28,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:47:28,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:28,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:47:28,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=4, NotChecked=14, Total=90 [2022-02-20 23:47:28,141 INFO L87 Difference]: Start difference. First operand 227 states and 267 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:30,730 INFO L93 Difference]: Finished difference Result 234 states and 271 transitions. [2022-02-20 23:47:30,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:47:30,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:30,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2022-02-20 23:47:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2022-02-20 23:47:30,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 177 transitions. [2022-02-20 23:47:30,957 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:47:30,961 INFO L225 Difference]: With dead ends: 234 [2022-02-20 23:47:30,961 INFO L226 Difference]: Without dead ends: 234 [2022-02-20 23:47:30,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=60, Unknown=5, NotChecked=16, Total=110 [2022-02-20 23:47:30,962 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 29 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:30,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 694 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 314 Invalid, 0 Unknown, 265 Unchecked, 0.7s Time] [2022-02-20 23:47:30,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-02-20 23:47:30,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 226. [2022-02-20 23:47:30,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:30,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand has 226 states, 162 states have (on average 1.6111111111111112) internal successors, (261), 221 states have internal predecessors, (261), 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:47:30,967 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand has 226 states, 162 states have (on average 1.6111111111111112) internal successors, (261), 221 states have internal predecessors, (261), 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:47:30,967 INFO L87 Difference]: Start difference. First operand 234 states. Second operand has 226 states, 162 states have (on average 1.6111111111111112) internal successors, (261), 221 states have internal predecessors, (261), 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:47:30,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:30,971 INFO L93 Difference]: Finished difference Result 234 states and 271 transitions. [2022-02-20 23:47:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 271 transitions. [2022-02-20 23:47:30,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:30,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:30,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 162 states have (on average 1.6111111111111112) internal successors, (261), 221 states have internal predecessors, (261), 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) Second operand 234 states. [2022-02-20 23:47:30,973 INFO L87 Difference]: Start difference. First operand has 226 states, 162 states have (on average 1.6111111111111112) internal successors, (261), 221 states have internal predecessors, (261), 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) Second operand 234 states. [2022-02-20 23:47:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:30,977 INFO L93 Difference]: Finished difference Result 234 states and 271 transitions. [2022-02-20 23:47:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 271 transitions. [2022-02-20 23:47:30,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:30,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:30,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:30,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:30,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 162 states have (on average 1.6111111111111112) internal successors, (261), 221 states have internal predecessors, (261), 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:47:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 265 transitions. [2022-02-20 23:47:30,982 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 265 transitions. Word has length 22 [2022-02-20 23:47:30,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:30,982 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 265 transitions. [2022-02-20 23:47:30,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 265 transitions. [2022-02-20 23:47:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:47:30,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:30,983 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:30,996 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:47:31,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:31,196 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:31,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:31,197 INFO L85 PathProgramCache]: Analyzing trace with hash 509612230, now seen corresponding path program 1 times [2022-02-20 23:47:31,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:31,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511456935] [2022-02-20 23:47:31,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:31,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:31,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:31,199 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:31,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:47:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:31,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:47:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:31,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:31,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 23:47:31,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2022-02-20 23:47:31,449 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 13 treesize of output 9 [2022-02-20 23:47:31,458 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 13 treesize of output 9 [2022-02-20 23:47:31,610 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:31,610 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 46 treesize of output 45 [2022-02-20 23:47:31,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-02-20 23:47:31,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-02-20 23:47:31,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2022-02-20 23:47:31,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {11124#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {11124#true} is VALID [2022-02-20 23:47:31,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {11124#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {11124#true} is VALID [2022-02-20 23:47:31,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {11124#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {11124#true} is VALID [2022-02-20 23:47:31,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {11124#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {11124#true} is VALID [2022-02-20 23:47:31,769 INFO L290 TraceCheckUtils]: 4: Hoare triple {11124#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {11124#true} is VALID [2022-02-20 23:47:31,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {11124#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {11124#true} is VALID [2022-02-20 23:47:31,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {11124#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {11124#true} is VALID [2022-02-20 23:47:31,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {11124#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {11124#true} is VALID [2022-02-20 23:47:31,769 INFO L272 TraceCheckUtils]: 8: Hoare triple {11124#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {11124#true} is VALID [2022-02-20 23:47:31,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {11124#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {11124#true} is VALID [2022-02-20 23:47:31,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {11124#true} assume !#t~short4; {11124#true} is VALID [2022-02-20 23:47:31,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {11124#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {11162#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} is VALID [2022-02-20 23:47:31,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {11162#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {11166#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:31,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {11166#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {11170#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:31,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {11170#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} assume !!~bvslt32(~counter~0, 3bv32); {11170#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:31,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {11170#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {11177#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:31,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {11177#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {11170#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:31,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {11170#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {11170#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:31,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {11170#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {11187#(and (= create_data_~counter~0 (_ bv1 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:31,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {11187#(and (= create_data_~counter~0 (_ bv1 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} assume !!~bvslt32(~counter~0, 3bv32); {11187#(and (= create_data_~counter~0 (_ bv1 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:31,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {11187#(and (= create_data_~counter~0 (_ bv1 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {11194#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= create_data_~counter~0 (_ bv1 32)) (= |create_data_#t~mem9.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:31,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {11194#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= create_data_~counter~0 (_ bv1 32)) (= |create_data_#t~mem9.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))), #length[#t~mem9.base]) && ~bvule32(~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), ~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))))) && ~bvule32(0bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)))); {11125#false} is VALID [2022-02-20 23:47:31,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:31,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:32,173 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_223) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-02-20 23:47:32,218 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_222) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_222) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_223) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-02-20 23:47:32,282 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1) v_ArrVal_222) c_create_data_~data~0.base) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_222) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_223) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-02-20 23:47:32,311 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:32,312 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-02-20 23:47:32,319 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:32,319 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-02-20 23:47:32,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2022-02-20 23:47:32,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2022-02-20 23:47:32,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-02-20 23:47:32,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-02-20 23:47:32,611 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:32,611 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-02-20 23:47:32,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-02-20 23:47:32,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-02-20 23:47:32,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {11198#(and (bvule (bvadd |create_data_#t~mem9.offset| (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| |create_data_#t~mem9.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))), #length[#t~mem9.base]) && ~bvule32(~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), ~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))))) && ~bvule32(0bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)))); {11125#false} is VALID [2022-02-20 23:47:32,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {11202#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {11198#(and (bvule (bvadd |create_data_#t~mem9.offset| (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| |create_data_#t~mem9.base|)))} is VALID [2022-02-20 23:47:32,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {11202#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} assume !!~bvslt32(~counter~0, 3bv32); {11202#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} is VALID [2022-02-20 23:47:33,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {11209#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {11202#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} is VALID [2022-02-20 23:47:33,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {11209#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {11209#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is VALID [2022-02-20 23:47:33,455 WARN L290 TraceCheckUtils]: 16: Hoare triple {11216#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_223) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {11209#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is UNKNOWN [2022-02-20 23:47:33,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {11220#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_223) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {11216#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_223) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:33,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {11220#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_223) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} assume !!~bvslt32(~counter~0, 3bv32); {11220#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_223) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:33,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {11227#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_223) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {11220#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_223) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:33,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {11231#(and (bvule (bvadd (_ bv4 32) |create_data_#t~malloc7.offset|) (bvadd (_ bv8 32) |create_data_#t~malloc7.offset|)) (forall ((v_arrayElimCell_28 (_ BitVec 32))) (or (and (bvule (bvadd (_ bv8 32) |create_data_#t~malloc7.offset|) (select |#length| |create_data_#t~malloc7.base|)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|))) (and (forall ((v_arrayElimCell_27 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) v_arrayElimCell_28) (select |#length| v_arrayElimCell_27))) (= create_data_~data~0.base |create_data_#t~malloc7.base|)))) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {11227#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_223) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:33,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {11124#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {11231#(and (bvule (bvadd (_ bv4 32) |create_data_#t~malloc7.offset|) (bvadd (_ bv8 32) |create_data_#t~malloc7.offset|)) (forall ((v_arrayElimCell_28 (_ BitVec 32))) (or (and (bvule (bvadd (_ bv8 32) |create_data_#t~malloc7.offset|) (select |#length| |create_data_#t~malloc7.base|)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|))) (and (forall ((v_arrayElimCell_27 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) v_arrayElimCell_28) (select |#length| v_arrayElimCell_27))) (= create_data_~data~0.base |create_data_#t~malloc7.base|)))) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} is VALID [2022-02-20 23:47:33,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {11124#true} assume !#t~short4; {11124#true} is VALID [2022-02-20 23:47:33,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {11124#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {11124#true} is VALID [2022-02-20 23:47:33,491 INFO L272 TraceCheckUtils]: 8: Hoare triple {11124#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {11124#true} is VALID [2022-02-20 23:47:33,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {11124#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {11124#true} is VALID [2022-02-20 23:47:33,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {11124#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {11124#true} is VALID [2022-02-20 23:47:33,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {11124#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {11124#true} is VALID [2022-02-20 23:47:33,491 INFO L290 TraceCheckUtils]: 4: Hoare triple {11124#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {11124#true} is VALID [2022-02-20 23:47:33,491 INFO L290 TraceCheckUtils]: 3: Hoare triple {11124#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {11124#true} is VALID [2022-02-20 23:47:33,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {11124#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {11124#true} is VALID [2022-02-20 23:47:33,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {11124#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {11124#true} is VALID [2022-02-20 23:47:33,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {11124#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {11124#true} is VALID [2022-02-20 23:47:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-02-20 23:47:33,492 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:33,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511456935] [2022-02-20 23:47:33,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511456935] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:33,492 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:33,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-02-20 23:47:33,492 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535103575] [2022-02-20 23:47:33,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:33,493 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:33,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:33,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:34,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 29 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:34,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:47:34,091 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:34,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:47:34,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2022-02-20 23:47:34,092 INFO L87 Difference]: Start difference. First operand 226 states and 265 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:42,589 INFO L93 Difference]: Finished difference Result 238 states and 277 transitions. [2022-02-20 23:47:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:47:42,589 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:42,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:42,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2022-02-20 23:47:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2022-02-20 23:47:42,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 178 transitions. [2022-02-20 23:47:42,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:42,785 INFO L225 Difference]: With dead ends: 238 [2022-02-20 23:47:42,785 INFO L226 Difference]: Without dead ends: 238 [2022-02-20 23:47:42,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2022-02-20 23:47:42,786 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 14 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:42,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 1098 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 588 Invalid, 0 Unknown, 354 Unchecked, 2.5s Time] [2022-02-20 23:47:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-02-20 23:47:42,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2022-02-20 23:47:42,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:42,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 236 states, 172 states have (on average 1.5755813953488371) internal successors, (271), 231 states have internal predecessors, (271), 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:47:42,791 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 236 states, 172 states have (on average 1.5755813953488371) internal successors, (271), 231 states have internal predecessors, (271), 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:47:42,791 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 236 states, 172 states have (on average 1.5755813953488371) internal successors, (271), 231 states have internal predecessors, (271), 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:47:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:42,798 INFO L93 Difference]: Finished difference Result 238 states and 277 transitions. [2022-02-20 23:47:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 277 transitions. [2022-02-20 23:47:42,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:42,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:42,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 172 states have (on average 1.5755813953488371) internal successors, (271), 231 states have internal predecessors, (271), 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) Second operand 238 states. [2022-02-20 23:47:42,800 INFO L87 Difference]: Start difference. First operand has 236 states, 172 states have (on average 1.5755813953488371) internal successors, (271), 231 states have internal predecessors, (271), 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) Second operand 238 states. [2022-02-20 23:47:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:42,803 INFO L93 Difference]: Finished difference Result 238 states and 277 transitions. [2022-02-20 23:47:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 277 transitions. [2022-02-20 23:47:42,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:42,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:42,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:42,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 172 states have (on average 1.5755813953488371) internal successors, (271), 231 states have internal predecessors, (271), 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:47:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 275 transitions. [2022-02-20 23:47:42,808 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 275 transitions. Word has length 22 [2022-02-20 23:47:42,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:42,809 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 275 transitions. [2022-02-20 23:47:42,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 275 transitions. [2022-02-20 23:47:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:47:42,810 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:42,810 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:42,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:43,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:43,020 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:43,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2075876957, now seen corresponding path program 2 times [2022-02-20 23:47:43,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:43,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774658155] [2022-02-20 23:47:43,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:47:43,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:43,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:43,022 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:47:43,023 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:47:43,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:47:43,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:47:43,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 23:47:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:43,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:43,305 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:47:43,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:47:43,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 23:47:43,354 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 13 treesize of output 9 [2022-02-20 23:47:43,364 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 13 treesize of output 9 [2022-02-20 23:47:43,530 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:43,530 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 46 treesize of output 45 [2022-02-20 23:47:43,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-02-20 23:47:43,725 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:43,725 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 46 treesize of output 45 [2022-02-20 23:47:43,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-02-20 23:47:43,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-02-20 23:47:43,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2022-02-20 23:47:43,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {12225#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {12225#true} is VALID [2022-02-20 23:47:43,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {12225#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {12225#true} is VALID [2022-02-20 23:47:43,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {12225#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {12225#true} is VALID [2022-02-20 23:47:43,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {12225#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {12225#true} is VALID [2022-02-20 23:47:43,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {12225#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {12225#true} is VALID [2022-02-20 23:47:43,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {12225#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {12225#true} is VALID [2022-02-20 23:47:43,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {12225#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {12225#true} is VALID [2022-02-20 23:47:43,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {12225#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {12225#true} is VALID [2022-02-20 23:47:43,891 INFO L272 TraceCheckUtils]: 8: Hoare triple {12225#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {12225#true} is VALID [2022-02-20 23:47:43,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {12225#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {12225#true} is VALID [2022-02-20 23:47:43,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {12225#true} assume !#t~short4; {12225#true} is VALID [2022-02-20 23:47:43,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {12225#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {12263#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} is VALID [2022-02-20 23:47:43,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {12263#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {12267#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:43,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {12267#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {12271#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:43,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {12271#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} assume !!~bvslt32(~counter~0, 3bv32); {12271#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:43,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {12271#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {12278#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:43,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {12278#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {12271#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:43,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {12271#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {12271#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:43,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {12271#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {12288#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:43,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {12288#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} assume !!~bvslt32(~counter~0, 3bv32); {12288#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:43,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {12288#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {12295#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:43,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {12295#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {12288#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:43,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {12288#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {12288#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:43,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {12288#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {12305#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} is VALID [2022-02-20 23:47:43,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {12305#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} assume !!~bvslt32(~counter~0, 3bv32); {12305#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} is VALID [2022-02-20 23:47:43,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {12305#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {12312#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= |create_data_#t~mem9.offset| (_ bv0 32)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} is VALID [2022-02-20 23:47:43,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {12312#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= |create_data_#t~mem9.offset| (_ bv0 32)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))), #length[#t~mem9.base]) && ~bvule32(~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), ~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))))) && ~bvule32(0bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)))); {12226#false} is VALID [2022-02-20 23:47:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:43,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:44,239 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_285) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_285) c_create_data_~data~0.base) .cse2) (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_286) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-02-20 23:47:44,284 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_285) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_286) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse3 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_285) c_create_data_~data~0.base) .cse4)))) (bvule (bvadd (_ bv4 32) .cse2 .cse3) (bvadd (_ bv8 32) .cse2 .cse3))))) is different from false [2022-02-20 23:47:44,347 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_285) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 (_ bv12 32) .cse1)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_285) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_286) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-02-20 23:47:44,431 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_284)) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_283) .cse0 v_ArrVal_285) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_286) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse5) v_ArrVal_285) c_create_data_~data~0.base) .cse5))) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2022-02-20 23:47:44,482 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_284))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_283) .cse1 v_ArrVal_285) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_286) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_284) c_create_data_~data~0.base) .cse7) v_ArrVal_285)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 (_ bv8 32) .cse5) (bvadd .cse4 .cse5 (_ bv12 32)))))) is different from false [2022-02-20 23:47:44,546 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2) v_ArrVal_285)) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_284))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_283) .cse4 v_ArrVal_285) c_create_data_~data~0.base) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_286) c_create_data_~data~0.base) .cse5))))))))) is different from false [2022-02-20 23:47:44,591 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:44,591 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-02-20 23:47:44,601 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:44,602 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2022-02-20 23:47:44,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2022-02-20 23:47:44,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 144 [2022-02-20 23:47:44,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 86 [2022-02-20 23:47:44,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 100 [2022-02-20 23:47:44,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2022-02-20 23:47:44,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:44,786 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-02-20 23:47:44,799 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:44,800 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-02-20 23:47:44,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:44,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 92 treesize of output 56 [2022-02-20 23:47:44,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:44,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 50 treesize of output 32 [2022-02-20 23:47:44,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-20 23:47:44,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {12316#(and (bvule (bvadd |create_data_#t~mem9.offset| (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| |create_data_#t~mem9.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))), #length[#t~mem9.base]) && ~bvule32(~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), ~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))))) && ~bvule32(0bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)))); {12226#false} is VALID [2022-02-20 23:47:45,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {12320#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {12316#(and (bvule (bvadd |create_data_#t~mem9.offset| (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| |create_data_#t~mem9.base|)))} is VALID [2022-02-20 23:47:45,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {12320#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} assume !!~bvslt32(~counter~0, 3bv32); {12320#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} is VALID [2022-02-20 23:47:45,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {12327#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {12320#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} is VALID [2022-02-20 23:47:45,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {12327#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {12327#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is VALID [2022-02-20 23:47:45,630 WARN L290 TraceCheckUtils]: 21: Hoare triple {12334#(and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (select |#length| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (bvadd (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {12327#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is UNKNOWN [2022-02-20 23:47:45,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {12338#(and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {12334#(and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (select |#length| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (bvadd (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:45,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {12338#(and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} assume !!~bvslt32(~counter~0, 3bv32); {12338#(and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} is VALID [2022-02-20 23:47:45,666 WARN L290 TraceCheckUtils]: 18: Hoare triple {12345#(and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {12338#(and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} is UNKNOWN [2022-02-20 23:47:45,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {12345#(and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {12345#(and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} is VALID [2022-02-20 23:47:45,981 WARN L290 TraceCheckUtils]: 16: Hoare triple {12352#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_284) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {12345#(and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} is UNKNOWN [2022-02-20 23:47:45,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {12356#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {12352#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_284) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} is VALID [2022-02-20 23:47:45,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {12356#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} assume !!~bvslt32(~counter~0, 3bv32); {12356#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:45,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {12363#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv12 32)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {12356#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:46,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {12367#(and (bvule (bvadd (_ bv8 32) |create_data_#t~malloc7.offset|) (bvadd |create_data_#t~malloc7.offset| (_ bv12 32))) (bvule (bvadd |create_data_#t~malloc7.offset| (_ bv12 32)) (select |#length| |create_data_#t~malloc7.base|)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {12363#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv12 32)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_286) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:46,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {12225#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {12367#(and (bvule (bvadd (_ bv8 32) |create_data_#t~malloc7.offset|) (bvadd |create_data_#t~malloc7.offset| (_ bv12 32))) (bvule (bvadd |create_data_#t~malloc7.offset| (_ bv12 32)) (select |#length| |create_data_#t~malloc7.base|)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} is VALID [2022-02-20 23:47:46,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {12225#true} assume !#t~short4; {12225#true} is VALID [2022-02-20 23:47:46,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {12225#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {12225#true} is VALID [2022-02-20 23:47:46,021 INFO L272 TraceCheckUtils]: 8: Hoare triple {12225#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {12225#true} is VALID [2022-02-20 23:47:46,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {12225#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {12225#true} is VALID [2022-02-20 23:47:46,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {12225#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {12225#true} is VALID [2022-02-20 23:47:46,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {12225#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {12225#true} is VALID [2022-02-20 23:47:46,022 INFO L290 TraceCheckUtils]: 4: Hoare triple {12225#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {12225#true} is VALID [2022-02-20 23:47:46,022 INFO L290 TraceCheckUtils]: 3: Hoare triple {12225#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {12225#true} is VALID [2022-02-20 23:47:46,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {12225#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {12225#true} is VALID [2022-02-20 23:47:46,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {12225#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {12225#true} is VALID [2022-02-20 23:47:46,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {12225#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {12225#true} is VALID [2022-02-20 23:47:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-02-20 23:47:46,023 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:46,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774658155] [2022-02-20 23:47:46,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774658155] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:46,023 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:46,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2022-02-20 23:47:46,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982870476] [2022-02-20 23:47:46,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:46,024 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:47:46,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:46,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:47,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 34 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:47,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 23:47:47,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:47,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 23:47:47,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2022-02-20 23:47:47,966 INFO L87 Difference]: Start difference. First operand 236 states and 275 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:00,275 INFO L93 Difference]: Finished difference Result 248 states and 287 transitions. [2022-02-20 23:48:00,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:48:00,275 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:48:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 183 transitions. [2022-02-20 23:48:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 183 transitions. [2022-02-20 23:48:00,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 183 transitions. [2022-02-20 23:48:00,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:00,490 INFO L225 Difference]: With dead ends: 248 [2022-02-20 23:48:00,490 INFO L226 Difference]: Without dead ends: 248 [2022-02-20 23:48:00,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=239, Unknown=6, NotChecked=222, Total=552 [2022-02-20 23:48:00,491 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 18 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 563 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:00,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1268 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 641 Invalid, 0 Unknown, 563 Unchecked, 3.1s Time] [2022-02-20 23:48:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-02-20 23:48:00,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2022-02-20 23:48:00,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:00,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 246 states, 182 states have (on average 1.543956043956044) internal successors, (281), 241 states have internal predecessors, (281), 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:48:00,496 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 246 states, 182 states have (on average 1.543956043956044) internal successors, (281), 241 states have internal predecessors, (281), 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:48:00,496 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 246 states, 182 states have (on average 1.543956043956044) internal successors, (281), 241 states have internal predecessors, (281), 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:48:00,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:00,500 INFO L93 Difference]: Finished difference Result 248 states and 287 transitions. [2022-02-20 23:48:00,500 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 287 transitions. [2022-02-20 23:48:00,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:00,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:00,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 182 states have (on average 1.543956043956044) internal successors, (281), 241 states have internal predecessors, (281), 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) Second operand 248 states. [2022-02-20 23:48:00,502 INFO L87 Difference]: Start difference. First operand has 246 states, 182 states have (on average 1.543956043956044) internal successors, (281), 241 states have internal predecessors, (281), 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) Second operand 248 states. [2022-02-20 23:48:00,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:00,506 INFO L93 Difference]: Finished difference Result 248 states and 287 transitions. [2022-02-20 23:48:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 287 transitions. [2022-02-20 23:48:00,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:00,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:00,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:00,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 182 states have (on average 1.543956043956044) internal successors, (281), 241 states have internal predecessors, (281), 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:48:00,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 285 transitions. [2022-02-20 23:48:00,511 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 285 transitions. Word has length 27 [2022-02-20 23:48:00,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:00,511 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 285 transitions. [2022-02-20 23:48:00,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 285 transitions. [2022-02-20 23:48:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:48:00,512 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:00,512 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:00,527 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:48:00,723 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:48:00,723 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:48:00,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1508640986, now seen corresponding path program 3 times [2022-02-20 23:48:00,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:00,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089655520] [2022-02-20 23:48:00,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:48:00,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:00,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:00,725 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:48:00,727 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:48:00,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 23:48:00,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:48:00,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:48:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:01,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:01,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {13406#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {13406#true} is VALID [2022-02-20 23:48:01,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {13406#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {13406#true} is VALID [2022-02-20 23:48:01,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {13406#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {13406#true} is VALID [2022-02-20 23:48:01,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {13406#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {13406#true} is VALID [2022-02-20 23:48:01,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {13406#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {13406#true} is VALID [2022-02-20 23:48:01,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {13406#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {13406#true} is VALID [2022-02-20 23:48:01,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {13406#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {13406#true} is VALID [2022-02-20 23:48:01,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {13406#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {13406#true} is VALID [2022-02-20 23:48:01,171 INFO L272 TraceCheckUtils]: 8: Hoare triple {13406#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {13406#true} is VALID [2022-02-20 23:48:01,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {13406#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {13406#true} is VALID [2022-02-20 23:48:01,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {13406#true} assume !#t~short4; {13406#true} is VALID [2022-02-20 23:48:01,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {13406#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {13406#true} is VALID [2022-02-20 23:48:01,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {13406#true} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {13406#true} is VALID [2022-02-20 23:48:01,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {13406#true} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {13450#(= create_data_~counter~0 (_ bv0 32))} is VALID [2022-02-20 23:48:01,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {13450#(= create_data_~counter~0 (_ bv0 32))} assume !!~bvslt32(~counter~0, 3bv32); {13450#(= create_data_~counter~0 (_ bv0 32))} is VALID [2022-02-20 23:48:01,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {13450#(= create_data_~counter~0 (_ bv0 32))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {13450#(= create_data_~counter~0 (_ bv0 32))} is VALID [2022-02-20 23:48:01,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {13450#(= create_data_~counter~0 (_ bv0 32))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {13450#(= create_data_~counter~0 (_ bv0 32))} is VALID [2022-02-20 23:48:01,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {13450#(= create_data_~counter~0 (_ bv0 32))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {13450#(= create_data_~counter~0 (_ bv0 32))} is VALID [2022-02-20 23:48:01,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {13450#(= create_data_~counter~0 (_ bv0 32))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {13466#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} is VALID [2022-02-20 23:48:01,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {13466#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} assume !!~bvslt32(~counter~0, 3bv32); {13466#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} is VALID [2022-02-20 23:48:01,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {13466#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {13466#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} is VALID [2022-02-20 23:48:01,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {13466#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {13466#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} is VALID [2022-02-20 23:48:01,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {13466#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {13466#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} is VALID [2022-02-20 23:48:01,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {13466#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {13482#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} is VALID [2022-02-20 23:48:01,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {13482#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} assume !!~bvslt32(~counter~0, 3bv32); {13482#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} is VALID [2022-02-20 23:48:01,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {13482#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {13482#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} is VALID [2022-02-20 23:48:01,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {13482#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {13482#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} is VALID [2022-02-20 23:48:01,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {13482#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {13482#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} is VALID [2022-02-20 23:48:01,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {13482#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {13498#(= (bvadd create_data_~counter~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2022-02-20 23:48:01,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {13498#(= (bvadd create_data_~counter~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~counter~0, 3bv32); {13407#false} is VALID [2022-02-20 23:48:01,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {13407#false} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {13407#false} is VALID [2022-02-20 23:48:01,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {13407#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))), #length[#t~mem9.base]) && ~bvule32(~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), ~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))))) && ~bvule32(0bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)))); {13407#false} is VALID [2022-02-20 23:48:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:01,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:48:01,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {13407#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))), #length[#t~mem9.base]) && ~bvule32(~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), ~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))))) && ~bvule32(0bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)))); {13407#false} is VALID [2022-02-20 23:48:01,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {13407#false} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {13407#false} is VALID [2022-02-20 23:48:01,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {13514#(not (bvslt create_data_~counter~0 (_ bv3 32)))} assume !!~bvslt32(~counter~0, 3bv32); {13407#false} is VALID [2022-02-20 23:48:01,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {13518#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {13514#(not (bvslt create_data_~counter~0 (_ bv3 32)))} is VALID [2022-02-20 23:48:01,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {13518#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {13518#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 23:48:01,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {13518#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {13518#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 23:48:01,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {13518#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {13518#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 23:48:01,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {13518#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} assume !!~bvslt32(~counter~0, 3bv32); {13518#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 23:48:01,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {13534#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {13518#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 23:48:01,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {13534#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {13534#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} is VALID [2022-02-20 23:48:01,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {13534#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {13534#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} is VALID [2022-02-20 23:48:01,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {13534#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {13534#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} is VALID [2022-02-20 23:48:01,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {13534#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} assume !!~bvslt32(~counter~0, 3bv32); {13534#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} is VALID [2022-02-20 23:48:01,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {13550#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {13534#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} is VALID [2022-02-20 23:48:01,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {13550#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {13550#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} is VALID [2022-02-20 23:48:01,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {13550#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {13550#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} is VALID [2022-02-20 23:48:01,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {13550#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {13550#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} is VALID [2022-02-20 23:48:01,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {13550#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} assume !!~bvslt32(~counter~0, 3bv32); {13550#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} is VALID [2022-02-20 23:48:01,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {13406#true} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {13550#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} is VALID [2022-02-20 23:48:01,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {13406#true} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {13406#true} is VALID [2022-02-20 23:48:01,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {13406#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {13406#true} is VALID [2022-02-20 23:48:01,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {13406#true} assume !#t~short4; {13406#true} is VALID [2022-02-20 23:48:01,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {13406#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {13406#true} is VALID [2022-02-20 23:48:01,357 INFO L272 TraceCheckUtils]: 8: Hoare triple {13406#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {13406#true} is VALID [2022-02-20 23:48:01,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {13406#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {13406#true} is VALID [2022-02-20 23:48:01,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {13406#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {13406#true} is VALID [2022-02-20 23:48:01,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {13406#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {13406#true} is VALID [2022-02-20 23:48:01,358 INFO L290 TraceCheckUtils]: 4: Hoare triple {13406#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {13406#true} is VALID [2022-02-20 23:48:01,358 INFO L290 TraceCheckUtils]: 3: Hoare triple {13406#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {13406#true} is VALID [2022-02-20 23:48:01,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {13406#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {13406#true} is VALID [2022-02-20 23:48:01,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {13406#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {13406#true} is VALID [2022-02-20 23:48:01,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {13406#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {13406#true} is VALID [2022-02-20 23:48:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:01,359 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:01,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089655520] [2022-02-20 23:48:01,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089655520] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:48:01,359 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:48:01,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-02-20 23:48:01,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737523179] [2022-02-20 23:48:01,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:48:01,360 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-02-20 23:48:01,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:01,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:01,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:01,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:48:01,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:01,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:48:01,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:48:01,437 INFO L87 Difference]: Start difference. First operand 246 states and 285 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:02,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:02,877 INFO L93 Difference]: Finished difference Result 243 states and 279 transitions. [2022-02-20 23:48:02,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:02,877 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-02-20 23:48:02,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2022-02-20 23:48:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2022-02-20 23:48:02,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 179 transitions. [2022-02-20 23:48:03,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:03,059 INFO L225 Difference]: With dead ends: 243 [2022-02-20 23:48:03,059 INFO L226 Difference]: Without dead ends: 243 [2022-02-20 23:48:03,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:48:03,059 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 96 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:03,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 794 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-02-20 23:48:03,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2022-02-20 23:48:03,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:03,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand has 241 states, 178 states have (on average 1.5337078651685394) internal successors, (273), 236 states have internal predecessors, (273), 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:48:03,064 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand has 241 states, 178 states have (on average 1.5337078651685394) internal successors, (273), 236 states have internal predecessors, (273), 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:48:03,065 INFO L87 Difference]: Start difference. First operand 243 states. Second operand has 241 states, 178 states have (on average 1.5337078651685394) internal successors, (273), 236 states have internal predecessors, (273), 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:48:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:03,069 INFO L93 Difference]: Finished difference Result 243 states and 279 transitions. [2022-02-20 23:48:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 279 transitions. [2022-02-20 23:48:03,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:03,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:03,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 241 states, 178 states have (on average 1.5337078651685394) internal successors, (273), 236 states have internal predecessors, (273), 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) Second operand 243 states. [2022-02-20 23:48:03,070 INFO L87 Difference]: Start difference. First operand has 241 states, 178 states have (on average 1.5337078651685394) internal successors, (273), 236 states have internal predecessors, (273), 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) Second operand 243 states. [2022-02-20 23:48:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:03,074 INFO L93 Difference]: Finished difference Result 243 states and 279 transitions. [2022-02-20 23:48:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 279 transitions. [2022-02-20 23:48:03,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:03,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:03,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:03,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 178 states have (on average 1.5337078651685394) internal successors, (273), 236 states have internal predecessors, (273), 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:48:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 277 transitions. [2022-02-20 23:48:03,079 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 277 transitions. Word has length 32 [2022-02-20 23:48:03,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:03,079 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 277 transitions. [2022-02-20 23:48:03,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 277 transitions. [2022-02-20 23:48:03,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 23:48:03,080 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:03,081 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:03,095 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:48:03,291 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:48:03,292 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr24REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:48:03,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:03,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1091018630, now seen corresponding path program 1 times [2022-02-20 23:48:03,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:03,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63449921] [2022-02-20 23:48:03,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:03,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:03,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:03,294 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:48:03,294 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:48:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:03,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:48:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:03,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:03,585 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:48:03,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {14574#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {14574#true} is VALID [2022-02-20 23:48:03,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {14574#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {14574#true} is VALID [2022-02-20 23:48:03,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {14574#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {14574#true} is VALID [2022-02-20 23:48:03,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {14574#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {14574#true} is VALID [2022-02-20 23:48:03,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {14574#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {14574#true} is VALID [2022-02-20 23:48:03,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {14574#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {14574#true} is VALID [2022-02-20 23:48:03,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {14574#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {14574#true} is VALID [2022-02-20 23:48:03,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {14574#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {14574#true} is VALID [2022-02-20 23:48:03,593 INFO L272 TraceCheckUtils]: 8: Hoare triple {14574#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {14574#true} is VALID [2022-02-20 23:48:03,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {14574#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {14574#true} is VALID [2022-02-20 23:48:03,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {14574#true} assume !#t~short4; {14574#true} is VALID [2022-02-20 23:48:03,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {14574#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {14574#true} is VALID [2022-02-20 23:48:03,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {14574#true} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {14574#true} is VALID [2022-02-20 23:48:03,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {14574#true} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {14574#true} is VALID [2022-02-20 23:48:03,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {14574#true} assume !!~bvslt32(~counter~0, 3bv32); {14574#true} is VALID [2022-02-20 23:48:03,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {14574#true} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {14574#true} is VALID [2022-02-20 23:48:03,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {14574#true} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {14574#true} is VALID [2022-02-20 23:48:03,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {14574#true} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {14574#true} is VALID [2022-02-20 23:48:03,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {14574#true} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {14574#true} is VALID [2022-02-20 23:48:03,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {14574#true} assume !!~bvslt32(~counter~0, 3bv32); {14574#true} is VALID [2022-02-20 23:48:03,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {14574#true} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {14574#true} is VALID [2022-02-20 23:48:03,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {14574#true} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {14574#true} is VALID [2022-02-20 23:48:03,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {14574#true} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {14574#true} is VALID [2022-02-20 23:48:03,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {14574#true} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {14574#true} is VALID [2022-02-20 23:48:03,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {14574#true} assume !!~bvslt32(~counter~0, 3bv32); {14574#true} is VALID [2022-02-20 23:48:03,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {14574#true} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {14574#true} is VALID [2022-02-20 23:48:03,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {14574#true} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {14574#true} is VALID [2022-02-20 23:48:03,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {14574#true} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {14574#true} is VALID [2022-02-20 23:48:03,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {14574#true} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {14574#true} is VALID [2022-02-20 23:48:03,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {14574#true} assume !~bvslt32(~counter~0, 3bv32); {14574#true} is VALID [2022-02-20 23:48:03,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {14574#true} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~data~0.offset, 4bv32); srcloc: L558-4 {14574#true} is VALID [2022-02-20 23:48:03,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {14574#true} ~userInput~0 := #t~nondet11;havoc #t~nondet11; {14574#true} is VALID [2022-02-20 23:48:03,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {14574#true} #t~short14 := 0bv32 != #t~nondet12; {14574#true} is VALID [2022-02-20 23:48:03,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {14574#true} assume !#t~short14; {14574#true} is VALID [2022-02-20 23:48:03,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {14574#true} #t~short16 := #t~short14; {14574#true} is VALID [2022-02-20 23:48:03,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {14574#true} assume !#t~short16; {14574#true} is VALID [2022-02-20 23:48:03,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {14574#true} assume !((#t~short16 && ~bvslt32(~userInput~0, 200bv32)) && ~bvsgt32(~userInput~0, 4294967096bv32));havoc #t~nondet12;havoc #t~mem13;havoc #t~short14;havoc #t~mem15;havoc #t~short16; {14574#true} is VALID [2022-02-20 23:48:03,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {14574#true} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~bvadd32(8bv32, ~data~0.offset), 4bv32); srcloc: L563-13 {14574#true} is VALID [2022-02-20 23:48:03,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {14574#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~data~0.base, ~bvadd32(12bv32, ~data~0.offset), 4bv32); srcloc: L567 {14574#true} is VALID [2022-02-20 23:48:03,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {14574#true} ~origData~0.base, ~origData~0.offset := ~data~0.base, ~data~0.offset; {14574#true} is VALID [2022-02-20 23:48:03,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {14574#true} assume !!(0bv32 != #t~nondet20);havoc #t~nondet20;call #t~malloc21.base, #t~malloc21.offset := #Ultimate.allocOnHeap(16bv32);~nextData~0.base, ~nextData~0.offset := #t~malloc21.base, #t~malloc21.offset;havoc #t~malloc21.base, #t~malloc21.offset; {14699#(= (select |#valid| create_data_~nextData~0.base) (_ bv1 1))} is VALID [2022-02-20 23:48:03,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {14699#(= (select |#valid| create_data_~nextData~0.base) (_ bv1 1))} assume !(1bv1 == #valid[~nextData~0.base]); {14575#false} is VALID [2022-02-20 23:48:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 23:48:03,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:03,604 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:03,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63449921] [2022-02-20 23:48:03,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63449921] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:03,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:03,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:03,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751980464] [2022-02-20 23:48:03,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:03,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 23:48:03,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:03,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:03,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:03,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:03,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:03,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:03,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:03,638 INFO L87 Difference]: Start difference. First operand 241 states and 277 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:04,250 INFO L93 Difference]: Finished difference Result 243 states and 271 transitions. [2022-02-20 23:48:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:04,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 23:48:04,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:04,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2022-02-20 23:48:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2022-02-20 23:48:04,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 172 transitions. [2022-02-20 23:48:04,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:04,437 INFO L225 Difference]: With dead ends: 243 [2022-02-20 23:48:04,437 INFO L226 Difference]: Without dead ends: 243 [2022-02-20 23:48:04,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:04,438 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 22 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:04,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 235 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-02-20 23:48:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 237. [2022-02-20 23:48:04,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:04,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand has 237 states, 178 states have (on average 1.4662921348314606) internal successors, (261), 232 states have internal predecessors, (261), 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:48:04,442 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand has 237 states, 178 states have (on average 1.4662921348314606) internal successors, (261), 232 states have internal predecessors, (261), 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:48:04,442 INFO L87 Difference]: Start difference. First operand 243 states. Second operand has 237 states, 178 states have (on average 1.4662921348314606) internal successors, (261), 232 states have internal predecessors, (261), 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:48:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:04,446 INFO L93 Difference]: Finished difference Result 243 states and 271 transitions. [2022-02-20 23:48:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 271 transitions. [2022-02-20 23:48:04,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:04,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:04,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 237 states, 178 states have (on average 1.4662921348314606) internal successors, (261), 232 states have internal predecessors, (261), 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) Second operand 243 states. [2022-02-20 23:48:04,448 INFO L87 Difference]: Start difference. First operand has 237 states, 178 states have (on average 1.4662921348314606) internal successors, (261), 232 states have internal predecessors, (261), 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) Second operand 243 states. [2022-02-20 23:48:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:04,452 INFO L93 Difference]: Finished difference Result 243 states and 271 transitions. [2022-02-20 23:48:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 271 transitions. [2022-02-20 23:48:04,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:04,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:04,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:04,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 178 states have (on average 1.4662921348314606) internal successors, (261), 232 states have internal predecessors, (261), 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:48:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 265 transitions. [2022-02-20 23:48:04,457 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 265 transitions. Word has length 42 [2022-02-20 23:48:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:04,457 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 265 transitions. [2022-02-20 23:48:04,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 265 transitions. [2022-02-20 23:48:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 23:48:04,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:04,458 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:04,473 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:48:04,669 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:48:04,669 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr25REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:48:04,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:04,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1091018631, now seen corresponding path program 1 times [2022-02-20 23:48:04,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:04,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584872907] [2022-02-20 23:48:04,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:04,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:04,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:04,671 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:48:04,671 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:48:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:04,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:48:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:04,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:04,924 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:48:04,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {15668#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {15668#true} is VALID [2022-02-20 23:48:04,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {15668#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {15668#true} is VALID [2022-02-20 23:48:04,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {15668#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {15668#true} is VALID [2022-02-20 23:48:04,936 INFO L290 TraceCheckUtils]: 3: Hoare triple {15668#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {15668#true} is VALID [2022-02-20 23:48:04,936 INFO L290 TraceCheckUtils]: 4: Hoare triple {15668#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {15668#true} is VALID [2022-02-20 23:48:04,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {15668#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {15668#true} is VALID [2022-02-20 23:48:04,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {15668#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {15668#true} is VALID [2022-02-20 23:48:04,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {15668#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {15668#true} is VALID [2022-02-20 23:48:04,937 INFO L272 TraceCheckUtils]: 8: Hoare triple {15668#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {15668#true} is VALID [2022-02-20 23:48:04,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {15668#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {15668#true} is VALID [2022-02-20 23:48:04,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {15668#true} assume !#t~short4; {15668#true} is VALID [2022-02-20 23:48:04,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {15668#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {15668#true} is VALID [2022-02-20 23:48:04,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {15668#true} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {15668#true} is VALID [2022-02-20 23:48:04,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {15668#true} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {15668#true} is VALID [2022-02-20 23:48:04,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {15668#true} assume !!~bvslt32(~counter~0, 3bv32); {15668#true} is VALID [2022-02-20 23:48:04,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {15668#true} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {15668#true} is VALID [2022-02-20 23:48:04,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {15668#true} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {15668#true} is VALID [2022-02-20 23:48:04,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {15668#true} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {15668#true} is VALID [2022-02-20 23:48:04,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {15668#true} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {15668#true} is VALID [2022-02-20 23:48:04,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {15668#true} assume !!~bvslt32(~counter~0, 3bv32); {15668#true} is VALID [2022-02-20 23:48:04,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {15668#true} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {15668#true} is VALID [2022-02-20 23:48:04,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {15668#true} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {15668#true} is VALID [2022-02-20 23:48:04,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {15668#true} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {15668#true} is VALID [2022-02-20 23:48:04,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {15668#true} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {15668#true} is VALID [2022-02-20 23:48:04,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {15668#true} assume !!~bvslt32(~counter~0, 3bv32); {15668#true} is VALID [2022-02-20 23:48:04,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {15668#true} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {15668#true} is VALID [2022-02-20 23:48:04,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {15668#true} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {15668#true} is VALID [2022-02-20 23:48:04,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {15668#true} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {15668#true} is VALID [2022-02-20 23:48:04,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {15668#true} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {15668#true} is VALID [2022-02-20 23:48:04,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {15668#true} assume !~bvslt32(~counter~0, 3bv32); {15668#true} is VALID [2022-02-20 23:48:04,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {15668#true} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~data~0.offset, 4bv32); srcloc: L558-4 {15668#true} is VALID [2022-02-20 23:48:04,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {15668#true} ~userInput~0 := #t~nondet11;havoc #t~nondet11; {15668#true} is VALID [2022-02-20 23:48:04,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {15668#true} #t~short14 := 0bv32 != #t~nondet12; {15668#true} is VALID [2022-02-20 23:48:04,940 INFO L290 TraceCheckUtils]: 33: Hoare triple {15668#true} assume !#t~short14; {15668#true} is VALID [2022-02-20 23:48:04,941 INFO L290 TraceCheckUtils]: 34: Hoare triple {15668#true} #t~short16 := #t~short14; {15668#true} is VALID [2022-02-20 23:48:04,941 INFO L290 TraceCheckUtils]: 35: Hoare triple {15668#true} assume !#t~short16; {15668#true} is VALID [2022-02-20 23:48:04,941 INFO L290 TraceCheckUtils]: 36: Hoare triple {15668#true} assume !((#t~short16 && ~bvslt32(~userInput~0, 200bv32)) && ~bvsgt32(~userInput~0, 4294967096bv32));havoc #t~nondet12;havoc #t~mem13;havoc #t~short14;havoc #t~mem15;havoc #t~short16; {15668#true} is VALID [2022-02-20 23:48:04,941 INFO L290 TraceCheckUtils]: 37: Hoare triple {15668#true} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~bvadd32(8bv32, ~data~0.offset), 4bv32); srcloc: L563-13 {15668#true} is VALID [2022-02-20 23:48:04,941 INFO L290 TraceCheckUtils]: 38: Hoare triple {15668#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~data~0.base, ~bvadd32(12bv32, ~data~0.offset), 4bv32); srcloc: L567 {15668#true} is VALID [2022-02-20 23:48:04,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {15668#true} ~origData~0.base, ~origData~0.offset := ~data~0.base, ~data~0.offset; {15668#true} is VALID [2022-02-20 23:48:04,943 INFO L290 TraceCheckUtils]: 40: Hoare triple {15668#true} assume !!(0bv32 != #t~nondet20);havoc #t~nondet20;call #t~malloc21.base, #t~malloc21.offset := #Ultimate.allocOnHeap(16bv32);~nextData~0.base, ~nextData~0.offset := #t~malloc21.base, #t~malloc21.offset;havoc #t~malloc21.base, #t~malloc21.offset; {15793#(and (= (_ bv16 32) (select |#length| create_data_~nextData~0.base)) (= create_data_~nextData~0.offset (_ bv0 32)))} is VALID [2022-02-20 23:48:04,943 INFO L290 TraceCheckUtils]: 41: Hoare triple {15793#(and (= (_ bv16 32) (select |#length| create_data_~nextData~0.base)) (= create_data_~nextData~0.offset (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, ~nextData~0.offset)), #length[~nextData~0.base]) && ~bvule32(~bvadd32(4bv32, ~nextData~0.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, ~nextData~0.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, ~nextData~0.offset))); {15669#false} is VALID [2022-02-20 23:48:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 23:48:04,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:04,944 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:04,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584872907] [2022-02-20 23:48:04,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584872907] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:04,944 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:04,944 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:04,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963003848] [2022-02-20 23:48:04,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:04,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 23:48:04,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:04,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:04,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:04,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:04,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:04,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:04,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:04,979 INFO L87 Difference]: Start difference. First operand 237 states and 265 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:05,611 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2022-02-20 23:48:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:05,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 23:48:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2022-02-20 23:48:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2022-02-20 23:48:05,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2022-02-20 23:48:05,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:05,775 INFO L225 Difference]: With dead ends: 239 [2022-02-20 23:48:05,775 INFO L226 Difference]: Without dead ends: 239 [2022-02-20 23:48:05,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:05,776 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 18 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:05,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 234 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-02-20 23:48:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2022-02-20 23:48:05,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:05,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 233 states, 178 states have (on average 1.398876404494382) internal successors, (249), 228 states have internal predecessors, (249), 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:48:05,781 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 233 states, 178 states have (on average 1.398876404494382) internal successors, (249), 228 states have internal predecessors, (249), 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:48:05,781 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 233 states, 178 states have (on average 1.398876404494382) internal successors, (249), 228 states have internal predecessors, (249), 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:48:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:05,785 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2022-02-20 23:48:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 259 transitions. [2022-02-20 23:48:05,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:05,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:05,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 178 states have (on average 1.398876404494382) internal successors, (249), 228 states have internal predecessors, (249), 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) Second operand 239 states. [2022-02-20 23:48:05,786 INFO L87 Difference]: Start difference. First operand has 233 states, 178 states have (on average 1.398876404494382) internal successors, (249), 228 states have internal predecessors, (249), 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) Second operand 239 states. [2022-02-20 23:48:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:05,790 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2022-02-20 23:48:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 259 transitions. [2022-02-20 23:48:05,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:05,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:05,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:05,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 178 states have (on average 1.398876404494382) internal successors, (249), 228 states have internal predecessors, (249), 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:48:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2022-02-20 23:48:05,795 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 42 [2022-02-20 23:48:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:05,796 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2022-02-20 23:48:05,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2022-02-20 23:48:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 23:48:05,797 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:05,797 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:05,811 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:48:06,007 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:48:06,008 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:48:06,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1777365236, now seen corresponding path program 1 times [2022-02-20 23:48:06,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:06,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016543913] [2022-02-20 23:48:06,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:06,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:06,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:06,013 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:48:06,015 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:48:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:06,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:48:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:06,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:06,288 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:48:06,365 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 13 treesize of output 9 [2022-02-20 23:48:06,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-02-20 23:48:06,799 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-02-20 23:48:06,799 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 4 case distinctions, treesize of input 20 treesize of output 36 [2022-02-20 23:48:06,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {16746#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {16746#true} is VALID [2022-02-20 23:48:06,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {16746#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {16746#true} is VALID [2022-02-20 23:48:06,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {16746#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {16757#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:06,996 INFO L290 TraceCheckUtils]: 3: Hoare triple {16757#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {16757#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:06,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {16757#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L589-1 {16757#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:06,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {16757#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {16757#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:06,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {16757#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L590 {16757#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:06,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {16757#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {16757#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:06,998 INFO L272 TraceCheckUtils]: 8: Hoare triple {16757#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {16776#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:48:06,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {16776#(= |old(#valid)| |#valid|)} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {16776#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:48:06,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {16776#(= |old(#valid)| |#valid|)} assume !#t~short4; {16776#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:48:07,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {16776#(= |old(#valid)| |#valid|)} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {16786#(and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_666 (_ BitVec 1))) (= |#valid| (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) |create_data_#t~malloc7.base| (_ bv1 1)))))} is VALID [2022-02-20 23:48:07,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {16786#(and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_666 (_ BitVec 1))) (= |#valid| (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) |create_data_#t~malloc7.base| (_ bv1 1)))))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {16790#(and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_666 (_ BitVec 1))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {16790#(and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_666 (_ BitVec 1))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv1 1)) |#valid|)))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {16790#(and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_666 (_ BitVec 1))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {16790#(and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_666 (_ BitVec 1))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv1 1)) |#valid|)))} assume !!~bvslt32(~counter~0, 3bv32); {16790#(and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_666 (_ BitVec 1))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {16790#(and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_666 (_ BitVec 1))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv1 1)) |#valid|)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} assume !!~bvslt32(~counter~0, 3bv32); {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} assume !!~bvslt32(~counter~0, 3bv32); {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} assume !~bvslt32(~counter~0, 3bv32); {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~data~0.offset, 4bv32); srcloc: L558-4 {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} ~userInput~0 := #t~nondet11;havoc #t~nondet11; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} #t~short14 := 0bv32 != #t~nondet12; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} assume !#t~short14; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} #t~short16 := #t~short14; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} assume !#t~short16; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,042 INFO L290 TraceCheckUtils]: 36: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} assume !((#t~short16 && ~bvslt32(~userInput~0, 200bv32)) && ~bvsgt32(~userInput~0, 4294967096bv32));havoc #t~nondet12;havoc #t~mem13;havoc #t~short14;havoc #t~mem15;havoc #t~short16; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~bvadd32(8bv32, ~data~0.offset), 4bv32); srcloc: L563-13 {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~data~0.base, ~bvadd32(12bv32, ~data~0.offset), 4bv32); srcloc: L567 {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,049 INFO L290 TraceCheckUtils]: 39: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} ~origData~0.base, ~origData~0.offset := ~data~0.base, ~data~0.offset; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} assume !(0bv32 != #t~nondet20);havoc #t~nondet20; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,050 INFO L290 TraceCheckUtils]: 41: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} #res.base, #res.offset := ~origData~0.base, ~origData~0.offset; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} assume true; {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:48:07,053 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16800#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (_ bv0 1) (select |old(#valid)| create_data_~data~0.base)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} {16757#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} #275#return; {16757#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:07,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {16757#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[append_~node~0#1.base]); {16747#false} is VALID [2022-02-20 23:48:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 23:48:07,054 INFO L328 TraceCheckSpWp]: Computing backward predicates...