./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:47:05,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:47:05,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:47:05,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:47:05,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:47:05,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:47:05,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:47:05,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:47:05,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:47:05,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:47:05,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:47:05,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:47:05,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:47:05,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:47:05,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:47:05,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:47:05,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:47:05,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:47:05,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:47:05,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:47:05,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:47:05,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:47:05,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:47:05,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:47:05,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:47:05,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:47:05,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:47:05,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:47:05,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:47:05,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:47:05,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:47:05,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:47:05,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:47:05,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:47:05,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:47:05,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:47:05,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:47:05,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:47:05,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:47:05,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:47:05,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:47:05,800 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:05,814 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:47:05,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:47:05,814 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:47:05,816 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:47:05,817 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:47:05,817 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:47:05,818 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:47:05,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:47:05,818 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:47:05,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:47:05,819 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:47:05,819 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:47:05,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:47:05,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:47:05,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:47:05,820 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:47:05,820 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:47:05,820 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:47:05,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:47:05,820 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:47:05,821 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:47:05,821 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:47:05,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:47:05,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:47:05,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:47:05,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:05,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:47:05,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:47:05,822 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:47:05,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:47:05,822 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 -> cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d [2022-02-20 23:47:06,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:47:06,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:47:06,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:47:06,022 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:47:06,022 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:47:06,023 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-2.i [2022-02-20 23:47:06,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d876d4de7/e899a68beacc45618cdcd878dbb51951/FLAG797b01111 [2022-02-20 23:47:06,445 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:47:06,445 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2022-02-20 23:47:06,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d876d4de7/e899a68beacc45618cdcd878dbb51951/FLAG797b01111 [2022-02-20 23:47:06,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d876d4de7/e899a68beacc45618cdcd878dbb51951 [2022-02-20 23:47:06,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:47:06,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:47:06,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:06,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:47:06,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:47:06,474 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,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e9a4caa 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,475 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,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:47:06,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:47:06,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:06,741 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:06,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@137bdbbf 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,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:06,743 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:47:06,745 INFO L158 Benchmark]: Toolchain (without parser) took 276.32ms. Allocated memory is still 102.8MB. Free memory was 74.1MB in the beginning and 74.8MB in the end (delta: -687.9kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:47:06,746 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory is still 57.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:47:06,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.10ms. Allocated memory is still 102.8MB. Free memory was 73.9MB in the beginning and 74.8MB in the end (delta: -931.6kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:47:06,748 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.15ms. Allocated memory is still 102.8MB. Free memory is still 57.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.10ms. Allocated memory is still 102.8MB. Free memory was 73.9MB in the beginning and 74.8MB in the end (delta: -931.6kB). Peak memory consumption was 6.3MB. 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:47:08,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:47:08,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:47:08,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:47:08,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:47:08,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:47:08,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:47:08,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:47:08,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:47:08,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:47:08,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:47:08,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:47:08,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:47:08,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:47:08,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:47:08,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:47:08,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:47:08,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:47:08,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:47:08,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:47:08,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:47:08,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:47:08,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:47:08,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:47:08,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:47:08,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:47:08,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:47:08,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:47:08,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:47:08,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:47:08,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:47:08,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:47:08,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:47:08,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:47:08,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:47:08,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:47:08,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:47:08,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:47:08,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:47:08,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:47:08,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:47:08,270 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:08,302 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:47:08,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:47:08,303 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:47:08,303 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:47:08,304 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:47:08,304 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:47:08,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:47:08,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:47:08,305 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:47:08,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:47:08,306 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:47:08,306 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:47:08,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:47:08,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:47:08,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:47:08,307 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:47:08,307 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:47:08,307 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:47:08,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:47:08,307 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:47:08,308 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:47:08,308 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:47:08,308 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:47:08,308 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:47:08,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:47:08,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:47:08,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:47:08,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:08,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:47:08,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:47:08,309 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:47:08,309 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:47:08,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:47:08,310 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 -> cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d [2022-02-20 23:47:08,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:47:08,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:47:08,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:47:08,583 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:47:08,584 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:47:08,585 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-2.i [2022-02-20 23:47:08,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45eb9a7ae/45d541dc71e945d7975f58921d25fecb/FLAG8c1bd2ff3 [2022-02-20 23:47:09,029 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:47:09,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2022-02-20 23:47:09,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45eb9a7ae/45d541dc71e945d7975f58921d25fecb/FLAG8c1bd2ff3 [2022-02-20 23:47:09,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45eb9a7ae/45d541dc71e945d7975f58921d25fecb [2022-02-20 23:47:09,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:47:09,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:47:09,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:09,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:47:09,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:47:09,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:09" (1/1) ... [2022-02-20 23:47:09,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6038455a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:09, skipping insertion in model container [2022-02-20 23:47:09,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:09" (1/1) ... [2022-02-20 23:47:09,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:47:09,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:47:09,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:09,331 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:47:09,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:47:09,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:09,366 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:47:09,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:09,426 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:47:09,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:09 WrapperNode [2022-02-20 23:47:09,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:09,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:47:09,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:47:09,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:47:09,433 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:09" (1/1) ... [2022-02-20 23:47:09,452 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:09" (1/1) ... [2022-02-20 23:47:09,473 INFO L137 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-02-20 23:47:09,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:47:09,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:47:09,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:47:09,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:47:09,479 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:09" (1/1) ... [2022-02-20 23:47:09,480 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:09" (1/1) ... [2022-02-20 23:47:09,483 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:09" (1/1) ... [2022-02-20 23:47:09,483 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:09" (1/1) ... [2022-02-20 23:47:09,496 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:09" (1/1) ... [2022-02-20 23:47:09,499 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:09" (1/1) ... [2022-02-20 23:47:09,500 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:09" (1/1) ... [2022-02-20 23:47:09,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:47:09,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:47:09,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:47:09,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:47:09,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:09" (1/1) ... [2022-02-20 23:47:09,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:09,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:09,527 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:09,556 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:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:47:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:47:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2022-02-20 23:47:09,571 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2022-02-20 23:47:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:47:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:47:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:47:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:47:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:47:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:47:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:47:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:47:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:47:09,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:47:09,678 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:47:09,679 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:47:10,347 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:47:10,352 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:47:10,352 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 23:47:10,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:10 BoogieIcfgContainer [2022-02-20 23:47:10,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:47:10,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:47:10,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:47:10,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:47:10,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:47:09" (1/3) ... [2022-02-20 23:47:10,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6513a053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:10, skipping insertion in model container [2022-02-20 23:47:10,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:09" (2/3) ... [2022-02-20 23:47:10,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6513a053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:10, skipping insertion in model container [2022-02-20 23:47:10,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:10" (3/3) ... [2022-02-20 23:47:10,363 INFO L111 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2022-02-20 23:47:10,366 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:47:10,367 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2022-02-20 23:47:10,401 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:47:10,407 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:10,407 INFO L340 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2022-02-20 23:47:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 93 states have (on average 2.161290322580645) internal successors, (201), 185 states have internal predecessors, (201), 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:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:47:10,431 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:10,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:47:10,432 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:10,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash 5052905, now seen corresponding path program 1 times [2022-02-20 23:47:10,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:10,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459385738] [2022-02-20 23:47:10,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:10,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:10,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:10,445 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:10,456 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:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:10,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 23:47:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:10,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:10,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {192#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); {192#true} is VALID [2022-02-20 23:47:10,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#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; {192#true} is VALID [2022-02-20 23:47:10,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {192#true} assume !true; {193#false} is VALID [2022-02-20 23:47:10,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {193#false} assume !(1bv1 == #valid[main_~#list~0#1.base]); {193#false} is VALID [2022-02-20 23:47:10,572 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:10,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:10,573 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:10,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459385738] [2022-02-20 23:47:10,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459385738] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:10,573 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:10,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:10,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835459810] [2022-02-20 23:47:10,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:10,578 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:10,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:10,580 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:10,586 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:10,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:47:10,587 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:10,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:47:10,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:47:10,617 INFO L87 Difference]: Start difference. First operand has 189 states, 93 states have (on average 2.161290322580645) internal successors, (201), 185 states have internal predecessors, (201), 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:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:10,903 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2022-02-20 23:47:10,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:47:10,903 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:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:10,905 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:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 205 transitions. [2022-02-20 23:47:10,920 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:10,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 205 transitions. [2022-02-20 23:47:10,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 205 transitions. [2022-02-20 23:47:11,153 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:11,172 INFO L225 Difference]: With dead ends: 189 [2022-02-20 23:47:11,172 INFO L226 Difference]: Without dead ends: 187 [2022-02-20 23:47:11,173 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:11,176 INFO L933 BasicCegarLoop]: 200 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, 200 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:11,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 200 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:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-02-20 23:47:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-02-20 23:47:11,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:11,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 187 states, 92 states have (on average 2.108695652173913) internal successors, (194), 183 states have internal predecessors, (194), 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,215 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 187 states, 92 states have (on average 2.108695652173913) internal successors, (194), 183 states have internal predecessors, (194), 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,216 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 187 states, 92 states have (on average 2.108695652173913) internal successors, (194), 183 states have internal predecessors, (194), 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,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:11,234 INFO L93 Difference]: Finished difference Result 187 states and 198 transitions. [2022-02-20 23:47:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 198 transitions. [2022-02-20 23:47:11,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:11,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:11,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 92 states have (on average 2.108695652173913) internal successors, (194), 183 states have internal predecessors, (194), 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 187 states. [2022-02-20 23:47:11,242 INFO L87 Difference]: Start difference. First operand has 187 states, 92 states have (on average 2.108695652173913) internal successors, (194), 183 states have internal predecessors, (194), 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 187 states. [2022-02-20 23:47:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:11,259 INFO L93 Difference]: Finished difference Result 187 states and 198 transitions. [2022-02-20 23:47:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 198 transitions. [2022-02-20 23:47:11,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:11,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:11,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:11,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 92 states have (on average 2.108695652173913) internal successors, (194), 183 states have internal predecessors, (194), 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,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 198 transitions. [2022-02-20 23:47:11,270 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 198 transitions. Word has length 4 [2022-02-20 23:47:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:11,271 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 198 transitions. [2022-02-20 23:47:11,273 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:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 198 transitions. [2022-02-20 23:47:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:47:11,274 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:11,274 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:47:11,285 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:11,481 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:11,481 INFO L402 AbstractCegarLoop]: === Iteration 2 === 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,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:11,482 INFO L85 PathProgramCache]: Analyzing trace with hash 5050693, now seen corresponding path program 1 times [2022-02-20 23:47:11,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:11,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441441328] [2022-02-20 23:47:11,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:11,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:11,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:11,484 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:11,485 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:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:11,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:47:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:11,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:11,613 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,657 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:47:11,658 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,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {955#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); {955#true} is VALID [2022-02-20 23:47:11,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {955#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; {963#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:11,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {963#(= (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; {967#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:47:11,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {967#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[append_~pointerToList#1.base]); {956#false} is VALID [2022-02-20 23:47:11,678 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,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:11,678 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:11,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441441328] [2022-02-20 23:47:11,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441441328] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:11,682 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:11,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:11,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389212914] [2022-02-20 23:47:11,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:11,684 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,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:11,685 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,689 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,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:11,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:11,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:11,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:11,690 INFO L87 Difference]: Start difference. First operand 187 states and 198 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,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:12,798 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2022-02-20 23:47:12,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:12,798 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,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:12,799 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,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2022-02-20 23:47:12,801 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,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2022-02-20 23:47:12,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 228 transitions. [2022-02-20 23:47:13,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:13,020 INFO L225 Difference]: With dead ends: 207 [2022-02-20 23:47:13,020 INFO L226 Difference]: Without dead ends: 207 [2022-02-20 23:47:13,021 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,021 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 287 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,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 287 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,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-02-20 23:47:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2022-02-20 23:47:13,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:13,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 181 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 177 states have internal predecessors, (188), 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,031 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 181 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 177 states have internal predecessors, (188), 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,031 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 181 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 177 states have internal predecessors, (188), 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,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:13,039 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2022-02-20 23:47:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 219 transitions. [2022-02-20 23:47:13,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:13,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:13,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 177 states have internal predecessors, (188), 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 207 states. [2022-02-20 23:47:13,042 INFO L87 Difference]: Start difference. First operand has 181 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 177 states have internal predecessors, (188), 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 207 states. [2022-02-20 23:47:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:13,047 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2022-02-20 23:47:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 219 transitions. [2022-02-20 23:47:13,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:13,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:13,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:13,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 177 states have internal predecessors, (188), 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,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2022-02-20 23:47:13,053 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 4 [2022-02-20 23:47:13,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:13,053 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2022-02-20 23:47:13,054 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,054 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2022-02-20 23:47:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:47:13,054 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:13,054 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:47:13,066 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:13,263 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:13,263 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:13,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:13,264 INFO L85 PathProgramCache]: Analyzing trace with hash 5050694, now seen corresponding path program 1 times [2022-02-20 23:47:13,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:13,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871341581] [2022-02-20 23:47:13,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:13,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:13,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:13,266 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:13,267 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:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:13,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:47:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:13,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:13,346 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,350 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,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:13,398 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:13,405 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:13,406 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:13,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {1774#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); {1774#true} is VALID [2022-02-20 23:47:13,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#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; {1782#(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:13,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {1782#(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; {1786#(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:13,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {1786#(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)); {1775#false} is VALID [2022-02-20 23:47:13,425 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,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:13,425 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:13,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871341581] [2022-02-20 23:47:13,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871341581] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:13,425 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:13,425 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:13,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119625409] [2022-02-20 23:47:13,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:13,426 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:13,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:13,426 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:13,432 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:13,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:13,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:13,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:13,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:13,433 INFO L87 Difference]: Start difference. First operand 181 states and 192 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:14,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:14,740 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2022-02-20 23:47:14,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:47:14,741 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:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:14,741 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:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-02-20 23:47:14,743 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:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-02-20 23:47:14,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 213 transitions. [2022-02-20 23:47:14,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:14,942 INFO L225 Difference]: With dead ends: 197 [2022-02-20 23:47:14,942 INFO L226 Difference]: Without dead ends: 197 [2022-02-20 23:47:14,942 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:14,942 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 28 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:14,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 344 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:47:14,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-02-20 23:47:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 186. [2022-02-20 23:47:14,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:14,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 186 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 182 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:14,949 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 186 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 182 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:14,950 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 186 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 182 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:14,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:14,953 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2022-02-20 23:47:14,954 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 211 transitions. [2022-02-20 23:47:14,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:14,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:14,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 182 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 197 states. [2022-02-20 23:47:14,955 INFO L87 Difference]: Start difference. First operand has 186 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 182 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 197 states. [2022-02-20 23:47:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:14,959 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2022-02-20 23:47:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 211 transitions. [2022-02-20 23:47:14,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:14,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:14,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:14,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 182 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:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 199 transitions. [2022-02-20 23:47:14,963 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 199 transitions. Word has length 4 [2022-02-20 23:47:14,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:14,964 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 199 transitions. [2022-02-20 23:47:14,964 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:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 199 transitions. [2022-02-20 23:47:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:47:14,964 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:14,964 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:47:14,973 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:15,173 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:15,173 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:15,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:15,174 INFO L85 PathProgramCache]: Analyzing trace with hash 156571597, now seen corresponding path program 1 times [2022-02-20 23:47:15,174 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:15,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378188599] [2022-02-20 23:47:15,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:15,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:15,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:15,177 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:15,178 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:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:15,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:47:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:15,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:15,242 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,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {2568#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); {2568#true} is VALID [2022-02-20 23:47:15,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {2568#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; {2568#true} is VALID [2022-02-20 23:47:15,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {2568#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; {2579#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:15,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {2579#(= (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: L588 {2579#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:15,251 INFO L290 TraceCheckUtils]: 4: Hoare triple {2579#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[append_~node~0#1.base]); {2569#false} is VALID [2022-02-20 23:47:15,251 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:15,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:15,251 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:15,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378188599] [2022-02-20 23:47:15,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378188599] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:15,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:15,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:15,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611776113] [2022-02-20 23:47:15,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:15,253 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,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:15,253 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:15,258 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:15,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:15,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:15,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:15,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:15,259 INFO L87 Difference]: Start difference. First operand 186 states and 199 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,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:15,859 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2022-02-20 23:47:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:15,859 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,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:15,860 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,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2022-02-20 23:47:15,862 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,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2022-02-20 23:47:15,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 219 transitions. [2022-02-20 23:47:16,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:16,081 INFO L225 Difference]: With dead ends: 209 [2022-02-20 23:47:16,081 INFO L226 Difference]: Without dead ends: 209 [2022-02-20 23:47:16,081 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:16,082 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 64 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 232 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:16,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 232 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:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-02-20 23:47:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 184. [2022-02-20 23:47:16,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:16,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 184 states, 97 states have (on average 1.9793814432989691) internal successors, (192), 180 states have internal predecessors, (192), 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:16,086 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 184 states, 97 states have (on average 1.9793814432989691) internal successors, (192), 180 states have internal predecessors, (192), 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:16,087 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 184 states, 97 states have (on average 1.9793814432989691) internal successors, (192), 180 states have internal predecessors, (192), 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:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:16,090 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2022-02-20 23:47:16,091 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 222 transitions. [2022-02-20 23:47:16,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:16,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:16,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 97 states have (on average 1.9793814432989691) internal successors, (192), 180 states have internal predecessors, (192), 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 209 states. [2022-02-20 23:47:16,092 INFO L87 Difference]: Start difference. First operand has 184 states, 97 states have (on average 1.9793814432989691) internal successors, (192), 180 states have internal predecessors, (192), 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 209 states. [2022-02-20 23:47:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:16,096 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2022-02-20 23:47:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 222 transitions. [2022-02-20 23:47:16,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:16,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:16,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:16,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 97 states have (on average 1.9793814432989691) internal successors, (192), 180 states have internal predecessors, (192), 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:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2022-02-20 23:47:16,100 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 5 [2022-02-20 23:47:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:16,100 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2022-02-20 23:47:16,100 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:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2022-02-20 23:47:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:47:16,101 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:16,101 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:47:16,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 23:47:16,307 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:16,307 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:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash 156571598, now seen corresponding path program 1 times [2022-02-20 23:47:16,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:16,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259491357] [2022-02-20 23:47:16,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:16,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:16,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:16,309 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:16,314 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:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:16,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:16,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:16,376 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:16,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {3396#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); {3396#true} is VALID [2022-02-20 23:47:16,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {3396#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; {3396#true} is VALID [2022-02-20 23:47:16,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {3396#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; {3407#(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:16,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {3407#(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: L588 {3407#(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:16,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {3407#(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))); {3397#false} is VALID [2022-02-20 23:47:16,396 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,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:16,396 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:16,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259491357] [2022-02-20 23:47:16,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259491357] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:16,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:16,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:16,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68593188] [2022-02-20 23:47:16,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:16,397 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:16,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:16,397 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:16,404 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:16,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:16,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:16,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:16,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:16,405 INFO L87 Difference]: Start difference. First operand 184 states and 196 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:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:17,083 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2022-02-20 23:47:17,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:17,083 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:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:17,083 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:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2022-02-20 23:47:17,085 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:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2022-02-20 23:47:17,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 190 transitions. [2022-02-20 23:47:17,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:17,254 INFO L225 Difference]: With dead ends: 182 [2022-02-20 23:47:17,254 INFO L226 Difference]: Without dead ends: 182 [2022-02-20 23:47:17,255 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:17,255 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 273 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:17,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 273 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:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-20 23:47:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-02-20 23:47:17,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:17,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 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,260 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 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,260 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 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,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:17,263 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2022-02-20 23:47:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2022-02-20 23:47:17,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:17,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:17,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 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 182 states. [2022-02-20 23:47:17,264 INFO L87 Difference]: Start difference. First operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 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 182 states. [2022-02-20 23:47:17,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:17,272 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2022-02-20 23:47:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2022-02-20 23:47:17,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:17,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:17,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:17,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 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,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2022-02-20 23:47:17,287 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 5 [2022-02-20 23:47:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:17,287 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2022-02-20 23:47:17,287 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:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2022-02-20 23:47:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:47:17,287 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:17,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:17,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-02-20 23:47:17,491 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:17,491 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:17,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:17,492 INFO L85 PathProgramCache]: Analyzing trace with hash 666573431, now seen corresponding path program 1 times [2022-02-20 23:47:17,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:17,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813647545] [2022-02-20 23:47:17,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:17,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:17,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:17,493 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:17,494 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:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:17,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:47:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:17,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:17,579 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:17,613 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:17,614 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:17,670 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:17,683 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:17,724 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:17,726 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:17,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {4141#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); {4141#true} is VALID [2022-02-20 23:47:17,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {4141#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; {4149#(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:17,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {4149#(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; {4153#(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:17,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {4153#(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: L588 {4153#(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:17,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {4153#(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: L588-1 {4160#(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:17,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {4160#(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; {4160#(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:17,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {4160#(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: L589 {4167#(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:17,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {4167#(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; {4142#false} is VALID [2022-02-20 23:47:17,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {4142#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: L592 {4142#false} is VALID [2022-02-20 23:47:17,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {4142#false} assume !(1bv1 == #valid[append_#t~mem28#1.base]); {4142#false} is VALID [2022-02-20 23:47:17,751 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:17,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:17,751 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:17,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813647545] [2022-02-20 23:47:17,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813647545] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:17,751 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:17,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:47:17,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878930283] [2022-02-20 23:47:17,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:17,752 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,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:17,752 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:17,763 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:17,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:17,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:17,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:17,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:17,764 INFO L87 Difference]: Start difference. First operand 182 states and 193 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:19,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,052 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2022-02-20 23:47:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:47:19,052 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:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:19,052 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:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 197 transitions. [2022-02-20 23:47:19,054 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:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 197 transitions. [2022-02-20 23:47:19,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 197 transitions. [2022-02-20 23:47:19,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:19,247 INFO L225 Difference]: With dead ends: 184 [2022-02-20 23:47:19,247 INFO L226 Difference]: Without dead ends: 184 [2022-02-20 23:47:19,247 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:19,248 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 5 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 606 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:19,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 606 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:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-02-20 23:47:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2022-02-20 23:47:19,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:19,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 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:19,252 INFO L74 IsIncluded]: Start isIncluded. First operand 184 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:19,252 INFO L87 Difference]: Start difference. First operand 184 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:19,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,256 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2022-02-20 23:47:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2022-02-20 23:47:19,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:19,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:19,257 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 184 states. [2022-02-20 23:47:19,257 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 184 states. [2022-02-20 23:47:19,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,261 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2022-02-20 23:47:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2022-02-20 23:47:19,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:19,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:19,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:19,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:19,262 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:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 194 transitions. [2022-02-20 23:47:19,265 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 194 transitions. Word has length 10 [2022-02-20 23:47:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:19,265 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 194 transitions. [2022-02-20 23:47:19,266 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:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2022-02-20 23:47:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:47:19,266 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:19,266 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:19,275 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:19,472 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:19,473 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:19,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:19,473 INFO L85 PathProgramCache]: Analyzing trace with hash 623653565, now seen corresponding path program 1 times [2022-02-20 23:47:19,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:19,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700577665] [2022-02-20 23:47:19,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:19,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:19,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:19,474 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:19,475 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:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:19,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:47:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:19,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:19,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {4915#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); {4915#true} is VALID [2022-02-20 23:47:19,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {4915#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; {4915#true} is VALID [2022-02-20 23:47:19,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {4915#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; {4915#true} is VALID [2022-02-20 23:47:19,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {4915#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: L588 {4915#true} is VALID [2022-02-20 23:47:19,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {4915#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: L588-1 {4915#true} is VALID [2022-02-20 23:47:19,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {4915#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {4915#true} is VALID [2022-02-20 23:47:19,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {4915#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: L589 {4915#true} is VALID [2022-02-20 23:47:19,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {4915#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; {4915#true} is VALID [2022-02-20 23:47:19,580 INFO L272 TraceCheckUtils]: 8: Hoare triple {4915#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {4944#(and (= (_ bv0 32) |create_data_#in~prevData.offset|) (= |create_data_#in~prevData.base| (_ bv0 32)))} is VALID [2022-02-20 23:47:19,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {4944#(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; {4948#(not |create_data_#t~short4|)} is VALID [2022-02-20 23:47:19,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {4948#(not |create_data_#t~short4|)} assume #t~short4; {4916#false} is VALID [2022-02-20 23:47:19,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {4916#false} assume !(1bv1 == #valid[~prevData.base]); {4916#false} is VALID [2022-02-20 23:47:19,581 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,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:19,581 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:19,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700577665] [2022-02-20 23:47:19,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700577665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:19,582 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:19,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:19,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898224086] [2022-02-20 23:47:19,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:19,583 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,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:19,583 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:19,598 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:19,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:19,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:19,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:19,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:19,599 INFO L87 Difference]: Start difference. First operand 183 states and 194 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:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:20,305 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2022-02-20 23:47:20,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:20,305 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:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:20,306 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:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 272 transitions. [2022-02-20 23:47:20,308 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:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 272 transitions. [2022-02-20 23:47:20,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 272 transitions. [2022-02-20 23:47:20,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:20,558 INFO L225 Difference]: With dead ends: 260 [2022-02-20 23:47:20,559 INFO L226 Difference]: Without dead ends: 260 [2022-02-20 23:47:20,559 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:20,559 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 80 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 548 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:20,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 548 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:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-02-20 23:47:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 224. [2022-02-20 23:47:20,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:20,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand has 224 states, 138 states have (on average 1.963768115942029) internal successors, (271), 219 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:20,564 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand has 224 states, 138 states have (on average 1.963768115942029) internal successors, (271), 219 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:20,564 INFO L87 Difference]: Start difference. First operand 260 states. Second operand has 224 states, 138 states have (on average 1.963768115942029) internal successors, (271), 219 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:20,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:20,569 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2022-02-20 23:47:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 275 transitions. [2022-02-20 23:47:20,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:20,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:20,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 224 states, 138 states have (on average 1.963768115942029) internal successors, (271), 219 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 260 states. [2022-02-20 23:47:20,570 INFO L87 Difference]: Start difference. First operand has 224 states, 138 states have (on average 1.963768115942029) internal successors, (271), 219 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 260 states. [2022-02-20 23:47:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:20,574 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2022-02-20 23:47:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 275 transitions. [2022-02-20 23:47:20,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:20,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:20,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:20,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 138 states have (on average 1.963768115942029) internal successors, (271), 219 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:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 275 transitions. [2022-02-20 23:47:20,579 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 275 transitions. Word has length 12 [2022-02-20 23:47:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:20,579 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 275 transitions. [2022-02-20 23:47:20,579 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:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 275 transitions. [2022-02-20 23:47:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:47:20,579 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:20,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:20,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:20,780 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:20,780 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:20,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:20,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569776, now seen corresponding path program 1 times [2022-02-20 23:47:20,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:20,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526403528] [2022-02-20 23:47:20,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:20,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:20,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:20,782 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:20,783 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:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:20,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:20,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:20,901 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:47:20,901 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:20,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {5960#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); {5960#true} is VALID [2022-02-20 23:47:20,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {5960#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; {5960#true} is VALID [2022-02-20 23:47:20,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {5960#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; {5960#true} is VALID [2022-02-20 23:47:20,912 INFO L290 TraceCheckUtils]: 3: Hoare triple {5960#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: L588 {5960#true} is VALID [2022-02-20 23:47:20,912 INFO L290 TraceCheckUtils]: 4: Hoare triple {5960#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: L588-1 {5960#true} is VALID [2022-02-20 23:47:20,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {5960#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {5960#true} is VALID [2022-02-20 23:47:20,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {5960#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: L589 {5960#true} is VALID [2022-02-20 23:47:20,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {5960#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; {5960#true} is VALID [2022-02-20 23:47:20,913 INFO L272 TraceCheckUtils]: 8: Hoare triple {5960#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {5960#true} is VALID [2022-02-20 23:47:20,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {5960#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {5960#true} is VALID [2022-02-20 23:47:20,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {5960#true} assume !#t~short4; {5960#true} is VALID [2022-02-20 23:47:20,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {5960#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); {5998#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| create_data_~data~0.base))) (_ bv1 1)))} is VALID [2022-02-20 23:47:20,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {5998#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| create_data_~data~0.base))) (_ bv1 1)))} assume !(1bv1 == #valid[~data~0.base]); {5961#false} is VALID [2022-02-20 23:47:20,919 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,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:20,920 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:20,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526403528] [2022-02-20 23:47:20,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526403528] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:20,920 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:20,920 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:20,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454330702] [2022-02-20 23:47:20,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:20,921 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,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:20,921 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,934 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,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:20,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:20,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:20,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:20,935 INFO L87 Difference]: Start difference. First operand 224 states and 275 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,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:21,482 INFO L93 Difference]: Finished difference Result 227 states and 271 transitions. [2022-02-20 23:47:21,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:21,483 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,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:21,483 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,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2022-02-20 23:47:21,485 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,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2022-02-20 23:47:21,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 200 transitions. [2022-02-20 23:47:21,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:21,665 INFO L225 Difference]: With dead ends: 227 [2022-02-20 23:47:21,665 INFO L226 Difference]: Without dead ends: 227 [2022-02-20 23:47:21,666 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,666 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 62 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:21,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 202 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:21,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-02-20 23:47:21,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 218. [2022-02-20 23:47:21,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:21,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 218 states, 144 states have (on average 1.8125) internal successors, (261), 213 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:21,670 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 218 states, 144 states have (on average 1.8125) internal successors, (261), 213 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:21,671 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 218 states, 144 states have (on average 1.8125) internal successors, (261), 213 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:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:21,674 INFO L93 Difference]: Finished difference Result 227 states and 271 transitions. [2022-02-20 23:47:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 271 transitions. [2022-02-20 23:47:21,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:21,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:21,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 144 states have (on average 1.8125) internal successors, (261), 213 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 227 states. [2022-02-20 23:47:21,675 INFO L87 Difference]: Start difference. First operand has 218 states, 144 states have (on average 1.8125) internal successors, (261), 213 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 227 states. [2022-02-20 23:47:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:21,678 INFO L93 Difference]: Finished difference Result 227 states and 271 transitions. [2022-02-20 23:47:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 271 transitions. [2022-02-20 23:47:21,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:21,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:21,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:21,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 144 states have (on average 1.8125) internal successors, (261), 213 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:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 265 transitions. [2022-02-20 23:47:21,682 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 265 transitions. Word has length 13 [2022-02-20 23:47:21,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:21,682 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 265 transitions. [2022-02-20 23:47:21,682 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,682 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 265 transitions. [2022-02-20 23:47:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:47:21,683 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:21,683 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:21,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:21,884 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:21,885 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:21,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:21,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569775, now seen corresponding path program 1 times [2022-02-20 23:47:21,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:21,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144910712] [2022-02-20 23:47:21,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:21,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:21,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:21,886 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:21,887 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:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:21,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:47:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:21,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:21,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:21,997 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:22,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 11 treesize of output 9 [2022-02-20 23:47:22,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {6900#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); {6900#true} is VALID [2022-02-20 23:47:22,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {6900#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; {6900#true} is VALID [2022-02-20 23:47:22,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {6900#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; {6900#true} is VALID [2022-02-20 23:47:22,019 INFO L290 TraceCheckUtils]: 3: Hoare triple {6900#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: L588 {6900#true} is VALID [2022-02-20 23:47:22,020 INFO L290 TraceCheckUtils]: 4: Hoare triple {6900#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: L588-1 {6900#true} is VALID [2022-02-20 23:47:22,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {6900#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {6900#true} is VALID [2022-02-20 23:47:22,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {6900#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: L589 {6900#true} is VALID [2022-02-20 23:47:22,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {6900#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; {6900#true} is VALID [2022-02-20 23:47:22,020 INFO L272 TraceCheckUtils]: 8: Hoare triple {6900#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {6900#true} is VALID [2022-02-20 23:47:22,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {6900#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {6900#true} is VALID [2022-02-20 23:47:22,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {6900#true} assume !#t~short4; {6900#true} is VALID [2022-02-20 23:47:22,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {6900#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); {6938#(and (= (_ bv16 32) (select |#length| create_data_~data~0.base)) (= create_data_~data~0.offset (_ bv0 32)))} is VALID [2022-02-20 23:47:22,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {6938#(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))); {6901#false} is VALID [2022-02-20 23:47:22,022 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,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:22,023 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:22,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144910712] [2022-02-20 23:47:22,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144910712] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:22,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:22,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:22,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698335856] [2022-02-20 23:47:22,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:22,024 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:22,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:22,025 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:22,036 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:22,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:22,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:22,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:22,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:22,038 INFO L87 Difference]: Start difference. First operand 218 states and 265 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:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:22,702 INFO L93 Difference]: Finished difference Result 239 states and 279 transitions. [2022-02-20 23:47:22,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:22,702 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:22,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:22,703 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:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2022-02-20 23:47:22,704 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:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2022-02-20 23:47:22,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 204 transitions. [2022-02-20 23:47:22,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:22,908 INFO L225 Difference]: With dead ends: 239 [2022-02-20 23:47:22,908 INFO L226 Difference]: Without dead ends: 239 [2022-02-20 23:47:22,909 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:22,910 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:22,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 212 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:22,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-02-20 23:47:22,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 219. [2022-02-20 23:47:22,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:22,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 219 states, 154 states have (on average 1.655844155844156) internal successors, (255), 214 states have internal predecessors, (255), 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:22,916 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 219 states, 154 states have (on average 1.655844155844156) internal successors, (255), 214 states have internal predecessors, (255), 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:22,917 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 219 states, 154 states have (on average 1.655844155844156) internal successors, (255), 214 states have internal predecessors, (255), 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:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:22,920 INFO L93 Difference]: Finished difference Result 239 states and 279 transitions. [2022-02-20 23:47:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 279 transitions. [2022-02-20 23:47:22,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:22,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:22,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 219 states, 154 states have (on average 1.655844155844156) internal successors, (255), 214 states have internal predecessors, (255), 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:47:22,921 INFO L87 Difference]: Start difference. First operand has 219 states, 154 states have (on average 1.655844155844156) internal successors, (255), 214 states have internal predecessors, (255), 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:47:22,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:22,924 INFO L93 Difference]: Finished difference Result 239 states and 279 transitions. [2022-02-20 23:47:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 279 transitions. [2022-02-20 23:47:22,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:22,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:22,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:22,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 154 states have (on average 1.655844155844156) internal successors, (255), 214 states have internal predecessors, (255), 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:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 259 transitions. [2022-02-20 23:47:22,928 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 259 transitions. Word has length 13 [2022-02-20 23:47:22,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:22,928 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 259 transitions. [2022-02-20 23:47:22,928 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:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 259 transitions. [2022-02-20 23:47:22,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:22,929 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:22,929 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:22,935 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:23,135 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:23,135 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:23,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:23,136 INFO L85 PathProgramCache]: Analyzing trace with hash 533828155, now seen corresponding path program 1 times [2022-02-20 23:47:23,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:23,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328351095] [2022-02-20 23:47:23,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:23,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:23,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:23,137 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:23,138 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:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:23,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:47:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:23,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:23,250 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:47:23,251 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:23,278 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:23,307 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:23,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {7877#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); {7877#true} is VALID [2022-02-20 23:47:23,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {7877#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; {7877#true} is VALID [2022-02-20 23:47:23,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {7877#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; {7877#true} is VALID [2022-02-20 23:47:23,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {7877#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: L588 {7877#true} is VALID [2022-02-20 23:47:23,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {7877#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: L588-1 {7877#true} is VALID [2022-02-20 23:47:23,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {7877#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {7877#true} is VALID [2022-02-20 23:47:23,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {7877#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: L589 {7877#true} is VALID [2022-02-20 23:47:23,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {7877#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; {7877#true} is VALID [2022-02-20 23:47:23,315 INFO L272 TraceCheckUtils]: 8: Hoare triple {7877#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {7877#true} is VALID [2022-02-20 23:47:23,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {7877#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {7877#true} is VALID [2022-02-20 23:47:23,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {7877#true} assume !#t~short4; {7877#true} is VALID [2022-02-20 23:47:23,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {7877#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); {7915#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |create_data_#t~malloc7.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:47:23,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {7915#(= (_ 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 {7919#(= (_ 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:23,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {7919#(= (_ 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; {7919#(= (_ 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:23,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {7919#(= (_ 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); {7919#(= (_ 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:23,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {7919#(= (_ 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 {7929#(= (bvadd (bvneg (select |#valid| |create_data_#t~mem9.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:47:23,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {7929#(= (bvadd (bvneg (select |#valid| |create_data_#t~mem9.base|)) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[#t~mem9.base]); {7878#false} is VALID [2022-02-20 23:47:23,321 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:23,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:23,321 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:23,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328351095] [2022-02-20 23:47:23,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328351095] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:23,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:23,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:23,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857033023] [2022-02-20 23:47:23,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:23,322 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,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:23,323 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:23,339 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:23,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:23,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:23,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:23,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:23,340 INFO L87 Difference]: Start difference. First operand 219 states and 259 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:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:24,794 INFO L93 Difference]: Finished difference Result 270 states and 323 transitions. [2022-02-20 23:47:24,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:24,794 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:24,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:24,795 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:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2022-02-20 23:47:24,796 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:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2022-02-20 23:47:24,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 201 transitions. [2022-02-20 23:47:24,978 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:24,981 INFO L225 Difference]: With dead ends: 270 [2022-02-20 23:47:24,982 INFO L226 Difference]: Without dead ends: 270 [2022-02-20 23:47:24,982 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,982 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 25 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 413 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,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 413 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,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-02-20 23:47:24,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 225. [2022-02-20 23:47:24,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:24,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 225 states, 160 states have (on average 1.65625) internal successors, (265), 220 states have internal predecessors, (265), 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,987 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 225 states, 160 states have (on average 1.65625) internal successors, (265), 220 states have internal predecessors, (265), 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,987 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 225 states, 160 states have (on average 1.65625) internal successors, (265), 220 states have internal predecessors, (265), 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,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:24,991 INFO L93 Difference]: Finished difference Result 270 states and 323 transitions. [2022-02-20 23:47:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 323 transitions. [2022-02-20 23:47:24,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:24,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:24,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 160 states have (on average 1.65625) internal successors, (265), 220 states have internal predecessors, (265), 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 270 states. [2022-02-20 23:47:24,992 INFO L87 Difference]: Start difference. First operand has 225 states, 160 states have (on average 1.65625) internal successors, (265), 220 states have internal predecessors, (265), 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 270 states. [2022-02-20 23:47:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:24,996 INFO L93 Difference]: Finished difference Result 270 states and 323 transitions. [2022-02-20 23:47:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 323 transitions. [2022-02-20 23:47:24,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:24,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:24,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:24,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 160 states have (on average 1.65625) internal successors, (265), 220 states have internal predecessors, (265), 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:25,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 269 transitions. [2022-02-20 23:47:25,000 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 269 transitions. Word has length 17 [2022-02-20 23:47:25,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:25,000 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 269 transitions. [2022-02-20 23:47:25,000 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:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 269 transitions. [2022-02-20 23:47:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:25,001 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:25,001 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:25,007 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:25,207 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:25,207 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:25,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:25,207 INFO L85 PathProgramCache]: Analyzing trace with hash 533828156, now seen corresponding path program 1 times [2022-02-20 23:47:25,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:25,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981928149] [2022-02-20 23:47:25,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:25,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:25,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:25,209 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:25,210 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:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:25,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:47:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:25,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:25,323 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:47:25,324 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:25,345 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:25,350 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:25,426 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:25,430 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:25,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {8971#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); {8971#true} is VALID [2022-02-20 23:47:25,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {8971#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; {8971#true} is VALID [2022-02-20 23:47:25,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {8971#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; {8971#true} is VALID [2022-02-20 23:47:25,445 INFO L290 TraceCheckUtils]: 3: Hoare triple {8971#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: L588 {8971#true} is VALID [2022-02-20 23:47:25,445 INFO L290 TraceCheckUtils]: 4: Hoare triple {8971#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: L588-1 {8971#true} is VALID [2022-02-20 23:47:25,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {8971#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {8971#true} is VALID [2022-02-20 23:47:25,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {8971#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: L589 {8971#true} is VALID [2022-02-20 23:47:25,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {8971#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; {8971#true} is VALID [2022-02-20 23:47:25,446 INFO L272 TraceCheckUtils]: 8: Hoare triple {8971#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {8971#true} is VALID [2022-02-20 23:47:25,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {8971#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {8971#true} is VALID [2022-02-20 23:47:25,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {8971#true} assume !#t~short4; {8971#true} is VALID [2022-02-20 23:47:25,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {8971#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); {9009#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)))} is VALID [2022-02-20 23:47:25,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {9009#(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 {9013#(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:25,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {9013#(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; {9017#(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:25,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {9017#(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); {9017#(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:25,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {9017#(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 {9024#(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:25,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {9024#(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)))); {8972#false} is VALID [2022-02-20 23:47:25,456 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:25,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:25,457 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:25,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981928149] [2022-02-20 23:47:25,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981928149] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:25,457 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:25,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:47:25,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034789883] [2022-02-20 23:47:25,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:25,458 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:25,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:25,458 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:25,476 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:25,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:25,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:25,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:25,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:25,477 INFO L87 Difference]: Start difference. First operand 225 states and 269 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:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:27,513 INFO L93 Difference]: Finished difference Result 227 states and 267 transitions. [2022-02-20 23:47:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:27,513 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:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:27,514 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:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2022-02-20 23:47:27,519 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:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2022-02-20 23:47:27,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 173 transitions. [2022-02-20 23:47:27,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:27,689 INFO L225 Difference]: With dead ends: 227 [2022-02-20 23:47:27,689 INFO L226 Difference]: Without dead ends: 227 [2022-02-20 23:47:27,690 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,690 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 508 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.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:27,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 508 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 23:47:27,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-02-20 23:47:27,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2022-02-20 23:47:27,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:27,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 225 states, 160 states have (on average 1.63125) internal successors, (261), 220 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:27,694 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 225 states, 160 states have (on average 1.63125) internal successors, (261), 220 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:27,695 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 225 states, 160 states have (on average 1.63125) internal successors, (261), 220 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:27,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:27,698 INFO L93 Difference]: Finished difference Result 227 states and 267 transitions. [2022-02-20 23:47:27,698 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 267 transitions. [2022-02-20 23:47:27,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:27,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:27,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 160 states have (on average 1.63125) internal successors, (261), 220 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 227 states. [2022-02-20 23:47:27,699 INFO L87 Difference]: Start difference. First operand has 225 states, 160 states have (on average 1.63125) internal successors, (261), 220 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 227 states. [2022-02-20 23:47:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:27,703 INFO L93 Difference]: Finished difference Result 227 states and 267 transitions. [2022-02-20 23:47:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 267 transitions. [2022-02-20 23:47:27,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:27,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:27,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:27,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 160 states have (on average 1.63125) internal successors, (261), 220 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:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 265 transitions. [2022-02-20 23:47:27,706 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 265 transitions. Word has length 17 [2022-02-20 23:47:27,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:27,707 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 265 transitions. [2022-02-20 23:47:27,707 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,707 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 265 transitions. [2022-02-20 23:47:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:47:27,707 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:27,707 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,714 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,914 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,914 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,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:27,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049946, now seen corresponding path program 1 times [2022-02-20 23:47:27,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:27,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085862800] [2022-02-20 23:47:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:27,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:27,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:27,920 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,921 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:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:28,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:47:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:28,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:28,075 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:47:28,075 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:28,110 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:28,208 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:28,208 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 34 treesize of output 35 [2022-02-20 23:47:28,280 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:28,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {9937#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); {9937#true} is VALID [2022-02-20 23:47:28,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {9937#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; {9937#true} is VALID [2022-02-20 23:47:28,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {9937#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; {9937#true} is VALID [2022-02-20 23:47:28,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {9937#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: L588 {9937#true} is VALID [2022-02-20 23:47:28,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {9937#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: L588-1 {9937#true} is VALID [2022-02-20 23:47:28,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {9937#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {9937#true} is VALID [2022-02-20 23:47:28,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {9937#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: L589 {9937#true} is VALID [2022-02-20 23:47:28,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {9937#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; {9937#true} is VALID [2022-02-20 23:47:28,311 INFO L272 TraceCheckUtils]: 8: Hoare triple {9937#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {9937#true} is VALID [2022-02-20 23:47:28,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {9937#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {9937#true} is VALID [2022-02-20 23:47:28,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {9937#true} assume !#t~short4; {9937#true} is VALID [2022-02-20 23:47:28,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {9937#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); {9975#(and (= (select |#valid| |create_data_#t~malloc7.base|) (_ bv1 1)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:28,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {9975#(and (= (select |#valid| |create_data_#t~malloc7.base|) (_ bv1 1)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {9979#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:28,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {9979#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {9979#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:28,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {9979#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} assume !!~bvslt32(~counter~0, 3bv32); {9979#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:28,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {9979#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {9989#(and (= (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)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:28,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {9989#(and (= (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)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {9979#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:28,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {9979#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {9979#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:28,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {9979#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {9979#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:28,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {9979#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} assume !!~bvslt32(~counter~0, 3bv32); {9979#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:28,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {9979#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {10005#(and (exists ((create_data_~data~0.base (_ BitVec 32))) (and (not (= create_data_~data~0.base |create_data_#t~mem9.base|)) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))) (= (select |#valid| |create_data_#t~mem9.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:28,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {10005#(and (exists ((create_data_~data~0.base (_ BitVec 32))) (and (not (= create_data_~data~0.base |create_data_#t~mem9.base|)) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))) (= (select |#valid| |create_data_#t~mem9.base|) (_ bv1 1)))} assume !(1bv1 == #valid[#t~mem9.base]); {9938#false} is VALID [2022-02-20 23:47:28,323 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:28,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:28,377 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_177) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (_ bv1 1))) is different from false [2022-02-20 23:47:28,387 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_177) c_create_data_~data~0.base) .cse0))) (_ bv1 1))) is different from false [2022-02-20 23:47:28,411 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:28,411 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 24 treesize of output 25 [2022-02-20 23:47:28,415 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 40 treesize of output 28 [2022-02-20 23:47:28,418 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 13 treesize of output 9 [2022-02-20 23:47:28,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {10009#(= (select |#valid| |create_data_#t~mem9.base|) (_ bv1 1))} assume !(1bv1 == #valid[#t~mem9.base]); {9938#false} is VALID [2022-02-20 23:47:28,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {10013#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| 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 {10009#(= (select |#valid| |create_data_#t~mem9.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:28,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {10013#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))} assume !!~bvslt32(~counter~0, 3bv32); {10013#(= (_ bv1 1) (select |#valid| (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:28,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {10013#(= (_ bv1 1) (select |#valid| (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; {10013#(= (_ bv1 1) (select |#valid| (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:28,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {10013#(= (_ bv1 1) (select |#valid| (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; {10013#(= (_ bv1 1) (select |#valid| (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:28,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {10026#(forall ((v_ArrVal_177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_177) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {10013#(= (_ bv1 1) (select |#valid| (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:28,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {10030#(forall ((v_ArrVal_177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_177) 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 {10026#(forall ((v_ArrVal_177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_177) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:28,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {10030#(forall ((v_ArrVal_177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_177) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (_ bv1 1)))} assume !!~bvslt32(~counter~0, 3bv32); {10030#(forall ((v_ArrVal_177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_177) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:28,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {10030#(forall ((v_ArrVal_177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_177) 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; {10030#(forall ((v_ArrVal_177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_177) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:28,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {10040#(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 {10030#(forall ((v_ArrVal_177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_177) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:28,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {9937#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); {10040#(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,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {9937#true} assume !#t~short4; {9937#true} is VALID [2022-02-20 23:47:28,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {9937#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {9937#true} is VALID [2022-02-20 23:47:28,485 INFO L272 TraceCheckUtils]: 8: Hoare triple {9937#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {9937#true} is VALID [2022-02-20 23:47:28,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {9937#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; {9937#true} is VALID [2022-02-20 23:47:28,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {9937#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: L589 {9937#true} is VALID [2022-02-20 23:47:28,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {9937#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {9937#true} is VALID [2022-02-20 23:47:28,485 INFO L290 TraceCheckUtils]: 4: Hoare triple {9937#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: L588-1 {9937#true} is VALID [2022-02-20 23:47:28,485 INFO L290 TraceCheckUtils]: 3: Hoare triple {9937#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: L588 {9937#true} is VALID [2022-02-20 23:47:28,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {9937#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; {9937#true} is VALID [2022-02-20 23:47:28,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {9937#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; {9937#true} is VALID [2022-02-20 23:47:28,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {9937#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); {9937#true} is VALID [2022-02-20 23:47:28,486 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:28,486 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:28,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085862800] [2022-02-20 23:47:28,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085862800] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:28,486 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:28,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-02-20 23:47:28,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286594757] [2022-02-20 23:47:28,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:28,487 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 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 22 [2022-02-20 23:47:28,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:28,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 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:47:28,536 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:47:28,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:47:28,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:28,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:47:28,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-02-20 23:47:28,537 INFO L87 Difference]: Start difference. First operand 225 states and 265 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 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:47:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:29,958 INFO L93 Difference]: Finished difference Result 232 states and 269 transitions. [2022-02-20 23:47:29,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:47:29,958 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 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 22 [2022-02-20 23:47:29,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 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:47:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2022-02-20 23:47:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 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:47:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2022-02-20 23:47:29,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 176 transitions. [2022-02-20 23:47:30,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:30,169 INFO L225 Difference]: With dead ends: 232 [2022-02-20 23:47:30,170 INFO L226 Difference]: Without dead ends: 232 [2022-02-20 23:47:30,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=64, Unknown=2, NotChecked=34, Total=132 [2022-02-20 23:47:30,170 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 49 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 284 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:30,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 537 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 175 Invalid, 0 Unknown, 284 Unchecked, 0.3s Time] [2022-02-20 23:47:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-02-20 23:47:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 224. [2022-02-20 23:47:30,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:30,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 224 states, 160 states have (on average 1.61875) internal successors, (259), 219 states have internal predecessors, (259), 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,174 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 224 states, 160 states have (on average 1.61875) internal successors, (259), 219 states have internal predecessors, (259), 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,174 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 224 states, 160 states have (on average 1.61875) internal successors, (259), 219 states have internal predecessors, (259), 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,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:30,177 INFO L93 Difference]: Finished difference Result 232 states and 269 transitions. [2022-02-20 23:47:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 269 transitions. [2022-02-20 23:47:30,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:30,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:30,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 224 states, 160 states have (on average 1.61875) internal successors, (259), 219 states have internal predecessors, (259), 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 232 states. [2022-02-20 23:47:30,179 INFO L87 Difference]: Start difference. First operand has 224 states, 160 states have (on average 1.61875) internal successors, (259), 219 states have internal predecessors, (259), 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 232 states. [2022-02-20 23:47:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:30,182 INFO L93 Difference]: Finished difference Result 232 states and 269 transitions. [2022-02-20 23:47:30,182 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 269 transitions. [2022-02-20 23:47:30,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:30,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:30,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:30,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 160 states have (on average 1.61875) internal successors, (259), 219 states have internal predecessors, (259), 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,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 263 transitions. [2022-02-20 23:47:30,186 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 263 transitions. Word has length 22 [2022-02-20 23:47:30,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:30,186 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 263 transitions. [2022-02-20 23:47:30,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 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:47:30,187 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 263 transitions. [2022-02-20 23:47:30,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:47:30,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:30,187 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,224 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:30,393 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:30,393 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:30,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049945, now seen corresponding path program 1 times [2022-02-20 23:47:30,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:30,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124383045] [2022-02-20 23:47:30,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:30,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:30,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:30,395 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:30,397 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:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:30,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:47:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:30,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:30,558 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:30,565 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:30,600 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:30,608 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:30,741 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:30,741 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:30,746 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:30,840 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:30,850 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:30,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {11000#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); {11000#true} is VALID [2022-02-20 23:47:30,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {11000#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; {11000#true} is VALID [2022-02-20 23:47:30,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {11000#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; {11000#true} is VALID [2022-02-20 23:47:30,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {11000#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: L588 {11000#true} is VALID [2022-02-20 23:47:30,870 INFO L290 TraceCheckUtils]: 4: Hoare triple {11000#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: L588-1 {11000#true} is VALID [2022-02-20 23:47:30,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {11000#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {11000#true} is VALID [2022-02-20 23:47:30,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {11000#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: L589 {11000#true} is VALID [2022-02-20 23:47:30,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {11000#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; {11000#true} is VALID [2022-02-20 23:47:30,870 INFO L272 TraceCheckUtils]: 8: Hoare triple {11000#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {11000#true} is VALID [2022-02-20 23:47:30,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {11000#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {11000#true} is VALID [2022-02-20 23:47:30,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {11000#true} assume !#t~short4; {11000#true} is VALID [2022-02-20 23:47:30,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {11000#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); {11038#(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:30,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {11038#(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 {11042#(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:30,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {11042#(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; {11046#(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:30,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {11046#(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); {11046#(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:30,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {11046#(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 {11053#(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:30,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {11053#(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 {11046#(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:30,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {11046#(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; {11046#(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:30,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {11046#(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; {11063#(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:30,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {11063#(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); {11063#(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:30,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {11063#(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 {11070#(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:30,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {11070#(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)))); {11001#false} is VALID [2022-02-20 23:47:30,881 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:30,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:31,226 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (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_223) c_create_data_~data~0.base) .cse0) (_ 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_222) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_223) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse1 (_ bv4 32) .cse2) (bvadd .cse1 (_ bv8 32) .cse2))))) is different from false [2022-02-20 23:47:31,262 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (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) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_223) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (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_223) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse2 .cse3) (bvadd (_ bv8 32) .cse2 .cse3))))) is different from false [2022-02-20 23:47:31,323 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (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) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_223) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (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) .cse3) v_ArrVal_223) c_create_data_~data~0.base) .cse3)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2022-02-20 23:47:31,343 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:31,343 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:31,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:31,349 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:31,369 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:31,474 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:31,481 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:31,484 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:31,590 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:31,590 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:31,621 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:31,626 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:31,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {11074#(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)))); {11001#false} is VALID [2022-02-20 23:47:31,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {11078#(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 {11074#(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:31,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {11078#(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); {11078#(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:32,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {11085#(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; {11078#(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:32,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {11085#(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; {11085#(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:32,372 WARN L290 TraceCheckUtils]: 16: Hoare triple {11092#(and (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| |create_data_#t~mem9.base| v_ArrVal_223) 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| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_223) 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| |create_data_#t~mem9.base| v_ArrVal_223) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {11085#(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:32,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {11096#(and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0) (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_223) 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| (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)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0) (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_223) 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_222) 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 {11092#(and (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| |create_data_#t~mem9.base| v_ArrVal_223) 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| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_223) 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| |create_data_#t~mem9.base| v_ArrVal_223) 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:32,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {11096#(and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0) (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_223) 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| (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)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0) (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_223) 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_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} assume !!~bvslt32(~counter~0, 3bv32); {11096#(and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0) (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_223) 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| (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)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0) (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_223) 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_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:32,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {11103#(and (forall ((v_ArrVal_223 (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_223) 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_223) 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_223) 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_222) 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; {11096#(and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0) (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_223) 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| (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)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0) (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_223) 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_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:32,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {11107#(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 {11103#(and (forall ((v_ArrVal_223 (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_223) 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_223) 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_223) 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_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:32,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {11000#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); {11107#(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:32,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {11000#true} assume !#t~short4; {11000#true} is VALID [2022-02-20 23:47:32,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {11000#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {11000#true} is VALID [2022-02-20 23:47:32,405 INFO L272 TraceCheckUtils]: 8: Hoare triple {11000#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {11000#true} is VALID [2022-02-20 23:47:32,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {11000#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; {11000#true} is VALID [2022-02-20 23:47:32,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {11000#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: L589 {11000#true} is VALID [2022-02-20 23:47:32,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {11000#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {11000#true} is VALID [2022-02-20 23:47:32,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {11000#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: L588-1 {11000#true} is VALID [2022-02-20 23:47:32,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {11000#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: L588 {11000#true} is VALID [2022-02-20 23:47:32,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {11000#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; {11000#true} is VALID [2022-02-20 23:47:32,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {11000#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; {11000#true} is VALID [2022-02-20 23:47:32,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {11000#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); {11000#true} is VALID [2022-02-20 23:47:32,405 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:32,406 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:32,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124383045] [2022-02-20 23:47:32,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124383045] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:32,406 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:32,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-02-20 23:47:32,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30357737] [2022-02-20 23:47:32,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:32,406 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:32,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:32,407 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:32,962 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:32,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:47:32,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:32,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:47:32,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2022-02-20 23:47:32,963 INFO L87 Difference]: Start difference. First operand 224 states and 263 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:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:40,874 INFO L93 Difference]: Finished difference Result 236 states and 275 transitions. [2022-02-20 23:47:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:47:40,874 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:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:40,875 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:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2022-02-20 23:47:40,876 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:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2022-02-20 23:47:40,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 177 transitions. [2022-02-20 23:47:41,051 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:41,054 INFO L225 Difference]: With dead ends: 236 [2022-02-20 23:47:41,054 INFO L226 Difference]: Without dead ends: 236 [2022-02-20 23:47:41,054 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:41,055 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 14 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:41,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 1003 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 510 Invalid, 0 Unknown, 354 Unchecked, 2.3s Time] [2022-02-20 23:47:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-02-20 23:47:41,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2022-02-20 23:47:41,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:41,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 234 states, 170 states have (on average 1.5823529411764705) internal successors, (269), 229 states have internal predecessors, (269), 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:41,058 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 234 states, 170 states have (on average 1.5823529411764705) internal successors, (269), 229 states have internal predecessors, (269), 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:41,059 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 234 states, 170 states have (on average 1.5823529411764705) internal successors, (269), 229 states have internal predecessors, (269), 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:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:41,061 INFO L93 Difference]: Finished difference Result 236 states and 275 transitions. [2022-02-20 23:47:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 275 transitions. [2022-02-20 23:47:41,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:41,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:41,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 170 states have (on average 1.5823529411764705) internal successors, (269), 229 states have internal predecessors, (269), 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 236 states. [2022-02-20 23:47:41,063 INFO L87 Difference]: Start difference. First operand has 234 states, 170 states have (on average 1.5823529411764705) internal successors, (269), 229 states have internal predecessors, (269), 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 236 states. [2022-02-20 23:47:41,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:41,066 INFO L93 Difference]: Finished difference Result 236 states and 275 transitions. [2022-02-20 23:47:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 275 transitions. [2022-02-20 23:47:41,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:41,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:41,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:41,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 170 states have (on average 1.5823529411764705) internal successors, (269), 229 states have internal predecessors, (269), 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:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 273 transitions. [2022-02-20 23:47:41,070 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 273 transitions. Word has length 22 [2022-02-20 23:47:41,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:41,070 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 273 transitions. [2022-02-20 23:47:41,070 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:41,070 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 273 transitions. [2022-02-20 23:47:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:47:41,071 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:41,071 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:41,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-02-20 23:47:41,278 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:41,278 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:41,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:41,279 INFO L85 PathProgramCache]: Analyzing trace with hash 767728924, now seen corresponding path program 2 times [2022-02-20 23:47:41,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:41,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968443133] [2022-02-20 23:47:41,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:47:41,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:41,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:41,281 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:41,313 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:41,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:47:41,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:47:41,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 23:47:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:41,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:41,494 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:47:41,494 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:41,503 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:41,538 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:41,545 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:41,671 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:41,672 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:41,677 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:41,846 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:41,847 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:41,852 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:41,959 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:41,968 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:41,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {12093#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); {12093#true} is VALID [2022-02-20 23:47:41,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {12093#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; {12093#true} is VALID [2022-02-20 23:47:41,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {12093#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; {12093#true} is VALID [2022-02-20 23:47:41,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {12093#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: L588 {12093#true} is VALID [2022-02-20 23:47:41,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {12093#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: L588-1 {12093#true} is VALID [2022-02-20 23:47:41,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {12093#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {12093#true} is VALID [2022-02-20 23:47:41,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {12093#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: L589 {12093#true} is VALID [2022-02-20 23:47:41,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {12093#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; {12093#true} is VALID [2022-02-20 23:47:41,991 INFO L272 TraceCheckUtils]: 8: Hoare triple {12093#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {12093#true} is VALID [2022-02-20 23:47:41,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {12093#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {12093#true} is VALID [2022-02-20 23:47:41,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {12093#true} assume !#t~short4; {12093#true} is VALID [2022-02-20 23:47:41,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {12093#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); {12131#(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:41,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {12131#(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 {12135#(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:41,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {12135#(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; {12139#(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:41,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {12139#(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); {12139#(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:41,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {12139#(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 {12146#(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:42,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {12146#(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 {12139#(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:42,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {12139#(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; {12139#(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:42,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {12139#(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; {12156#(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:42,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {12156#(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); {12156#(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:42,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {12156#(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 {12163#(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:42,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {12163#(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 {12156#(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:42,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {12156#(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; {12156#(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:42,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {12156#(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; {12173#(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:42,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {12173#(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); {12173#(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:42,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {12173#(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 {12180#(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:42,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {12180#(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)))); {12094#false} is VALID [2022-02-20 23:47:42,009 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:42,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:42,351 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:42,387 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:42,440 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:42,505 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:42,547 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:42,613 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:42,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:42,657 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:42,666 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:42,666 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:42,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 102 treesize of output 84 [2022-02-20 23:47:42,884 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:42,892 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:42,894 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:42,900 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:42,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:42,962 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:42,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:42,977 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:42,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:43,004 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:43,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:43,012 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:43,017 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:43,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {12184#(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)))); {12094#false} is VALID [2022-02-20 23:47:43,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {12188#(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 {12184#(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:43,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {12188#(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); {12188#(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:43,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {12195#(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; {12188#(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:43,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {12195#(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; {12195#(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:43,718 WARN L290 TraceCheckUtils]: 21: Hoare triple {12202#(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 {12195#(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:43,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {12206#(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 {12202#(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:43,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {12206#(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); {12206#(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:43,751 WARN L290 TraceCheckUtils]: 18: Hoare triple {12213#(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; {12206#(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:43,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {12213#(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; {12213#(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:44,153 WARN L290 TraceCheckUtils]: 16: Hoare triple {12220#(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 {12213#(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:44,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {12224#(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 {12220#(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:44,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {12224#(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); {12224#(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:44,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {12231#(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; {12224#(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:44,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {12235#(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 {12231#(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:44,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {12093#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); {12235#(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:44,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {12093#true} assume !#t~short4; {12093#true} is VALID [2022-02-20 23:47:44,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {12093#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {12093#true} is VALID [2022-02-20 23:47:44,197 INFO L272 TraceCheckUtils]: 8: Hoare triple {12093#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {12093#true} is VALID [2022-02-20 23:47:44,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {12093#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; {12093#true} is VALID [2022-02-20 23:47:44,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {12093#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: L589 {12093#true} is VALID [2022-02-20 23:47:44,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {12093#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {12093#true} is VALID [2022-02-20 23:47:44,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {12093#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: L588-1 {12093#true} is VALID [2022-02-20 23:47:44,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {12093#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: L588 {12093#true} is VALID [2022-02-20 23:47:44,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {12093#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; {12093#true} is VALID [2022-02-20 23:47:44,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {12093#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; {12093#true} is VALID [2022-02-20 23:47:44,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {12093#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); {12093#true} is VALID [2022-02-20 23:47:44,198 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:44,198 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:44,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968443133] [2022-02-20 23:47:44,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968443133] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:44,199 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:44,199 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2022-02-20 23:47:44,199 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007890433] [2022-02-20 23:47:44,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:44,199 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:44,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:44,200 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:45,789 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:45,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 23:47:45,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:45,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 23:47:45,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2022-02-20 23:47:45,790 INFO L87 Difference]: Start difference. First operand 234 states and 273 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:47:56,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:56,936 INFO L93 Difference]: Finished difference Result 246 states and 285 transitions. [2022-02-20 23:47:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:47:56,936 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:56,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:56,936 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:47:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 182 transitions. [2022-02-20 23:47:56,937 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:47:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 182 transitions. [2022-02-20 23:47:56,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 182 transitions. [2022-02-20 23:47:57,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:57,139 INFO L225 Difference]: With dead ends: 246 [2022-02-20 23:47:57,140 INFO L226 Difference]: Without dead ends: 246 [2022-02-20 23:47:57,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=239, Unknown=6, NotChecked=222, Total=552 [2022-02-20 23:47:57,140 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 17 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 565 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:57,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 1254 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 632 Invalid, 0 Unknown, 565 Unchecked, 2.9s Time] [2022-02-20 23:47:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-02-20 23:47:57,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2022-02-20 23:47:57,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:57,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand has 244 states, 180 states have (on average 1.55) internal successors, (279), 239 states have internal predecessors, (279), 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:57,144 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand has 244 states, 180 states have (on average 1.55) internal successors, (279), 239 states have internal predecessors, (279), 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:57,145 INFO L87 Difference]: Start difference. First operand 246 states. Second operand has 244 states, 180 states have (on average 1.55) internal successors, (279), 239 states have internal predecessors, (279), 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:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:57,148 INFO L93 Difference]: Finished difference Result 246 states and 285 transitions. [2022-02-20 23:47:57,148 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 285 transitions. [2022-02-20 23:47:57,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:57,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:57,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 180 states have (on average 1.55) internal successors, (279), 239 states have internal predecessors, (279), 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 246 states. [2022-02-20 23:47:57,149 INFO L87 Difference]: Start difference. First operand has 244 states, 180 states have (on average 1.55) internal successors, (279), 239 states have internal predecessors, (279), 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 246 states. [2022-02-20 23:47:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:57,153 INFO L93 Difference]: Finished difference Result 246 states and 285 transitions. [2022-02-20 23:47:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 285 transitions. [2022-02-20 23:47:57,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:57,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:57,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:57,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 180 states have (on average 1.55) internal successors, (279), 239 states have internal predecessors, (279), 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:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 283 transitions. [2022-02-20 23:47:57,157 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 283 transitions. Word has length 27 [2022-02-20 23:47:57,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:57,157 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 283 transitions. [2022-02-20 23:47:57,157 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:47:57,157 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 283 transitions. [2022-02-20 23:47:57,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:47:57,157 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:57,158 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:47:57,170 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:47:57,371 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:47:57,371 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:47:57,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:57,371 INFO L85 PathProgramCache]: Analyzing trace with hash 852563911, now seen corresponding path program 3 times [2022-02-20 23:47:57,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:57,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758276399] [2022-02-20 23:47:57,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:47:57,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:57,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:57,373 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:47:57,374 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:47:57,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 23:47:57,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:47:57,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:47:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:57,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:57,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {13266#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); {13266#true} is VALID [2022-02-20 23:47:57,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {13266#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; {13266#true} is VALID [2022-02-20 23:47:57,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {13266#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; {13266#true} is VALID [2022-02-20 23:47:57,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {13266#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: L588 {13266#true} is VALID [2022-02-20 23:47:57,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {13266#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: L588-1 {13266#true} is VALID [2022-02-20 23:47:57,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {13266#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {13266#true} is VALID [2022-02-20 23:47:57,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {13266#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: L589 {13266#true} is VALID [2022-02-20 23:47:57,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {13266#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; {13266#true} is VALID [2022-02-20 23:47:57,776 INFO L272 TraceCheckUtils]: 8: Hoare triple {13266#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {13266#true} is VALID [2022-02-20 23:47:57,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {13266#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {13266#true} is VALID [2022-02-20 23:47:57,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {13266#true} assume !#t~short4; {13266#true} is VALID [2022-02-20 23:47:57,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {13266#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); {13266#true} is VALID [2022-02-20 23:47:57,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {13266#true} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {13266#true} is VALID [2022-02-20 23:47:57,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {13266#true} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {13310#(= create_data_~counter~0 (_ bv0 32))} is VALID [2022-02-20 23:47:57,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {13310#(= create_data_~counter~0 (_ bv0 32))} assume !!~bvslt32(~counter~0, 3bv32); {13310#(= create_data_~counter~0 (_ bv0 32))} is VALID [2022-02-20 23:47:57,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {13310#(= 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 {13310#(= create_data_~counter~0 (_ bv0 32))} is VALID [2022-02-20 23:47:57,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {13310#(= 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 {13310#(= create_data_~counter~0 (_ bv0 32))} is VALID [2022-02-20 23:47:57,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {13310#(= create_data_~counter~0 (_ bv0 32))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {13310#(= create_data_~counter~0 (_ bv0 32))} is VALID [2022-02-20 23:47:57,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {13310#(= create_data_~counter~0 (_ bv0 32))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {13326#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} is VALID [2022-02-20 23:47:57,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {13326#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} assume !!~bvslt32(~counter~0, 3bv32); {13326#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} is VALID [2022-02-20 23:47:57,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {13326#(= (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 {13326#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} is VALID [2022-02-20 23:47:57,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {13326#(= (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 {13326#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} is VALID [2022-02-20 23:47:57,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {13326#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {13326#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} is VALID [2022-02-20 23:47:57,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {13326#(= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {13342#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} is VALID [2022-02-20 23:47:57,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {13342#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} assume !!~bvslt32(~counter~0, 3bv32); {13342#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} is VALID [2022-02-20 23:47:57,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {13342#(= (_ 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 {13342#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} is VALID [2022-02-20 23:47:57,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {13342#(= (_ 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 {13342#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} is VALID [2022-02-20 23:47:57,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {13342#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {13342#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} is VALID [2022-02-20 23:47:57,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {13342#(= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {13358#(= (bvadd create_data_~counter~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2022-02-20 23:47:57,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {13358#(= (bvadd create_data_~counter~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~counter~0, 3bv32); {13267#false} is VALID [2022-02-20 23:47:57,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {13267#false} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {13267#false} is VALID [2022-02-20 23:47:57,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {13267#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)))); {13267#false} is VALID [2022-02-20 23:47:57,788 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:47:57,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:57,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {13267#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)))); {13267#false} is VALID [2022-02-20 23:47:57,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {13267#false} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {13267#false} is VALID [2022-02-20 23:47:57,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {13374#(not (bvslt create_data_~counter~0 (_ bv3 32)))} assume !!~bvslt32(~counter~0, 3bv32); {13267#false} is VALID [2022-02-20 23:47:57,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {13378#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {13374#(not (bvslt create_data_~counter~0 (_ bv3 32)))} is VALID [2022-02-20 23:47:57,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {13378#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {13378#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 23:47:57,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {13378#(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 {13378#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 23:47:57,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {13378#(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 {13378#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 23:47:57,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {13378#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} assume !!~bvslt32(~counter~0, 3bv32); {13378#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 23:47:57,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {13394#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {13378#(not (bvslt (bvadd create_data_~counter~0 (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 23:47:57,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {13394#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {13394#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} is VALID [2022-02-20 23:47:57,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {13394#(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 {13394#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} is VALID [2022-02-20 23:47:57,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {13394#(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 {13394#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} is VALID [2022-02-20 23:47:57,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {13394#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} assume !!~bvslt32(~counter~0, 3bv32); {13394#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} is VALID [2022-02-20 23:47:57,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {13410#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {13394#(not (bvslt (bvadd create_data_~counter~0 (_ bv2 32)) (_ bv3 32)))} is VALID [2022-02-20 23:47:57,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {13410#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {13410#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} is VALID [2022-02-20 23:47:57,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {13410#(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 {13410#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} is VALID [2022-02-20 23:47:57,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {13410#(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 {13410#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} is VALID [2022-02-20 23:47:57,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {13410#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} assume !!~bvslt32(~counter~0, 3bv32); {13410#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} is VALID [2022-02-20 23:47:57,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {13266#true} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {13410#(not (bvslt (bvadd create_data_~counter~0 (_ bv3 32)) (_ bv3 32)))} is VALID [2022-02-20 23:47:57,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {13266#true} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {13266#true} is VALID [2022-02-20 23:47:57,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {13266#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); {13266#true} is VALID [2022-02-20 23:47:57,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {13266#true} assume !#t~short4; {13266#true} is VALID [2022-02-20 23:47:57,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {13266#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {13266#true} is VALID [2022-02-20 23:47:57,923 INFO L272 TraceCheckUtils]: 8: Hoare triple {13266#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {13266#true} is VALID [2022-02-20 23:47:57,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {13266#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; {13266#true} is VALID [2022-02-20 23:47:57,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {13266#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: L589 {13266#true} is VALID [2022-02-20 23:47:57,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {13266#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {13266#true} is VALID [2022-02-20 23:47:57,923 INFO L290 TraceCheckUtils]: 4: Hoare triple {13266#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: L588-1 {13266#true} is VALID [2022-02-20 23:47:57,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {13266#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: L588 {13266#true} is VALID [2022-02-20 23:47:57,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {13266#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; {13266#true} is VALID [2022-02-20 23:47:57,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {13266#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; {13266#true} is VALID [2022-02-20 23:47:57,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {13266#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); {13266#true} is VALID [2022-02-20 23:47:57,923 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:47:57,924 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:57,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758276399] [2022-02-20 23:47:57,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758276399] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:57,924 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:57,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-02-20 23:47:57,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824323062] [2022-02-20 23:47:57,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:57,924 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:47:57,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:57,925 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:47:57,985 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:47:57,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:47:57,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:57,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:47:57,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:47:57,986 INFO L87 Difference]: Start difference. First operand 244 states and 283 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:47:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:59,799 INFO L93 Difference]: Finished difference Result 241 states and 277 transitions. [2022-02-20 23:47:59,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:47:59,799 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:47:59,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:59,800 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:47:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2022-02-20 23:47:59,801 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:47:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2022-02-20 23:47:59,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 178 transitions. [2022-02-20 23:47:59,982 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:59,985 INFO L225 Difference]: With dead ends: 241 [2022-02-20 23:47:59,985 INFO L226 Difference]: Without dead ends: 241 [2022-02-20 23:47:59,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:47:59,987 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 47 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1243 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:47:59,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 1243 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:59,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-02-20 23:47:59,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2022-02-20 23:47:59,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:59,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand has 239 states, 176 states have (on average 1.5397727272727273) internal successors, (271), 234 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:59,992 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand has 239 states, 176 states have (on average 1.5397727272727273) internal successors, (271), 234 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:59,992 INFO L87 Difference]: Start difference. First operand 241 states. Second operand has 239 states, 176 states have (on average 1.5397727272727273) internal successors, (271), 234 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:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:59,994 INFO L93 Difference]: Finished difference Result 241 states and 277 transitions. [2022-02-20 23:47:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 277 transitions. [2022-02-20 23:47:59,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:59,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:59,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 176 states have (on average 1.5397727272727273) internal successors, (271), 234 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 241 states. [2022-02-20 23:47:59,996 INFO L87 Difference]: Start difference. First operand has 239 states, 176 states have (on average 1.5397727272727273) internal successors, (271), 234 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 241 states. [2022-02-20 23:48:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:00,001 INFO L93 Difference]: Finished difference Result 241 states and 277 transitions. [2022-02-20 23:48:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 277 transitions. [2022-02-20 23:48:00,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:00,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:00,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:00,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 176 states have (on average 1.5397727272727273) internal successors, (271), 234 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:48:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 275 transitions. [2022-02-20 23:48:00,004 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 275 transitions. Word has length 32 [2022-02-20 23:48:00,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:00,004 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 275 transitions. [2022-02-20 23:48:00,005 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:00,005 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 275 transitions. [2022-02-20 23:48:00,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:48:00,007 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:00,007 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] [2022-02-20 23:48:00,018 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:00,216 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:00,216 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:00,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1939829061, now seen corresponding path program 1 times [2022-02-20 23:48:00,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:00,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982982605] [2022-02-20 23:48:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:00,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:00,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:00,219 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:00,220 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:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:00,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:48:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:00,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:00,430 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:00,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {14426#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); {14426#true} is VALID [2022-02-20 23:48:00,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {14426#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; {14426#true} is VALID [2022-02-20 23:48:00,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {14426#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; {14426#true} is VALID [2022-02-20 23:48:00,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {14426#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: L588 {14426#true} is VALID [2022-02-20 23:48:00,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {14426#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: L588-1 {14426#true} is VALID [2022-02-20 23:48:00,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {14426#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {14426#true} is VALID [2022-02-20 23:48:00,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {14426#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: L589 {14426#true} is VALID [2022-02-20 23:48:00,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {14426#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; {14426#true} is VALID [2022-02-20 23:48:00,435 INFO L272 TraceCheckUtils]: 8: Hoare triple {14426#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {14426#true} is VALID [2022-02-20 23:48:00,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {14426#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {14426#true} is VALID [2022-02-20 23:48:00,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {14426#true} assume !#t~short4; {14426#true} is VALID [2022-02-20 23:48:00,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {14426#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); {14426#true} is VALID [2022-02-20 23:48:00,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {14426#true} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {14426#true} is VALID [2022-02-20 23:48:00,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {14426#true} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {14426#true} is VALID [2022-02-20 23:48:00,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {14426#true} assume !!~bvslt32(~counter~0, 3bv32); {14426#true} is VALID [2022-02-20 23:48:00,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {14426#true} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {14426#true} is VALID [2022-02-20 23:48:00,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {14426#true} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {14426#true} is VALID [2022-02-20 23:48:00,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {14426#true} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {14426#true} is VALID [2022-02-20 23:48:00,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {14426#true} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {14426#true} is VALID [2022-02-20 23:48:00,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {14426#true} assume !!~bvslt32(~counter~0, 3bv32); {14426#true} is VALID [2022-02-20 23:48:00,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {14426#true} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {14426#true} is VALID [2022-02-20 23:48:00,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {14426#true} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {14426#true} is VALID [2022-02-20 23:48:00,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {14426#true} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {14426#true} is VALID [2022-02-20 23:48:00,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {14426#true} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {14426#true} is VALID [2022-02-20 23:48:00,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {14426#true} assume !!~bvslt32(~counter~0, 3bv32); {14426#true} is VALID [2022-02-20 23:48:00,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {14426#true} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {14426#true} is VALID [2022-02-20 23:48:00,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {14426#true} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {14426#true} is VALID [2022-02-20 23:48:00,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {14426#true} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {14426#true} is VALID [2022-02-20 23:48:00,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {14426#true} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {14426#true} is VALID [2022-02-20 23:48:00,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {14426#true} assume !~bvslt32(~counter~0, 3bv32); {14426#true} is VALID [2022-02-20 23:48:00,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {14426#true} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~data~0.offset, 4bv32); srcloc: L558-4 {14426#true} is VALID [2022-02-20 23:48:00,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {14426#true} ~userInput~0 := #t~nondet11;havoc #t~nondet11; {14426#true} is VALID [2022-02-20 23:48:00,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {14426#true} #t~short14 := 0bv32 != #t~nondet12; {14426#true} is VALID [2022-02-20 23:48:00,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {14426#true} assume !#t~short14; {14426#true} is VALID [2022-02-20 23:48:00,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {14426#true} #t~short16 := #t~short14; {14426#true} is VALID [2022-02-20 23:48:00,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {14426#true} assume !#t~short16; {14426#true} is VALID [2022-02-20 23:48:00,440 INFO L290 TraceCheckUtils]: 36: Hoare triple {14426#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; {14426#true} is VALID [2022-02-20 23:48:00,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {14426#true} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~bvadd32(8bv32, ~data~0.offset), 4bv32); srcloc: L563-13 {14426#true} is VALID [2022-02-20 23:48:00,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {14426#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~data~0.base, ~bvadd32(12bv32, ~data~0.offset), 4bv32); srcloc: L567 {14426#true} is VALID [2022-02-20 23:48:00,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {14426#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; {14548#(= (select |#valid| create_data_~nextData~0.base) (_ bv1 1))} is VALID [2022-02-20 23:48:00,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {14548#(= (select |#valid| create_data_~nextData~0.base) (_ bv1 1))} assume !(1bv1 == #valid[~nextData~0.base]); {14427#false} is VALID [2022-02-20 23:48:00,442 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:00,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:00,442 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:00,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982982605] [2022-02-20 23:48:00,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982982605] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:00,442 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:00,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:00,443 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851620288] [2022-02-20 23:48:00,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:00,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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 41 [2022-02-20 23:48:00,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:00,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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:48:00,479 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:48:00,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:00,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:00,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:00,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:00,480 INFO L87 Difference]: Start difference. First operand 239 states and 275 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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:48:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:01,056 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2022-02-20 23:48:01,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:01,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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 41 [2022-02-20 23:48:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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:48:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2022-02-20 23:48:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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:48:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2022-02-20 23:48:01,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2022-02-20 23:48:01,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:01,227 INFO L225 Difference]: With dead ends: 241 [2022-02-20 23:48:01,228 INFO L226 Difference]: Without dead ends: 241 [2022-02-20 23:48:01,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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:01,228 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 233 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.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:01,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 233 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:01,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-02-20 23:48:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2022-02-20 23:48:01,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:01,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand has 235 states, 176 states have (on average 1.4715909090909092) internal successors, (259), 230 states have internal predecessors, (259), 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:01,231 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand has 235 states, 176 states have (on average 1.4715909090909092) internal successors, (259), 230 states have internal predecessors, (259), 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:01,232 INFO L87 Difference]: Start difference. First operand 241 states. Second operand has 235 states, 176 states have (on average 1.4715909090909092) internal successors, (259), 230 states have internal predecessors, (259), 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:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:01,234 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2022-02-20 23:48:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 269 transitions. [2022-02-20 23:48:01,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:01,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:01,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 176 states have (on average 1.4715909090909092) internal successors, (259), 230 states have internal predecessors, (259), 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:48:01,235 INFO L87 Difference]: Start difference. First operand has 235 states, 176 states have (on average 1.4715909090909092) internal successors, (259), 230 states have internal predecessors, (259), 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:48:01,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:01,237 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2022-02-20 23:48:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 269 transitions. [2022-02-20 23:48:01,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:01,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:01,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:01,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 176 states have (on average 1.4715909090909092) internal successors, (259), 230 states have internal predecessors, (259), 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:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 263 transitions. [2022-02-20 23:48:01,242 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 263 transitions. Word has length 41 [2022-02-20 23:48:01,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:01,242 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 263 transitions. [2022-02-20 23:48:01,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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:48:01,242 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 263 transitions. [2022-02-20 23:48:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:48:01,243 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:01,243 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] [2022-02-20 23:48:01,251 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:01,450 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:01,451 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:01,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1939829060, now seen corresponding path program 1 times [2022-02-20 23:48:01,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:01,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006705780] [2022-02-20 23:48:01,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:01,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:01,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:01,453 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:01,453 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:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:01,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:48:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:01,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:01,681 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:01,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {15509#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); {15509#true} is VALID [2022-02-20 23:48:01,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {15509#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; {15509#true} is VALID [2022-02-20 23:48:01,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {15509#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; {15509#true} is VALID [2022-02-20 23:48:01,692 INFO L290 TraceCheckUtils]: 3: Hoare triple {15509#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: L588 {15509#true} is VALID [2022-02-20 23:48:01,692 INFO L290 TraceCheckUtils]: 4: Hoare triple {15509#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: L588-1 {15509#true} is VALID [2022-02-20 23:48:01,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {15509#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {15509#true} is VALID [2022-02-20 23:48:01,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {15509#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: L589 {15509#true} is VALID [2022-02-20 23:48:01,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {15509#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; {15509#true} is VALID [2022-02-20 23:48:01,692 INFO L272 TraceCheckUtils]: 8: Hoare triple {15509#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {15509#true} is VALID [2022-02-20 23:48:01,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {15509#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {15509#true} is VALID [2022-02-20 23:48:01,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {15509#true} assume !#t~short4; {15509#true} is VALID [2022-02-20 23:48:01,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {15509#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); {15509#true} is VALID [2022-02-20 23:48:01,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {15509#true} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {15509#true} is VALID [2022-02-20 23:48:01,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {15509#true} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {15509#true} is VALID [2022-02-20 23:48:01,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {15509#true} assume !!~bvslt32(~counter~0, 3bv32); {15509#true} is VALID [2022-02-20 23:48:01,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {15509#true} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {15509#true} is VALID [2022-02-20 23:48:01,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {15509#true} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {15509#true} is VALID [2022-02-20 23:48:01,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {15509#true} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {15509#true} is VALID [2022-02-20 23:48:01,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {15509#true} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {15509#true} is VALID [2022-02-20 23:48:01,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {15509#true} assume !!~bvslt32(~counter~0, 3bv32); {15509#true} is VALID [2022-02-20 23:48:01,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {15509#true} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {15509#true} is VALID [2022-02-20 23:48:01,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {15509#true} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {15509#true} is VALID [2022-02-20 23:48:01,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {15509#true} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {15509#true} is VALID [2022-02-20 23:48:01,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {15509#true} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {15509#true} is VALID [2022-02-20 23:48:01,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {15509#true} assume !!~bvslt32(~counter~0, 3bv32); {15509#true} is VALID [2022-02-20 23:48:01,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {15509#true} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {15509#true} is VALID [2022-02-20 23:48:01,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {15509#true} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {15509#true} is VALID [2022-02-20 23:48:01,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {15509#true} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {15509#true} is VALID [2022-02-20 23:48:01,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {15509#true} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {15509#true} is VALID [2022-02-20 23:48:01,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {15509#true} assume !~bvslt32(~counter~0, 3bv32); {15509#true} is VALID [2022-02-20 23:48:01,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {15509#true} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~data~0.offset, 4bv32); srcloc: L558-4 {15509#true} is VALID [2022-02-20 23:48:01,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {15509#true} ~userInput~0 := #t~nondet11;havoc #t~nondet11; {15509#true} is VALID [2022-02-20 23:48:01,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {15509#true} #t~short14 := 0bv32 != #t~nondet12; {15509#true} is VALID [2022-02-20 23:48:01,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {15509#true} assume !#t~short14; {15509#true} is VALID [2022-02-20 23:48:01,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {15509#true} #t~short16 := #t~short14; {15509#true} is VALID [2022-02-20 23:48:01,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {15509#true} assume !#t~short16; {15509#true} is VALID [2022-02-20 23:48:01,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {15509#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; {15509#true} is VALID [2022-02-20 23:48:01,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {15509#true} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~bvadd32(8bv32, ~data~0.offset), 4bv32); srcloc: L563-13 {15509#true} is VALID [2022-02-20 23:48:01,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {15509#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~data~0.base, ~bvadd32(12bv32, ~data~0.offset), 4bv32); srcloc: L567 {15509#true} is VALID [2022-02-20 23:48:01,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {15509#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; {15631#(and (= (_ bv16 32) (select |#length| create_data_~nextData~0.base)) (= create_data_~nextData~0.offset (_ bv0 32)))} is VALID [2022-02-20 23:48:01,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {15631#(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))); {15510#false} is VALID [2022-02-20 23:48:01,698 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:01,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:01,698 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:01,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006705780] [2022-02-20 23:48:01,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006705780] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:01,699 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:01,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:01,699 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805124997] [2022-02-20 23:48:01,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:01,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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 41 [2022-02-20 23:48:01,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:01,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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:48:01,730 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:48:01,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:01,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:01,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:01,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:01,731 INFO L87 Difference]: Start difference. First operand 235 states and 263 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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:48:02,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:02,382 INFO L93 Difference]: Finished difference Result 237 states and 257 transitions. [2022-02-20 23:48:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:02,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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 41 [2022-02-20 23:48:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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:48:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2022-02-20 23:48:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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:48:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2022-02-20 23:48:02,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 167 transitions. [2022-02-20 23:48:02,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:02,548 INFO L225 Difference]: With dead ends: 237 [2022-02-20 23:48:02,548 INFO L226 Difference]: Without dead ends: 237 [2022-02-20 23:48:02,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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:02,548 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 18 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 232 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:02,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 232 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:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-02-20 23:48:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2022-02-20 23:48:02,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:02,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 231 states, 176 states have (on average 1.4034090909090908) internal successors, (247), 226 states have internal predecessors, (247), 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:02,552 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 231 states, 176 states have (on average 1.4034090909090908) internal successors, (247), 226 states have internal predecessors, (247), 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:02,552 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 231 states, 176 states have (on average 1.4034090909090908) internal successors, (247), 226 states have internal predecessors, (247), 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:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:02,555 INFO L93 Difference]: Finished difference Result 237 states and 257 transitions. [2022-02-20 23:48:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 257 transitions. [2022-02-20 23:48:02,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:02,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:02,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 176 states have (on average 1.4034090909090908) internal successors, (247), 226 states have internal predecessors, (247), 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 237 states. [2022-02-20 23:48:02,556 INFO L87 Difference]: Start difference. First operand has 231 states, 176 states have (on average 1.4034090909090908) internal successors, (247), 226 states have internal predecessors, (247), 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 237 states. [2022-02-20 23:48:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:02,558 INFO L93 Difference]: Finished difference Result 237 states and 257 transitions. [2022-02-20 23:48:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 257 transitions. [2022-02-20 23:48:02,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:02,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:02,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:02,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 176 states have (on average 1.4034090909090908) internal successors, (247), 226 states have internal predecessors, (247), 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:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 251 transitions. [2022-02-20 23:48:02,562 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 251 transitions. Word has length 41 [2022-02-20 23:48:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:02,562 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 251 transitions. [2022-02-20 23:48:02,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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:48:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 251 transitions. [2022-02-20 23:48:02,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 23:48:02,562 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:02,563 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] [2022-02-20 23:48:02,572 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:02,770 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:02,771 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:02,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:02,771 INFO L85 PathProgramCache]: Analyzing trace with hash -663465002, now seen corresponding path program 1 times [2022-02-20 23:48:02,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:02,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579283573] [2022-02-20 23:48:02,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:02,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:02,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:02,774 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:02,776 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:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:02,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:48:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:03,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:03,021 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,096 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:03,142 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:03,498 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-02-20 23:48:03,498 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 21 treesize of output 37 [2022-02-20 23:48:03,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {16576#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); {16576#true} is VALID [2022-02-20 23:48:03,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {16576#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; {16576#true} is VALID [2022-02-20 23:48:03,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {16576#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; {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:03,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {16587#(= (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: L588 {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:03,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {16587#(= (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: L588-1 {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:03,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:03,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {16587#(= (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: L589 {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:03,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {16587#(= (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; {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:03,669 INFO L272 TraceCheckUtils]: 8: Hoare triple {16587#(= (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); {16606#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:48:03,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {16606#(= |old(#valid)| |#valid|)} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {16606#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:48:03,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {16606#(= |old(#valid)| |#valid|)} assume !#t~short4; {16606#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:48:03,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {16606#(= |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); {16616#(and (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)))) (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)))} is VALID [2022-02-20 23:48:03,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {16616#(and (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)))) (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {16620#(and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (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:03,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {16620#(and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (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; {16620#(and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (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:03,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {16620#(and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (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); {16620#(and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (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:03,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {16620#(and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (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 {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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 {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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; {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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; {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} assume !!~bvslt32(~counter~0, 3bv32); {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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 {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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 {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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; {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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; {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} assume !!~bvslt32(~counter~0, 3bv32); {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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 {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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 {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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; {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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; {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} assume !~bvslt32(~counter~0, 3bv32); {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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 {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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; {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} #t~short14 := 0bv32 != #t~nondet12; {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} assume !#t~short14; {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} #t~short16 := #t~short14; {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} assume !#t~short16; {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,704 INFO L290 TraceCheckUtils]: 36: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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; {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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 {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,709 INFO L290 TraceCheckUtils]: 38: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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 {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,710 INFO L290 TraceCheckUtils]: 39: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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; {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,710 INFO L290 TraceCheckUtils]: 40: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} #res.base, #res.offset := ~data~0.base, ~data~0.offset; {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} assume true; {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (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:03,713 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16630#(exists ((v_arrayElimCell_46 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_666 (_ BitVec 1))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_666) v_arrayElimCell_46 (_ bv1 1)) |#valid|)))} {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} #274#return; {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:03,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[append_~node~0#1.base]); {16577#false} is VALID [2022-02-20 23:48:03,714 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:03,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:48:05,843 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:05,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579283573] [2022-02-20 23:48:05,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579283573] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:48:05,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [133399912] [2022-02-20 23:48:05,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:05,844 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:48:05,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:48:05,845 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:48:05,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-02-20 23:48:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:06,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:48:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:06,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:06,169 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:10,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:48:10,472 INFO L356 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-02-20 23:48:10,473 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 2 case distinctions, treesize of input 15 treesize of output 29 [2022-02-20 23:48:10,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {16576#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); {16576#true} is VALID [2022-02-20 23:48:10,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {16576#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; {16576#true} is VALID [2022-02-20 23:48:10,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {16576#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; {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:10,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {16587#(= (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: L588 {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:10,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {16587#(= (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: L588-1 {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:10,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:10,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {16587#(= (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: L589 {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:10,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {16587#(= (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; {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:10,497 INFO L272 TraceCheckUtils]: 8: Hoare triple {16587#(= (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); {16606#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:48:10,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {16606#(= |old(#valid)| |#valid|)} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {16606#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:48:10,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {16606#(= |old(#valid)| |#valid|)} assume !#t~short4; {16606#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:48:10,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {16606#(= |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); {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} assume !!~bvslt32(~counter~0, 3bv32); {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ 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 {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ 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 {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} assume !!~bvslt32(~counter~0, 3bv32); {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ 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 {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ 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 {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} assume !!~bvslt32(~counter~0, 3bv32); {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ 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 {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ 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 {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,505 INFO L290 TraceCheckUtils]: 28: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} assume !~bvslt32(~counter~0, 3bv32); {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~data~0.offset, 4bv32); srcloc: L558-4 {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} ~userInput~0 := #t~nondet11;havoc #t~nondet11; {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} #t~short14 := 0bv32 != #t~nondet12; {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} assume !#t~short14; {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} #t~short16 := #t~short14; {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} assume !#t~short16; {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ 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; {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~bvadd32(8bv32, ~data~0.offset), 4bv32); srcloc: L563-13 {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:48:10,509 INFO L290 TraceCheckUtils]: 38: Hoare triple {16755#(exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~data~0.base, ~bvadd32(12bv32, ~data~0.offset), 4bv32); srcloc: L567 {16837#(exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|)) (= (select |#valid| create_data_~data~0.base) (_ bv1 1))))} is VALID [2022-02-20 23:48:10,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {16837#(exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|)) (= (select |#valid| create_data_~data~0.base) (_ bv1 1))))} assume !(0bv32 != #t~nondet20);havoc #t~nondet20; {16837#(exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|)) (= (select |#valid| create_data_~data~0.base) (_ bv1 1))))} is VALID [2022-02-20 23:48:10,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {16837#(exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|)) (= (select |#valid| create_data_~data~0.base) (_ bv1 1))))} #res.base, #res.offset := ~data~0.base, ~data~0.offset; {16837#(exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|)) (= (select |#valid| create_data_~data~0.base) (_ bv1 1))))} is VALID [2022-02-20 23:48:10,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {16837#(exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|)) (= (select |#valid| create_data_~data~0.base) (_ bv1 1))))} assume true; {16837#(exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|)) (= (select |#valid| create_data_~data~0.base) (_ bv1 1))))} is VALID [2022-02-20 23:48:10,513 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16837#(exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |#valid|)) (= (select |#valid| create_data_~data~0.base) (_ bv1 1))))} {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} #274#return; {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:10,513 INFO L290 TraceCheckUtils]: 43: Hoare triple {16587#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[append_~node~0#1.base]); {16577#false} is VALID [2022-02-20 23:48:10,513 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:10,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:10,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [133399912] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:10,514 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:48:10,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-02-20 23:48:10,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369688707] [2022-02-20 23:48:10,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:10,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-02-20 23:48:10,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:10,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:10,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:10,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:10,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:10,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:10,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=62, Unknown=3, NotChecked=0, Total=90 [2022-02-20 23:48:10,557 INFO L87 Difference]: Start difference. First operand 231 states and 251 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:11,993 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2022-02-20 23:48:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:11,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-02-20 23:48:11,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2022-02-20 23:48:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2022-02-20 23:48:11,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 211 transitions. [2022-02-20 23:48:12,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:12,212 INFO L225 Difference]: With dead ends: 290 [2022-02-20 23:48:12,213 INFO L226 Difference]: Without dead ends: 290 [2022-02-20 23:48:12,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=25, Invalid=62, Unknown=3, NotChecked=0, Total=90 [2022-02-20 23:48:12,213 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 76 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:12,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 397 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 177 Unchecked, 0.3s Time] [2022-02-20 23:48:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-02-20 23:48:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 246. [2022-02-20 23:48:12,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:12,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 290 states. Second operand has 246 states, 189 states have (on average 1.4074074074074074) internal successors, (266), 239 states have internal predecessors, (266), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:48:12,216 INFO L74 IsIncluded]: Start isIncluded. First operand 290 states. Second operand has 246 states, 189 states have (on average 1.4074074074074074) internal successors, (266), 239 states have internal predecessors, (266), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:48:12,217 INFO L87 Difference]: Start difference. First operand 290 states. Second operand has 246 states, 189 states have (on average 1.4074074074074074) internal successors, (266), 239 states have internal predecessors, (266), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:48:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:12,220 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2022-02-20 23:48:12,220 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 319 transitions. [2022-02-20 23:48:12,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:12,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:12,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 189 states have (on average 1.4074074074074074) internal successors, (266), 239 states have internal predecessors, (266), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Second operand 290 states. [2022-02-20 23:48:12,221 INFO L87 Difference]: Start difference. First operand has 246 states, 189 states have (on average 1.4074074074074074) internal successors, (266), 239 states have internal predecessors, (266), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Second operand 290 states. [2022-02-20 23:48:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:12,223 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2022-02-20 23:48:12,224 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 319 transitions. [2022-02-20 23:48:12,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:12,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:12,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:12,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:12,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 189 states have (on average 1.4074074074074074) internal successors, (266), 239 states have internal predecessors, (266), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:48:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 272 transitions. [2022-02-20 23:48:12,226 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 272 transitions. Word has length 44 [2022-02-20 23:48:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:12,227 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 272 transitions. [2022-02-20 23:48:12,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 272 transitions. [2022-02-20 23:48:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 23:48:12,227 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:12,227 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] [2022-02-20 23:48:12,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:12,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-02-20 23:48:12,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:12,629 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:48:12,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:12,629 INFO L85 PathProgramCache]: Analyzing trace with hash -663465001, now seen corresponding path program 1 times [2022-02-20 23:48:12,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:12,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765962377] [2022-02-20 23:48:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:12,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:12,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:12,631 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:48:12,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-02-20 23:48:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:12,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:48:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:12,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:12,884 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:12,887 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:13,013 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:13,064 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:13,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:13,438 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-02-20 23:48:13,438 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 2 case distinctions, treesize of input 15 treesize of output 27 [2022-02-20 23:48:13,456 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:48:13,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:48:13,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {17968#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); {17968#true} is VALID [2022-02-20 23:48:13,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {17968#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; {17968#true} is VALID [2022-02-20 23:48:13,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {17968#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; {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:13,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |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: L588 {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:13,532 INFO L290 TraceCheckUtils]: 4: Hoare triple {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#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: L588-1 {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:13,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:13,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#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: L589 {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:13,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:13,533 INFO L272 TraceCheckUtils]: 8: Hoare triple {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {17998#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:48:13,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {17998#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {17998#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:48:13,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {17998#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume !#t~short4; {17998#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:48:13,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {17998#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} 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); {18008#(and (exists ((v_ArrVal_886 (_ BitVec 32))) (= (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) |create_data_#t~malloc7.base| (_ bv80 32)) |#length|)) (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)))} is VALID [2022-02-20 23:48:13,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {18008#(and (exists ((v_ArrVal_886 (_ BitVec 32))) (= (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) |create_data_#t~malloc7.base| (_ bv80 32)) |#length|)) (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {18012#(and (exists ((v_ArrVal_886 (_ BitVec 32))) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv80 32)))) (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)))} is VALID [2022-02-20 23:48:13,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {18012#(and (exists ((v_ArrVal_886 (_ BitVec 32))) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv80 32)))) (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {18012#(and (exists ((v_ArrVal_886 (_ BitVec 32))) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv80 32)))) (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)))} is VALID [2022-02-20 23:48:13,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {18012#(and (exists ((v_ArrVal_886 (_ BitVec 32))) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv80 32)))) (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)))} assume !!~bvslt32(~counter~0, 3bv32); {18012#(and (exists ((v_ArrVal_886 (_ BitVec 32))) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv80 32)))) (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)))} is VALID [2022-02-20 23:48:13,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {18012#(and (exists ((v_ArrVal_886 (_ BitVec 32))) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv80 32)))) (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} assume !!~bvslt32(~counter~0, 3bv32); {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} assume !!~bvslt32(~counter~0, 3bv32); {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} assume !~bvslt32(~counter~0, 3bv32); {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~data~0.offset, 4bv32); srcloc: L558-4 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} ~userInput~0 := #t~nondet11;havoc #t~nondet11; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} #t~short14 := 0bv32 != #t~nondet12; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} assume !#t~short14; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,566 INFO L290 TraceCheckUtils]: 34: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} #t~short16 := #t~short14; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} assume !#t~short16; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} 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; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~bvadd32(8bv32, ~data~0.offset), 4bv32); srcloc: L563-13 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~data~0.base, ~bvadd32(12bv32, ~data~0.offset), 4bv32); srcloc: L567 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} assume !(0bv32 != #t~nondet20);havoc #t~nondet20; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} #res.base, #res.offset := ~data~0.base, ~data~0.offset; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,574 INFO L290 TraceCheckUtils]: 41: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} assume true; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:13,576 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} #274#return; {18104#(and (exists ((v_arrayElimCell_50 (_ BitVec 32))) (and (or (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= v_arrayElimCell_50 |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#length| v_arrayElimCell_50) (_ bv80 32)))) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:13,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {18104#(and (exists ((v_arrayElimCell_50 (_ BitVec 32))) (and (or (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= v_arrayElimCell_50 |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#length| v_arrayElimCell_50) (_ bv80 32)))) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, append_~node~0#1.offset), #length[append_~node~0#1.base]) && ~bvule32(append_~node~0#1.offset, ~bvadd32(4bv32, append_~node~0#1.offset))) && ~bvule32(0bv32, append_~node~0#1.offset)); {17969#false} is VALID [2022-02-20 23:48:13,577 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:13,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:48:14,336 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:14,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765962377] [2022-02-20 23:48:14,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765962377] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:48:14,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1125690351] [2022-02-20 23:48:14,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:14,337 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:48:14,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:48:14,338 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:48:14,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-02-20 23:48:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:14,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:48:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:14,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:14,855 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:14,859 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:15,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:15,341 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-02-20 23:48:15,341 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 2 case distinctions, treesize of input 15 treesize of output 27 [2022-02-20 23:48:15,350 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:48:15,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:48:15,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {17968#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); {17968#true} is VALID [2022-02-20 23:48:15,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {17968#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; {18119#(= |ULTIMATE.start_main_~#list~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:48:15,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {18119#(= |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; {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:15,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |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: L588 {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:15,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#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: L588-1 {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:15,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:15,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#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: L589 {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:15,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:15,407 INFO L272 TraceCheckUtils]: 8: Hoare triple {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {17998#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:48:15,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {17998#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {17998#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:48:15,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {17998#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume !#t~short4; {17998#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:48:15,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {17998#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} 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); {18150#(exists ((create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (exists ((v_ArrVal_1002 (_ BitVec 32))) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_1002) |create_data_#t~malloc7.base| (_ bv80 32))))))} is VALID [2022-02-20 23:48:15,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {18150#(exists ((create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (exists ((v_ArrVal_1002 (_ BitVec 32))) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_1002) |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 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} assume !!~bvslt32(~counter~0, 3bv32); {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} assume !!~bvslt32(~counter~0, 3bv32); {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} assume !!~bvslt32(~counter~0, 3bv32); {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} assume !~bvslt32(~counter~0, 3bv32); {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~data~0.offset, 4bv32); srcloc: L558-4 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} ~userInput~0 := #t~nondet11;havoc #t~nondet11; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} #t~short14 := 0bv32 != #t~nondet12; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} assume !#t~short14; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} #t~short16 := #t~short14; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} assume !#t~short16; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} 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; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call write~intINTTYPE4(0bv32, ~data~0.base, ~bvadd32(8bv32, ~data~0.offset), 4bv32); srcloc: L563-13 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~data~0.base, ~bvadd32(12bv32, ~data~0.offset), 4bv32); srcloc: L567 {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} assume !(0bv32 != #t~nondet20);havoc #t~nondet20; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} #res.base, #res.offset := ~data~0.base, ~data~0.offset; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} assume true; {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} is VALID [2022-02-20 23:48:15,451 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18022#(exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (bvneg (select |old(#valid)| create_data_~data~0.base)) (_ bv0 1)) (= |#length| (store (store |old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32)))))} {17979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} #274#return; {18104#(and (exists ((v_arrayElimCell_50 (_ BitVec 32))) (and (or (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= v_arrayElimCell_50 |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#length| v_arrayElimCell_50) (_ bv80 32)))) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:15,452 INFO L290 TraceCheckUtils]: 43: Hoare triple {18104#(and (exists ((v_arrayElimCell_50 (_ BitVec 32))) (and (or (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= v_arrayElimCell_50 |ULTIMATE.start_append_~node~0#1.base|)) (= (select |#length| v_arrayElimCell_50) (_ bv80 32)))) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, append_~node~0#1.offset), #length[append_~node~0#1.base]) && ~bvule32(append_~node~0#1.offset, ~bvadd32(4bv32, append_~node~0#1.offset))) && ~bvule32(0bv32, append_~node~0#1.offset)); {17969#false} is VALID [2022-02-20 23:48:15,452 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:15,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:15,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1125690351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:15,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:48:15,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2022-02-20 23:48:15,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783984490] [2022-02-20 23:48:15,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:15,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-02-20 23:48:15,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:15,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:15,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:15,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:48:15,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:15,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:48:15,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:48:15,497 INFO L87 Difference]: Start difference. First operand 246 states and 272 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)