./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-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_test01-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 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:46:58,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:46:58,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:46:58,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:46:58,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:46:58,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:46:58,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:46:58,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:46:58,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:46:58,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:46:58,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:46:58,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:46:58,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:46:58,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:46:58,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:46:58,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:46:58,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:46:58,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:46:58,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:46:58,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:46:58,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:46:58,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:46:58,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:46:58,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:46:58,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:46:58,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:46:58,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:46:58,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:46:58,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:46:58,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:46:58,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:46:58,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:46:58,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:46:58,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:46:58,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:46:58,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:46:58,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:46:58,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:46:58,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:46:58,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:46:58,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:46:58,782 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:46:58,813 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:46:58,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:46:58,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:46:58,817 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:46:58,818 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:46:58,818 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:46:58,818 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:46:58,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:46:58,819 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:46:58,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:46:58,820 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:46:58,820 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:46:58,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:46:58,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:46:58,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:46:58,821 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:46:58,821 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:46:58,821 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:46:58,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:46:58,821 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:46:58,822 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:46:58,822 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:46:58,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:46:58,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:46:58,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:46:58,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:58,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:46:58,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:46:58,824 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:46:58,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:46:58,824 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 -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2022-02-20 23:46:59,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:46:59,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:46:59,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:46:59,038 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:46:59,039 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:46:59,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2022-02-20 23:46:59,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec202653/2d4987ac19d34456a0c2afa9cb4d77e1/FLAG3b4760971 [2022-02-20 23:46:59,629 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:46:59,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2022-02-20 23:46:59,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec202653/2d4987ac19d34456a0c2afa9cb4d77e1/FLAG3b4760971 [2022-02-20 23:47:00,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec202653/2d4987ac19d34456a0c2afa9cb4d77e1 [2022-02-20 23:47:00,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:47:00,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:47:00,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:00,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:47:00,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:47:00,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:00" (1/1) ... [2022-02-20 23:47:00,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d900d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:00, skipping insertion in model container [2022-02-20 23:47:00,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:00" (1/1) ... [2022-02-20 23:47:00,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:47:00,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:47:00,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:00,595 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:00,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@751faeab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:00, skipping insertion in model container [2022-02-20 23:47:00,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:00,597 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:47:00,600 INFO L158 Benchmark]: Toolchain (without parser) took 466.88ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 48.6MB in the beginning and 84.3MB in the end (delta: -35.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:47:00,601 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:47:00,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.85ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 48.4MB in the beginning and 84.3MB in the end (delta: -35.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:47:00,604 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.13ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.85ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 48.4MB in the beginning and 84.3MB in the end (delta: -35.8MB). 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_test01-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 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:47:02,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:47:02,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:47:02,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:47:02,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:47:02,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:47:02,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:47:02,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:47:02,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:47:02,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:47:02,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:47:02,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:47:02,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:47:02,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:47:02,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:47:02,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:47:02,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:47:02,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:47:02,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:47:02,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:47:02,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:47:02,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:47:02,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:47:02,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:47:02,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:47:02,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:47:02,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:47:02,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:47:02,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:47:02,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:47:02,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:47:02,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:47:02,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:47:02,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:47:02,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:47:02,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:47:02,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:47:02,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:47:02,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:47:02,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:47:02,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:47:02,577 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:02,613 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:47:02,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:47:02,615 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:47:02,615 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:47:02,616 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:47:02,616 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:47:02,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:47:02,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:47:02,618 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:47:02,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:47:02,620 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:47:02,620 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:47:02,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:47:02,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:47:02,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:47:02,621 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:47:02,621 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:47:02,621 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:47:02,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:47:02,621 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:47:02,622 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:47:02,622 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:47:02,622 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:47:02,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:47:02,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:47:02,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:47:02,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:47:02,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:02,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:47:02,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:47:02,624 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:47:02,624 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:47:02,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:47:02,625 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 -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2022-02-20 23:47:02,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:47:02,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:47:02,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:47:02,968 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:47:02,968 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:47:02,970 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2022-02-20 23:47:03,044 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8041c5ac4/10ae1238bc844aecb125d6ad7c46137f/FLAG2e5bb77c9 [2022-02-20 23:47:03,618 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:47:03,619 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2022-02-20 23:47:03,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8041c5ac4/10ae1238bc844aecb125d6ad7c46137f/FLAG2e5bb77c9 [2022-02-20 23:47:03,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8041c5ac4/10ae1238bc844aecb125d6ad7c46137f [2022-02-20 23:47:03,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:47:03,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:47:03,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:03,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:47:03,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:47:03,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:03" (1/1) ... [2022-02-20 23:47:03,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e02110d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:03, skipping insertion in model container [2022-02-20 23:47:03,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:03" (1/1) ... [2022-02-20 23:47:03,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:47:03,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:47:04,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:04,385 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:47:04,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:47:04,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:04,461 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:47:04,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:04,562 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:47:04,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:04 WrapperNode [2022-02-20 23:47:04,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:04,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:47:04,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:47:04,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:47:04,571 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:04" (1/1) ... [2022-02-20 23:47:04,610 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:04" (1/1) ... [2022-02-20 23:47:04,635 INFO L137 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-02-20 23:47:04,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:47:04,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:47:04,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:47:04,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:47:04,644 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:04" (1/1) ... [2022-02-20 23:47:04,644 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:04" (1/1) ... [2022-02-20 23:47:04,652 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:04" (1/1) ... [2022-02-20 23:47:04,652 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:04" (1/1) ... [2022-02-20 23:47:04,665 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:04" (1/1) ... [2022-02-20 23:47:04,673 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:04" (1/1) ... [2022-02-20 23:47:04,678 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:04" (1/1) ... [2022-02-20 23:47:04,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:47:04,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:47:04,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:47:04,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:47:04,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:04" (1/1) ... [2022-02-20 23:47:04,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:04,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:04,728 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:04,731 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:04,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:47:04,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:47:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2022-02-20 23:47:04,764 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2022-02-20 23:47:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:47:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:47:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:47:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:47:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:47:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:47:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:47:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:47:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:47:04,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:47:04,934 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:47:04,936 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:47:05,860 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:47:05,867 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:47:05,868 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:47:05,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:05 BoogieIcfgContainer [2022-02-20 23:47:05,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:47:05,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:47:05,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:47:05,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:47:05,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:47:03" (1/3) ... [2022-02-20 23:47:05,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa36075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:05, skipping insertion in model container [2022-02-20 23:47:05,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:04" (2/3) ... [2022-02-20 23:47:05,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa36075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:05, skipping insertion in model container [2022-02-20 23:47:05,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:05" (3/3) ... [2022-02-20 23:47:05,878 INFO L111 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-2.i [2022-02-20 23:47:05,883 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:47:05,884 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2022-02-20 23:47:05,928 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:47:05,933 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:05,934 INFO L340 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2022-02-20 23:47:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 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:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:47:05,960 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:05,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:47:05,960 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:05,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:05,965 INFO L85 PathProgramCache]: Analyzing trace with hash 4835205, now seen corresponding path program 1 times [2022-02-20 23:47:05,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:05,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52917635] [2022-02-20 23:47:05,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:05,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:05,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:05,983 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:05,994 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:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:06,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:47:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:06,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:06,212 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:06,273 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:47:06,274 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:06,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#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); {191#true} is VALID [2022-02-20 23:47:06,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#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; {199#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:06,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {199#(= (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; {203#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:47:06,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {203#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[append_~pointerToList#1.base]); {192#false} is VALID [2022-02-20 23:47:06,328 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:06,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:06,330 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:06,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52917635] [2022-02-20 23:47:06,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52917635] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:06,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:06,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:06,333 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974224133] [2022-02-20 23:47:06,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:06,339 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:06,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:06,343 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:06,354 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:06,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:06,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:06,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:06,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:06,391 INFO L87 Difference]: Start difference. First operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 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 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:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:07,913 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2022-02-20 23:47:07,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:07,913 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:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:07,915 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:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2022-02-20 23:47:07,933 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:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2022-02-20 23:47:07,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 235 transitions. [2022-02-20 23:47:08,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:08,268 INFO L225 Difference]: With dead ends: 208 [2022-02-20 23:47:08,268 INFO L226 Difference]: Without dead ends: 206 [2022-02-20 23:47:08,270 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:08,273 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:08,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 288 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:47:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-02-20 23:47:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2022-02-20 23:47:08,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:08,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:08,314 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:08,316 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:08,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:08,328 INFO L93 Difference]: Finished difference Result 206 states and 218 transitions. [2022-02-20 23:47:08,328 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 218 transitions. [2022-02-20 23:47:08,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:08,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:08,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 206 states. [2022-02-20 23:47:08,332 INFO L87 Difference]: Start difference. First operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 206 states. [2022-02-20 23:47:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:08,345 INFO L93 Difference]: Finished difference Result 206 states and 218 transitions. [2022-02-20 23:47:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 218 transitions. [2022-02-20 23:47:08,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:08,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:08,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:08,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2022-02-20 23:47:08,358 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 4 [2022-02-20 23:47:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:08,358 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2022-02-20 23:47:08,358 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:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2022-02-20 23:47:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:47:08,359 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:08,359 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:47:08,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:47:08,571 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:08,572 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:08,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:08,573 INFO L85 PathProgramCache]: Analyzing trace with hash 4835206, now seen corresponding path program 1 times [2022-02-20 23:47:08,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:08,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963990899] [2022-02-20 23:47:08,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:08,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:08,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:08,576 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:08,578 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:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:08,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:47:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:08,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:08,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:08,660 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:08,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:08,746 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:08,765 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:08,765 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:47:08,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {1008#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); {1008#true} is VALID [2022-02-20 23:47:08,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {1008#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; {1016#(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:08,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {1016#(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; {1020#(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:08,799 INFO L290 TraceCheckUtils]: 3: Hoare triple {1020#(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)); {1009#false} is VALID [2022-02-20 23:47:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:08,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:08,799 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:08,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963990899] [2022-02-20 23:47:08,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963990899] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:08,800 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:08,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:08,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300025570] [2022-02-20 23:47:08,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:08,816 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:08,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:08,816 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:08,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:08,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:08,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:08,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:08,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:08,824 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:10,469 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-02-20 23:47:10,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:47:10,470 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:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:10,470 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:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2022-02-20 23:47:10,477 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:10,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2022-02-20 23:47:10,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 212 transitions. [2022-02-20 23:47:10,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:10,726 INFO L225 Difference]: With dead ends: 196 [2022-02-20 23:47:10,726 INFO L226 Difference]: Without dead ends: 196 [2022-02-20 23:47:10,726 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:10,727 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 341 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.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:10,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 341 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:47:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-02-20 23:47:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2022-02-20 23:47:10,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:10,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 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:10,745 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 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:10,747 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 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:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:10,756 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-02-20 23:47:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2022-02-20 23:47:10,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:10,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:10,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 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 196 states. [2022-02-20 23:47:10,761 INFO L87 Difference]: Start difference. First operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 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 196 states. [2022-02-20 23:47:10,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:10,776 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-02-20 23:47:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2022-02-20 23:47:10,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:10,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:10,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:10,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 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:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2022-02-20 23:47:10,784 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 4 [2022-02-20 23:47:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:10,785 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2022-02-20 23:47:10,786 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:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2022-02-20 23:47:10,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:47:10,786 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:10,786 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:47:10,805 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:10,996 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:10,996 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:10,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:10,997 INFO L85 PathProgramCache]: Analyzing trace with hash 149891462, now seen corresponding path program 1 times [2022-02-20 23:47:10,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:10,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106791378] [2022-02-20 23:47:10,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:10,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:10,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:10,999 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:11,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:47:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:11,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:47:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:11,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:11,068 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,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#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); {1798#true} is VALID [2022-02-20 23:47:11,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#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; {1798#true} is VALID [2022-02-20 23:47:11,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {1798#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; {1809#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:11,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {1809#(= (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 {1809#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:11,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {1809#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[append_~node~0#1.base]); {1799#false} is VALID [2022-02-20 23:47:11,080 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,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:11,080 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:11,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106791378] [2022-02-20 23:47:11,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106791378] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:11,080 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:11,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:11,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590780525] [2022-02-20 23:47:11,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:11,081 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:11,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:11,082 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:11,089 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:11,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:11,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:11,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:11,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:11,090 INFO L87 Difference]: Start difference. First operand 185 states and 198 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:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:11,818 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2022-02-20 23:47:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:11,819 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:11,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:11,819 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:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2022-02-20 23:47:11,822 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:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2022-02-20 23:47:11,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 218 transitions. [2022-02-20 23:47:12,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:12,070 INFO L225 Difference]: With dead ends: 208 [2022-02-20 23:47:12,070 INFO L226 Difference]: Without dead ends: 208 [2022-02-20 23:47:12,071 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:12,072 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 64 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 230 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:12,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 230 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:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-02-20 23:47:12,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 183. [2022-02-20 23:47:12,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:12,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:12,081 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:12,081 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:12,087 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2022-02-20 23:47:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2022-02-20 23:47:12,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:12,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:12,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 208 states. [2022-02-20 23:47:12,089 INFO L87 Difference]: Start difference. First operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 208 states. [2022-02-20 23:47:12,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:12,100 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2022-02-20 23:47:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2022-02-20 23:47:12,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:12,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:12,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:12,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2022-02-20 23:47:12,107 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 5 [2022-02-20 23:47:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:12,110 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2022-02-20 23:47:12,111 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:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-02-20 23:47:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:47:12,112 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:12,112 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:47:12,126 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:12,320 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:12,321 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:12,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash 149891463, now seen corresponding path program 1 times [2022-02-20 23:47:12,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:12,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482517012] [2022-02-20 23:47:12,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:12,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:12,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:12,336 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:12,336 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:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:12,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:12,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:12,434 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:12,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {2622#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); {2622#true} is VALID [2022-02-20 23:47:12,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {2622#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; {2622#true} is VALID [2022-02-20 23:47:12,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {2622#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; {2633#(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:12,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {2633#(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 {2633#(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:12,473 INFO L290 TraceCheckUtils]: 4: Hoare triple {2633#(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))); {2623#false} is VALID [2022-02-20 23:47:12,473 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:12,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:12,473 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:12,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482517012] [2022-02-20 23:47:12,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482517012] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:12,474 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:12,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:12,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255960249] [2022-02-20 23:47:12,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:12,475 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:12,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:12,475 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:12,483 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:12,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:12,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:12,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:12,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:12,485 INFO L87 Difference]: Start difference. First operand 183 states and 195 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:13,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:13,278 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2022-02-20 23:47:13,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:13,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:47:13,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:13,279 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:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 23:47:13,282 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:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 23:47:13,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2022-02-20 23:47:13,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:13,518 INFO L225 Difference]: With dead ends: 181 [2022-02-20 23:47:13,519 INFO L226 Difference]: Without dead ends: 181 [2022-02-20 23:47:13,519 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:13,520 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 271 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:13,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 271 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:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-20 23:47:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-02-20 23:47:13,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:13,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 181 states, 96 states have (on average 1.9583333333333333) 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,526 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 181 states, 96 states have (on average 1.9583333333333333) 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,526 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 181 states, 96 states have (on average 1.9583333333333333) 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,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:13,538 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2022-02-20 23:47:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2022-02-20 23:47:13,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:13,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:13,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 96 states have (on average 1.9583333333333333) 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 181 states. [2022-02-20 23:47:13,543 INFO L87 Difference]: Start difference. First operand has 181 states, 96 states have (on average 1.9583333333333333) 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 181 states. [2022-02-20 23:47:13,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:13,548 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2022-02-20 23:47:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2022-02-20 23:47:13,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:13,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:13,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:13,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 96 states have (on average 1.9583333333333333) 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,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2022-02-20 23:47:13,560 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 5 [2022-02-20 23:47:13,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:13,560 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2022-02-20 23:47:13,563 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:13,564 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2022-02-20 23:47:13,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:47:13,565 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:13,565 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:13,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:13,774 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:13,774 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:13,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:13,775 INFO L85 PathProgramCache]: Analyzing trace with hash 370034199, now seen corresponding path program 1 times [2022-02-20 23:47:13,775 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:13,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902953888] [2022-02-20 23:47:13,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:13,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:13,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:13,777 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:13,782 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:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:13,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:47:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:13,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:13,897 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,946 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:13,947 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:47:14,045 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:14,060 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:14,109 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:14,119 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:14,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {3363#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); {3363#true} is VALID [2022-02-20 23:47:14,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {3363#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; {3371#(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:14,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#(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; {3375#(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:14,153 INFO L290 TraceCheckUtils]: 3: Hoare triple {3375#(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 {3375#(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:14,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {3375#(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 {3382#(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:14,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {3382#(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; {3382#(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:14,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {3382#(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 {3389#(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:14,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {3389#(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; {3364#false} is VALID [2022-02-20 23:47:14,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {3364#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 {3364#false} is VALID [2022-02-20 23:47:14,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {3364#false} assume !(1bv1 == #valid[append_#t~mem28#1.base]); {3364#false} is VALID [2022-02-20 23:47:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:14,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:14,158 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:14,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902953888] [2022-02-20 23:47:14,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902953888] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:14,159 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:14,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:47:14,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695998000] [2022-02-20 23:47:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:14,160 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:14,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:14,160 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:14,174 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:14,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:14,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:14,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:14,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:14,175 INFO L87 Difference]: Start difference. First operand 181 states and 192 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:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:16,229 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-02-20 23:47:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:47:16,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:47:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:16,229 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:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2022-02-20 23:47:16,232 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:16,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2022-02-20 23:47:16,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 196 transitions. [2022-02-20 23:47:16,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:16,442 INFO L225 Difference]: With dead ends: 183 [2022-02-20 23:47:16,442 INFO L226 Difference]: Without dead ends: 183 [2022-02-20 23:47:16,442 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:16,443 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 4 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:16,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 743 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:47:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-02-20 23:47:16,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2022-02-20 23:47:16,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:16,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 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:16,450 INFO L74 IsIncluded]: Start isIncluded. First operand 183 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:16,450 INFO L87 Difference]: Start difference. First operand 183 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:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:16,455 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-02-20 23:47:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-02-20 23:47:16,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:16,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:16,457 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 183 states. [2022-02-20 23:47:16,458 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 183 states. [2022-02-20 23:47:16,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:16,463 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-02-20 23:47:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-02-20 23:47:16,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:16,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:16,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:16,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:16,465 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:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2022-02-20 23:47:16,469 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 10 [2022-02-20 23:47:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:16,470 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2022-02-20 23:47:16,470 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:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2022-02-20 23:47:16,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:47:16,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:16,471 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:16,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:16,682 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:16,682 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:16,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash -882700124, now seen corresponding path program 1 times [2022-02-20 23:47:16,683 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:16,683 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415287025] [2022-02-20 23:47:16,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:16,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:16,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:16,689 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:16,690 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:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:16,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:47:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:16,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:16,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {4133#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); {4133#true} is VALID [2022-02-20 23:47:16,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {4133#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; {4133#true} is VALID [2022-02-20 23:47:16,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {4133#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; {4133#true} is VALID [2022-02-20 23:47:16,816 INFO L290 TraceCheckUtils]: 3: Hoare triple {4133#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 {4133#true} is VALID [2022-02-20 23:47:16,817 INFO L290 TraceCheckUtils]: 4: Hoare triple {4133#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 {4133#true} is VALID [2022-02-20 23:47:16,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {4133#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {4133#true} is VALID [2022-02-20 23:47:16,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {4133#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 {4133#true} is VALID [2022-02-20 23:47:16,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {4133#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; {4133#true} is VALID [2022-02-20 23:47:16,818 INFO L272 TraceCheckUtils]: 8: Hoare triple {4133#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {4162#(and (= (_ bv0 32) |create_data_#in~prevData.offset|) (= |create_data_#in~prevData.base| (_ bv0 32)))} is VALID [2022-02-20 23:47:16,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {4162#(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; {4166#(not |create_data_#t~short4|)} is VALID [2022-02-20 23:47:16,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {4166#(not |create_data_#t~short4|)} assume #t~short4; {4134#false} is VALID [2022-02-20 23:47:16,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {4134#false} assume !(1bv1 == #valid[~prevData.base]); {4134#false} is VALID [2022-02-20 23:47:16,821 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,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:16,821 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:16,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415287025] [2022-02-20 23:47:16,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415287025] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:16,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:16,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:16,822 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769357263] [2022-02-20 23:47:16,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:16,822 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:16,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:16,823 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:16,836 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:16,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:16,836 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:16,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:16,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:16,838 INFO L87 Difference]: Start difference. First operand 182 states and 193 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:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:17,769 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2022-02-20 23:47:17,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:17,769 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:17,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:17,770 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:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 270 transitions. [2022-02-20 23:47:17,773 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:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 270 transitions. [2022-02-20 23:47:17,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 270 transitions. [2022-02-20 23:47:18,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:18,076 INFO L225 Difference]: With dead ends: 258 [2022-02-20 23:47:18,077 INFO L226 Difference]: Without dead ends: 258 [2022-02-20 23:47:18,077 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:18,078 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 79 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 545 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:18,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 545 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:18,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-02-20 23:47:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222. [2022-02-20 23:47:18,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:18,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 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:18,085 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 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:18,086 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 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:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:18,093 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2022-02-20 23:47:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 273 transitions. [2022-02-20 23:47:18,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:18,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:18,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 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 258 states. [2022-02-20 23:47:18,095 INFO L87 Difference]: Start difference. First operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 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 258 states. [2022-02-20 23:47:18,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:18,102 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2022-02-20 23:47:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 273 transitions. [2022-02-20 23:47:18,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:18,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:18,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:18,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 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:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2022-02-20 23:47:18,110 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 12 [2022-02-20 23:47:18,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:18,111 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2022-02-20 23:47:18,111 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:18,111 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2022-02-20 23:47:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:47:18,111 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:18,111 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:18,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 23:47:18,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:18,320 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr4REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:18,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:18,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893879, now seen corresponding path program 1 times [2022-02-20 23:47:18,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:18,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061992964] [2022-02-20 23:47:18,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:18,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:18,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:18,322 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:18,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:47:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:18,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:47:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:18,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:18,445 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:47:18,446 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:18,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {5170#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); {5170#true} is VALID [2022-02-20 23:47:18,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {5170#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; {5170#true} is VALID [2022-02-20 23:47:18,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {5170#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; {5170#true} is VALID [2022-02-20 23:47:18,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {5170#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 {5170#true} is VALID [2022-02-20 23:47:18,467 INFO L290 TraceCheckUtils]: 4: Hoare triple {5170#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 {5170#true} is VALID [2022-02-20 23:47:18,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {5170#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {5170#true} is VALID [2022-02-20 23:47:18,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {5170#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 {5170#true} is VALID [2022-02-20 23:47:18,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {5170#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; {5170#true} is VALID [2022-02-20 23:47:18,468 INFO L272 TraceCheckUtils]: 8: Hoare triple {5170#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {5170#true} is VALID [2022-02-20 23:47:18,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {5170#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {5170#true} is VALID [2022-02-20 23:47:18,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {5170#true} assume !#t~short4; {5170#true} is VALID [2022-02-20 23:47:18,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {5170#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); {5208#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| create_data_~data~0.base))) (_ bv1 1)))} is VALID [2022-02-20 23:47:18,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {5208#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| create_data_~data~0.base))) (_ bv1 1)))} assume !(1bv1 == #valid[~data~0.base]); {5171#false} is VALID [2022-02-20 23:47:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:18,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:18,479 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:18,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061992964] [2022-02-20 23:47:18,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061992964] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:18,480 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:18,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:18,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011390875] [2022-02-20 23:47:18,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:18,481 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:18,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:18,481 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:18,497 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:18,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:18,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:18,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:18,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:18,499 INFO L87 Difference]: Start difference. First operand 222 states and 273 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:19,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,267 INFO L93 Difference]: Finished difference Result 211 states and 249 transitions. [2022-02-20 23:47:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:19,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:47:19,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:19,268 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:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 23:47:19,269 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:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 23:47:19,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2022-02-20 23:47:19,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:19,454 INFO L225 Difference]: With dead ends: 211 [2022-02-20 23:47:19,454 INFO L226 Difference]: Without dead ends: 211 [2022-02-20 23:47:19,454 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:19,457 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 62 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:19,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 198 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-02-20 23:47:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-02-20 23:47:19,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:19,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand has 209 states, 136 states have (on average 1.786764705882353) internal successors, (243), 204 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:19,464 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand has 209 states, 136 states have (on average 1.786764705882353) internal successors, (243), 204 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:19,464 INFO L87 Difference]: Start difference. First operand 211 states. Second operand has 209 states, 136 states have (on average 1.786764705882353) internal successors, (243), 204 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:19,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,469 INFO L93 Difference]: Finished difference Result 211 states and 249 transitions. [2022-02-20 23:47:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 249 transitions. [2022-02-20 23:47:19,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:19,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:19,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 209 states, 136 states have (on average 1.786764705882353) internal successors, (243), 204 states have internal predecessors, (243), 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 211 states. [2022-02-20 23:47:19,471 INFO L87 Difference]: Start difference. First operand has 209 states, 136 states have (on average 1.786764705882353) internal successors, (243), 204 states have internal predecessors, (243), 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 211 states. [2022-02-20 23:47:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,475 INFO L93 Difference]: Finished difference Result 211 states and 249 transitions. [2022-02-20 23:47:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 249 transitions. [2022-02-20 23:47:19,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:19,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:19,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:19,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 136 states have (on average 1.786764705882353) internal successors, (243), 204 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 247 transitions. [2022-02-20 23:47:19,480 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 247 transitions. Word has length 13 [2022-02-20 23:47:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:19,481 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 247 transitions. [2022-02-20 23:47:19,481 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:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 247 transitions. [2022-02-20 23:47:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:47:19,481 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:19,482 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:19,493 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:19,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:19,691 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr5REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:19,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:19,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893878, now seen corresponding path program 1 times [2022-02-20 23:47:19,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:19,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422286763] [2022-02-20 23:47:19,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:19,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:19,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:19,693 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:19,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:47:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:19,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:47:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:19,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:19,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:19,844 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:19,859 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:19,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {6053#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); {6053#true} is VALID [2022-02-20 23:47:19,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {6053#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; {6053#true} is VALID [2022-02-20 23:47:19,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {6053#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; {6053#true} is VALID [2022-02-20 23:47:19,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {6053#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 {6053#true} is VALID [2022-02-20 23:47:19,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {6053#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 {6053#true} is VALID [2022-02-20 23:47:19,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {6053#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {6053#true} is VALID [2022-02-20 23:47:19,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {6053#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 {6053#true} is VALID [2022-02-20 23:47:19,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {6053#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; {6053#true} is VALID [2022-02-20 23:47:19,874 INFO L272 TraceCheckUtils]: 8: Hoare triple {6053#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {6053#true} is VALID [2022-02-20 23:47:19,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {6053#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {6053#true} is VALID [2022-02-20 23:47:19,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {6053#true} assume !#t~short4; {6053#true} is VALID [2022-02-20 23:47:19,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {6053#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); {6091#(and (= (_ bv16 32) (select |#length| create_data_~data~0.base)) (= create_data_~data~0.offset (_ bv0 32)))} is VALID [2022-02-20 23:47:19,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {6091#(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))); {6054#false} is VALID [2022-02-20 23:47:19,877 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,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:19,878 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:19,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422286763] [2022-02-20 23:47:19,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422286763] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:19,878 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:19,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:19,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685252737] [2022-02-20 23:47:19,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:19,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:47:19,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:19,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:19,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:19,896 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:19,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:19,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:19,897 INFO L87 Difference]: Start difference. First operand 209 states and 247 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:20,492 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2022-02-20 23:47:20,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:20,492 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,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2022-02-20 23:47:20,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2022-02-20 23:47:20,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2022-02-20 23:47:20,733 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:20,736 INFO L225 Difference]: With dead ends: 198 [2022-02-20 23:47:20,736 INFO L226 Difference]: Without dead ends: 198 [2022-02-20 23:47:20,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:20,737 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 49 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:20,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 200 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-02-20 23:47:20,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2022-02-20 23:47:20,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:20,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 196 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 191 states have internal predecessors, (217), 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,741 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 196 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 191 states have internal predecessors, (217), 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,742 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 196 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 191 states have internal predecessors, (217), 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,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:20,746 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2022-02-20 23:47:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2022-02-20 23:47:20,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:20,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:20,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 191 states have internal predecessors, (217), 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 198 states. [2022-02-20 23:47:20,748 INFO L87 Difference]: Start difference. First operand has 196 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 191 states have internal predecessors, (217), 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 198 states. [2022-02-20 23:47:20,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:20,752 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2022-02-20 23:47:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2022-02-20 23:47:20,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:20,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:20,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:20,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 191 states have internal predecessors, (217), 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,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 221 transitions. [2022-02-20 23:47:20,757 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 221 transitions. Word has length 13 [2022-02-20 23:47:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:20,758 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 221 transitions. [2022-02-20 23:47:20,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2022-02-20 23:47:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:20,758 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:20,759 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:20,774 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:20,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:20,968 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:20,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744652, now seen corresponding path program 1 times [2022-02-20 23:47:20,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:20,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117921230] [2022-02-20 23:47:20,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:20,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:20,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:20,970 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:20,976 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,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:21,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:47:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:21,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:21,086 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:47:21,087 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:21,129 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:21,167 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:21,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {6884#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); {6884#true} is VALID [2022-02-20 23:47:21,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {6884#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; {6884#true} is VALID [2022-02-20 23:47:21,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {6884#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; {6884#true} is VALID [2022-02-20 23:47:21,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {6884#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 {6884#true} is VALID [2022-02-20 23:47:21,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {6884#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 {6884#true} is VALID [2022-02-20 23:47:21,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {6884#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {6884#true} is VALID [2022-02-20 23:47:21,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {6884#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 {6884#true} is VALID [2022-02-20 23:47:21,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {6884#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; {6884#true} is VALID [2022-02-20 23:47:21,177 INFO L272 TraceCheckUtils]: 8: Hoare triple {6884#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {6884#true} is VALID [2022-02-20 23:47:21,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {6884#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {6884#true} is VALID [2022-02-20 23:47:21,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {6884#true} assume !#t~short4; {6884#true} is VALID [2022-02-20 23:47:21,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {6884#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); {6922#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |create_data_#t~malloc7.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:47:21,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {6922#(= (_ 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 {6926#(= (_ 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:21,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {6926#(= (_ 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; {6926#(= (_ 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:21,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {6926#(= (_ 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, 20bv32); {6926#(= (_ 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:21,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {6926#(= (_ 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 {6936#(= (bvadd (bvneg (select |#valid| |create_data_#t~mem9.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:47:21,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {6936#(= (bvadd (bvneg (select |#valid| |create_data_#t~mem9.base|)) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[#t~mem9.base]); {6885#false} is VALID [2022-02-20 23:47:21,184 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:21,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:21,184 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:21,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117921230] [2022-02-20 23:47:21,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117921230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:21,184 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:21,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:21,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797357048] [2022-02-20 23:47:21,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:21,184 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:21,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:21,185 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:21,204 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:21,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:21,204 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:21,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:21,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:21,205 INFO L87 Difference]: Start difference. First operand 196 states and 221 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:22,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:22,932 INFO L93 Difference]: Finished difference Result 247 states and 285 transitions. [2022-02-20 23:47:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:22,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:47:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:22,933 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:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 195 transitions. [2022-02-20 23:47:22,934 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:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 195 transitions. [2022-02-20 23:47:22,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 195 transitions. [2022-02-20 23:47:23,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:23,154 INFO L225 Difference]: With dead ends: 247 [2022-02-20 23:47:23,154 INFO L226 Difference]: Without dead ends: 247 [2022-02-20 23:47:23,154 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:23,155 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 25 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:23,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 397 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:47:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-02-20 23:47:23,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 202. [2022-02-20 23:47:23,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:23,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 202 states, 142 states have (on average 1.5985915492957747) internal successors, (227), 197 states have internal predecessors, (227), 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:23,160 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 202 states, 142 states have (on average 1.5985915492957747) internal successors, (227), 197 states have internal predecessors, (227), 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:23,161 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 202 states, 142 states have (on average 1.5985915492957747) internal successors, (227), 197 states have internal predecessors, (227), 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:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:23,166 INFO L93 Difference]: Finished difference Result 247 states and 285 transitions. [2022-02-20 23:47:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 285 transitions. [2022-02-20 23:47:23,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:23,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:23,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 142 states have (on average 1.5985915492957747) internal successors, (227), 197 states have internal predecessors, (227), 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 247 states. [2022-02-20 23:47:23,167 INFO L87 Difference]: Start difference. First operand has 202 states, 142 states have (on average 1.5985915492957747) internal successors, (227), 197 states have internal predecessors, (227), 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 247 states. [2022-02-20 23:47:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:23,172 INFO L93 Difference]: Finished difference Result 247 states and 285 transitions. [2022-02-20 23:47:23,172 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 285 transitions. [2022-02-20 23:47:23,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:23,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:23,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:23,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.5985915492957747) internal successors, (227), 197 states have internal predecessors, (227), 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:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 231 transitions. [2022-02-20 23:47:23,177 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 231 transitions. Word has length 17 [2022-02-20 23:47:23,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:23,177 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 231 transitions. [2022-02-20 23:47:23,178 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:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 231 transitions. [2022-02-20 23:47:23,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:23,178 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:23,178 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:23,191 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,387 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,387 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:23,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:23,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744651, now seen corresponding path program 1 times [2022-02-20 23:47:23,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:23,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158635642] [2022-02-20 23:47:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:23,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:23,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:23,390 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,392 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,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:23,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:47:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:23,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:23,529 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:47:23,530 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:23,573 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,582 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,674 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:23,679 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:23,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {7886#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); {7886#true} is VALID [2022-02-20 23:47:23,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {7886#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; {7886#true} is VALID [2022-02-20 23:47:23,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {7886#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; {7886#true} is VALID [2022-02-20 23:47:23,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {7886#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 {7886#true} is VALID [2022-02-20 23:47:23,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {7886#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 {7886#true} is VALID [2022-02-20 23:47:23,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {7886#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {7886#true} is VALID [2022-02-20 23:47:23,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {7886#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 {7886#true} is VALID [2022-02-20 23:47:23,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {7886#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; {7886#true} is VALID [2022-02-20 23:47:23,700 INFO L272 TraceCheckUtils]: 8: Hoare triple {7886#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {7886#true} is VALID [2022-02-20 23:47:23,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {7886#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {7886#true} is VALID [2022-02-20 23:47:23,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {7886#true} assume !#t~short4; {7886#true} is VALID [2022-02-20 23:47:23,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {7886#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); {7924#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)))} is VALID [2022-02-20 23:47:23,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {7924#(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 {7928#(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:23,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {7928#(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; {7932#(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:23,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {7932#(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, 20bv32); {7932#(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:23,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {7932#(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 {7939#(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:23,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {7939#(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)))); {7887#false} is VALID [2022-02-20 23:47:23,708 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,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:23,708 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:23,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158635642] [2022-02-20 23:47:23,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158635642] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:23,708 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:23,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:47:23,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971485019] [2022-02-20 23:47:23,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:23,709 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:23,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:23,709 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:23,735 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,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:23,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:23,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:23,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:23,736 INFO L87 Difference]: Start difference. First operand 202 states and 231 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:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:25,550 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2022-02-20 23:47:25,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:25,550 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,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:25,550 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:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2022-02-20 23:47:25,551 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:25,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2022-02-20 23:47:25,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 167 transitions. [2022-02-20 23:47:25,716 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:47:25,718 INFO L225 Difference]: With dead ends: 204 [2022-02-20 23:47:25,719 INFO L226 Difference]: Without dead ends: 204 [2022-02-20 23:47:25,719 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:25,720 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 5 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:25,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 414 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:47:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-02-20 23:47:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2022-02-20 23:47:25,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:25,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand has 202 states, 142 states have (on average 1.5704225352112675) internal successors, (223), 197 states have internal predecessors, (223), 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,728 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand has 202 states, 142 states have (on average 1.5704225352112675) internal successors, (223), 197 states have internal predecessors, (223), 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,729 INFO L87 Difference]: Start difference. First operand 204 states. Second operand has 202 states, 142 states have (on average 1.5704225352112675) internal successors, (223), 197 states have internal predecessors, (223), 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,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:25,733 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2022-02-20 23:47:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 229 transitions. [2022-02-20 23:47:25,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:25,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:25,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 142 states have (on average 1.5704225352112675) internal successors, (223), 197 states have internal predecessors, (223), 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 204 states. [2022-02-20 23:47:25,735 INFO L87 Difference]: Start difference. First operand has 202 states, 142 states have (on average 1.5704225352112675) internal successors, (223), 197 states have internal predecessors, (223), 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 204 states. [2022-02-20 23:47:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:25,738 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2022-02-20 23:47:25,738 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 229 transitions. [2022-02-20 23:47:25,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:25,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:25,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:25,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.5704225352112675) internal successors, (223), 197 states have internal predecessors, (223), 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,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 227 transitions. [2022-02-20 23:47:25,743 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 227 transitions. Word has length 17 [2022-02-20 23:47:25,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:25,744 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 227 transitions. [2022-02-20 23:47:25,744 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:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 227 transitions. [2022-02-20 23:47:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:47:25,744 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:25,745 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:25,756 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,953 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,954 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:25,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:25,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184013, now seen corresponding path program 1 times [2022-02-20 23:47:25,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:25,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694191183] [2022-02-20 23:47:25,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:25,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:25,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:25,957 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,959 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:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:26,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:47:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:26,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:26,156 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:47:26,157 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:26,208 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:26,339 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:26,340 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:26,433 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:26,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {8760#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); {8760#true} is VALID [2022-02-20 23:47:26,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {8760#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; {8760#true} is VALID [2022-02-20 23:47:26,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {8760#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; {8760#true} is VALID [2022-02-20 23:47:26,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {8760#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 {8760#true} is VALID [2022-02-20 23:47:26,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {8760#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 {8760#true} is VALID [2022-02-20 23:47:26,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {8760#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {8760#true} is VALID [2022-02-20 23:47:26,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {8760#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 {8760#true} is VALID [2022-02-20 23:47:26,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {8760#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; {8760#true} is VALID [2022-02-20 23:47:26,478 INFO L272 TraceCheckUtils]: 8: Hoare triple {8760#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {8760#true} is VALID [2022-02-20 23:47:26,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {8760#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {8760#true} is VALID [2022-02-20 23:47:26,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {8760#true} assume !#t~short4; {8760#true} is VALID [2022-02-20 23:47:26,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {8760#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); {8798#(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:26,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {8798#(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 {8802#(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:26,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {8802#(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; {8802#(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:26,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {8802#(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, 20bv32); {8802#(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:26,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {8802#(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 {8812#(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:26,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {8812#(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 {8802#(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:26,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {8802#(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; {8802#(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:26,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {8802#(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; {8802#(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:26,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {8802#(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, 20bv32); {8802#(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:26,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {8802#(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 {8828#(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:26,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {8828#(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]); {8761#false} is VALID [2022-02-20 23:47:26,505 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:26,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:26,629 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (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_176) c_create_data_~data~0.base) .cse0))) (_ bv1 1))) is different from false [2022-02-20 23:47:26,659 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:26,659 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:26,666 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:26,674 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:26,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {8832#(= (select |#valid| |create_data_#t~mem9.base|) (_ bv1 1))} assume !(1bv1 == #valid[#t~mem9.base]); {8761#false} is VALID [2022-02-20 23:47:26,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {8836#(= (_ 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 {8832#(= (select |#valid| |create_data_#t~mem9.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:26,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {8836#(= (_ 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, 20bv32); {8836#(= (_ 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:26,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {8836#(= (_ 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; {8836#(= (_ 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:26,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {8836#(= (_ 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; {8836#(= (_ 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:26,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {8849#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_176) 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 {8836#(= (_ 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:26,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {8853#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (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_176) 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 {8849#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_176) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:26,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {8853#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (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_176) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} assume !!~bvslt32(~counter~0, 20bv32); {8853#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (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_176) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is VALID [2022-02-20 23:47:26,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {8853#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (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_176) 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; {8853#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (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_176) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is VALID [2022-02-20 23:47:26,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {8863#(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 {8853#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (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_176) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is VALID [2022-02-20 23:47:26,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {8760#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); {8863#(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:26,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {8760#true} assume !#t~short4; {8760#true} is VALID [2022-02-20 23:47:26,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {8760#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {8760#true} is VALID [2022-02-20 23:47:26,754 INFO L272 TraceCheckUtils]: 8: Hoare triple {8760#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {8760#true} is VALID [2022-02-20 23:47:26,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {8760#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; {8760#true} is VALID [2022-02-20 23:47:26,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {8760#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 {8760#true} is VALID [2022-02-20 23:47:26,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {8760#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {8760#true} is VALID [2022-02-20 23:47:26,755 INFO L290 TraceCheckUtils]: 4: Hoare triple {8760#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 {8760#true} is VALID [2022-02-20 23:47:26,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {8760#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 {8760#true} is VALID [2022-02-20 23:47:26,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {8760#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; {8760#true} is VALID [2022-02-20 23:47:26,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {8760#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; {8760#true} is VALID [2022-02-20 23:47:26,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {8760#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); {8760#true} is VALID [2022-02-20 23:47:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-20 23:47:26,755 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:26,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694191183] [2022-02-20 23:47:26,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694191183] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:26,756 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:26,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-02-20 23:47:26,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652660957] [2022-02-20 23:47:26,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:26,756 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:26,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:26,757 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:26,816 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:26,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:47:26,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:26,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:47:26,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=64, Unknown=3, NotChecked=16, Total=110 [2022-02-20 23:47:26,817 INFO L87 Difference]: Start difference. First operand 202 states and 227 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,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:29,564 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2022-02-20 23:47:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:47:29,564 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,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:29,564 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,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2022-02-20 23:47:29,567 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,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2022-02-20 23:47:29,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 165 transitions. [2022-02-20 23:47:29,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:29,788 INFO L225 Difference]: With dead ends: 207 [2022-02-20 23:47:29,788 INFO L226 Difference]: Without dead ends: 207 [2022-02-20 23:47:29,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=78, Unknown=3, NotChecked=18, Total=132 [2022-02-20 23:47:29,789 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 25 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:29,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 755 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 369 Invalid, 0 Unknown, 245 Unchecked, 0.8s Time] [2022-02-20 23:47:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-02-20 23:47:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 201. [2022-02-20 23:47:29,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:29,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 201 states, 142 states have (on average 1.556338028169014) internal successors, (221), 196 states have internal predecessors, (221), 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:29,794 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 201 states, 142 states have (on average 1.556338028169014) internal successors, (221), 196 states have internal predecessors, (221), 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:29,794 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 201 states, 142 states have (on average 1.556338028169014) internal successors, (221), 196 states have internal predecessors, (221), 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:29,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:29,798 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2022-02-20 23:47:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 231 transitions. [2022-02-20 23:47:29,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:29,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:29,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 142 states have (on average 1.556338028169014) internal successors, (221), 196 states have internal predecessors, (221), 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 207 states. [2022-02-20 23:47:29,799 INFO L87 Difference]: Start difference. First operand has 201 states, 142 states have (on average 1.556338028169014) internal successors, (221), 196 states have internal predecessors, (221), 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 207 states. [2022-02-20 23:47:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:29,803 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2022-02-20 23:47:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 231 transitions. [2022-02-20 23:47:29,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:29,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:29,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:29,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 142 states have (on average 1.556338028169014) internal successors, (221), 196 states have internal predecessors, (221), 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:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 225 transitions. [2022-02-20 23:47:29,807 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 225 transitions. Word has length 22 [2022-02-20 23:47:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:29,808 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 225 transitions. [2022-02-20 23:47:29,808 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:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 225 transitions. [2022-02-20 23:47:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:47:29,809 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:29,809 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:29,819 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:30,018 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:30,019 INFO L402 AbstractCegarLoop]: === Iteration 12 === 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,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:30,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184014, now seen corresponding path program 1 times [2022-02-20 23:47:30,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:30,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345063829] [2022-02-20 23:47:30,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:30,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:30,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:30,021 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:30,021 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:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:30,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:47:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:30,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:30,207 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,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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,263 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,272 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,421 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:30,422 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,427 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,543 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,556 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,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {9724#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); {9724#true} is VALID [2022-02-20 23:47:30,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {9724#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; {9724#true} is VALID [2022-02-20 23:47:30,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {9724#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; {9724#true} is VALID [2022-02-20 23:47:30,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {9724#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 {9724#true} is VALID [2022-02-20 23:47:30,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {9724#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 {9724#true} is VALID [2022-02-20 23:47:30,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {9724#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {9724#true} is VALID [2022-02-20 23:47:30,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {9724#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 {9724#true} is VALID [2022-02-20 23:47:30,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {9724#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; {9724#true} is VALID [2022-02-20 23:47:30,594 INFO L272 TraceCheckUtils]: 8: Hoare triple {9724#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {9724#true} is VALID [2022-02-20 23:47:30,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {9724#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {9724#true} is VALID [2022-02-20 23:47:30,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {9724#true} assume !#t~short4; {9724#true} is VALID [2022-02-20 23:47:30,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {9724#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); {9762#(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,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {9762#(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 {9766#(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,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {9766#(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; {9770#(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,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {9770#(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, 20bv32); {9770#(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,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {9770#(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 {9777#(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,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {9777#(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 {9770#(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,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {9770#(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; {9770#(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,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {9770#(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; {9787#(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,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {9787#(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, 20bv32); {9787#(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,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {9787#(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 {9794#(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,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {9794#(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)))); {9725#false} is VALID [2022-02-20 23:47:30,605 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,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:31,043 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset)))) (bvule (bvadd (_ bv4 32) .cse1 .cse2) (bvadd (_ bv8 32) .cse1 .cse2))))) is different from false [2022-02-20 23:47:31,090 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_222) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_222) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_221) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-02-20 23:47:31,164 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1) v_ArrVal_222) c_create_data_~data~0.base) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_222) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_221) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-02-20 23:47:31,188 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:31,188 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,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:31,195 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,221 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,337 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,345 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,349 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,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:31,461 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,487 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,493 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,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {9798#(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)))); {9725#false} is VALID [2022-02-20 23:47:31,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {9802#(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 {9798#(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,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {9802#(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, 20bv32); {9802#(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,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {9809#(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; {9802#(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,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {9809#(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; {9809#(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,218 WARN L290 TraceCheckUtils]: 16: Hoare triple {9816#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_221) 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 {9809#(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,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {9820#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_221) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {9816#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_221) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:32,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {9820#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_221) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} assume !!~bvslt32(~counter~0, 20bv32); {9820#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_221) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} is VALID [2022-02-20 23:47:32,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {9827#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_221) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {9820#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_221) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} is VALID [2022-02-20 23:47:32,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {9831#(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 {9827#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_221) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:32,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {9724#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); {9831#(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,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {9724#true} assume !#t~short4; {9724#true} is VALID [2022-02-20 23:47:32,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {9724#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {9724#true} is VALID [2022-02-20 23:47:32,251 INFO L272 TraceCheckUtils]: 8: Hoare triple {9724#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {9724#true} is VALID [2022-02-20 23:47:32,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {9724#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; {9724#true} is VALID [2022-02-20 23:47:32,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {9724#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 {9724#true} is VALID [2022-02-20 23:47:32,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {9724#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {9724#true} is VALID [2022-02-20 23:47:32,251 INFO L290 TraceCheckUtils]: 4: Hoare triple {9724#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 {9724#true} is VALID [2022-02-20 23:47:32,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {9724#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 {9724#true} is VALID [2022-02-20 23:47:32,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {9724#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; {9724#true} is VALID [2022-02-20 23:47:32,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {9724#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; {9724#true} is VALID [2022-02-20 23:47:32,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {9724#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); {9724#true} is VALID [2022-02-20 23:47:32,251 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,252 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:32,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345063829] [2022-02-20 23:47:32,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345063829] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:32,252 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:32,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-02-20 23:47:32,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175424265] [2022-02-20 23:47:32,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:32,253 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,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:32,253 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,819 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,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:47:32,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:32,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:47:32,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2022-02-20 23:47:32,820 INFO L87 Difference]: Start difference. First operand 201 states and 225 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,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:40,806 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions. [2022-02-20 23:47:40,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:47:40,806 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,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:40,807 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,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2022-02-20 23:47:40,808 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,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2022-02-20 23:47:40,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 171 transitions. [2022-02-20 23:47:41,044 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:47:41,047 INFO L225 Difference]: With dead ends: 213 [2022-02-20 23:47:41,047 INFO L226 Difference]: Without dead ends: 213 [2022-02-20 23:47:41,048 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,048 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 15 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 329 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:41,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 996 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 476 Invalid, 0 Unknown, 329 Unchecked, 2.3s Time] [2022-02-20 23:47:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-02-20 23:47:41,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2022-02-20 23:47:41,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:41,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 211 states, 152 states have (on average 1.519736842105263) internal successors, (231), 206 states have internal predecessors, (231), 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,052 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 211 states, 152 states have (on average 1.519736842105263) internal successors, (231), 206 states have internal predecessors, (231), 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,053 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 211 states, 152 states have (on average 1.519736842105263) internal successors, (231), 206 states have internal predecessors, (231), 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,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:41,061 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions. [2022-02-20 23:47:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 237 transitions. [2022-02-20 23:47:41,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:41,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:41,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 152 states have (on average 1.519736842105263) internal successors, (231), 206 states have internal predecessors, (231), 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 213 states. [2022-02-20 23:47:41,062 INFO L87 Difference]: Start difference. First operand has 211 states, 152 states have (on average 1.519736842105263) internal successors, (231), 206 states have internal predecessors, (231), 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 213 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 213 states and 237 transitions. [2022-02-20 23:47:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 237 transitions. [2022-02-20 23:47:41,067 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 211 states, 152 states have (on average 1.519736842105263) internal successors, (231), 206 states have internal predecessors, (231), 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,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 235 transitions. [2022-02-20 23:47:41,071 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 235 transitions. Word has length 22 [2022-02-20 23:47:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:41,071 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 235 transitions. [2022-02-20 23:47:41,072 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,072 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 235 transitions. [2022-02-20 23:47:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:47:41,072 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:41,072 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,085 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:41,283 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:41,283 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:41,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:41,284 INFO L85 PathProgramCache]: Analyzing trace with hash 200627285, now seen corresponding path program 2 times [2022-02-20 23:47:41,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:41,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800953687] [2022-02-20 23:47:41,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:47:41,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:41,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:41,286 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:41,288 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:41,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:47:41,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:47:41,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 23:47:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:41,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:41,539 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:47:41,540 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,552 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,601 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,612 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,793 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:41,793 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,801 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:42,008 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:42,008 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:42,015 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:42,161 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:42,173 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:42,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {10725#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); {10725#true} is VALID [2022-02-20 23:47:42,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {10725#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; {10725#true} is VALID [2022-02-20 23:47:42,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {10725#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; {10725#true} is VALID [2022-02-20 23:47:42,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {10725#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 {10725#true} is VALID [2022-02-20 23:47:42,207 INFO L290 TraceCheckUtils]: 4: Hoare triple {10725#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 {10725#true} is VALID [2022-02-20 23:47:42,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {10725#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {10725#true} is VALID [2022-02-20 23:47:42,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {10725#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 {10725#true} is VALID [2022-02-20 23:47:42,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {10725#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; {10725#true} is VALID [2022-02-20 23:47:42,207 INFO L272 TraceCheckUtils]: 8: Hoare triple {10725#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {10725#true} is VALID [2022-02-20 23:47:42,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {10725#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {10725#true} is VALID [2022-02-20 23:47:42,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {10725#true} assume !#t~short4; {10725#true} is VALID [2022-02-20 23:47:42,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {10725#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); {10763#(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:42,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {10763#(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 {10767#(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:42,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {10767#(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; {10771#(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,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {10771#(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, 20bv32); {10771#(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,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {10771#(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 {10778#(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,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {10778#(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 {10771#(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,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {10771#(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; {10771#(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,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {10771#(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; {10788#(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,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {10788#(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, 20bv32); {10788#(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,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {10788#(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 {10795#(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,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {10795#(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 {10788#(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,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {10788#(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; {10788#(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,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {10788#(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; {10805#(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,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {10805#(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, 20bv32); {10805#(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,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {10805#(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 {10812#(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,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {10812#(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)))); {10726#false} is VALID [2022-02-20 23:47:42,235 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,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:42,644 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_284) 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 (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse2) (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_285) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-02-20 23:47:42,695 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_284) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_284) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_285) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-02-20 23:47:42,768 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)))) (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 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_285) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_284 (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_284) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2022-02-20 23:47:42,853 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_282 (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_283)) (.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_282) .cse0 v_ArrVal_284) 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_285) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283) c_create_data_~data~0.base) .cse5) v_ArrVal_284) 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,900 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3) v_ArrVal_284)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_283))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_282) .cse5 v_ArrVal_284) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_285) c_create_data_~data~0.base) .cse6))))))))) is different from false [2022-02-20 23:47:42,966 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_283) c_create_data_~data~0.base) .cse2) v_ArrVal_284)) 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_282 (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_283))) (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_282) .cse4 v_ArrVal_284) c_create_data_~data~0.base) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_285) c_create_data_~data~0.base) .cse5))))))))) is different from false [2022-02-20 23:47:42,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:42,991 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:43,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:43,004 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:43,033 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:43,111 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:43,124 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:43,134 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 86 treesize of output 78 [2022-02-20 23:47:43,142 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 116 treesize of output 92 [2022-02-20 23:47:43,209 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:43,209 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:43,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:43,224 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:43,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:43,259 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,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:43,279 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,286 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,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {10816#(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)))); {10726#false} is VALID [2022-02-20 23:47:43,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {10820#(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 {10816#(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,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {10820#(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, 20bv32); {10820#(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,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {10827#(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; {10820#(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,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {10827#(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; {10827#(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,836 WARN L290 TraceCheckUtils]: 21: Hoare triple {10834#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_284) 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_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_284) 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_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 {10827#(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,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {10838#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (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_284) 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_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (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_284) 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_284) 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 {10834#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_284) 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_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_284) 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_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:43,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {10838#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (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_284) 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_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (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_284) 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_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} assume !!~bvslt32(~counter~0, 20bv32); {10838#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (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_284) 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_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (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_284) 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_284) 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,868 WARN L290 TraceCheckUtils]: 18: Hoare triple {10845#(and (forall ((v_ArrVal_284 (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_284) 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_284) 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)))) (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_284) 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_285) 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; {10838#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (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_284) 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_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (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_284) 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_284) 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,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {10845#(and (forall ((v_ArrVal_284 (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_284) 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_284) 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)))) (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_284) 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_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {10845#(and (forall ((v_ArrVal_284 (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_284) 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_284) 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)))) (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_284) 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_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:44,330 WARN L290 TraceCheckUtils]: 16: Hoare triple {10852#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) 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))) (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_283) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) 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)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) 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))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) 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))) (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 {10845#(and (forall ((v_ArrVal_284 (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_284) 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_284) 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)))) (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_284) 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_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is UNKNOWN [2022-02-20 23:47:44,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {10856#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (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_283) 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))) (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_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_283) 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)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (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_283) 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))) (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_282) (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_283) 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))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {10852#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) 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))) (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_283) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) 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)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) 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))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) 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))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} is VALID [2022-02-20 23:47:44,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {10856#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (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_283) 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))) (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_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_283) 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)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (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_283) 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))) (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_282) (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_283) 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))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} assume !!~bvslt32(~counter~0, 20bv32); {10856#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (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_283) 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))) (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_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_283) 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)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (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_283) 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))) (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_282) (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_283) 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))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} is VALID [2022-02-20 23:47:44,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {10863#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (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_283) 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))) (_ 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_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_283) 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)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (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_283) 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)))) (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_282) (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_283) 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))) (_ bv12 32)))))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {10856#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (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_283) 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))) (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_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_283) 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)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (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_283) 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))) (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_282) (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_283) 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))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} is VALID [2022-02-20 23:47:44,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {10867#(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 {10863#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (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_283) 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))) (_ 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_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_283) 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)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (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_282) (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_283) 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)))) (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_282) (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_283) 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))) (_ bv12 32)))))} is VALID [2022-02-20 23:47:44,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {10725#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); {10867#(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,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {10725#true} assume !#t~short4; {10725#true} is VALID [2022-02-20 23:47:44,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {10725#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {10725#true} is VALID [2022-02-20 23:47:44,376 INFO L272 TraceCheckUtils]: 8: Hoare triple {10725#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {10725#true} is VALID [2022-02-20 23:47:44,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {10725#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; {10725#true} is VALID [2022-02-20 23:47:44,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {10725#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 {10725#true} is VALID [2022-02-20 23:47:44,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {10725#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {10725#true} is VALID [2022-02-20 23:47:44,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {10725#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 {10725#true} is VALID [2022-02-20 23:47:44,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {10725#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 {10725#true} is VALID [2022-02-20 23:47:44,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {10725#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; {10725#true} is VALID [2022-02-20 23:47:44,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {10725#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; {10725#true} is VALID [2022-02-20 23:47:44,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {10725#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); {10725#true} is VALID [2022-02-20 23:47:44,377 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,377 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:44,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800953687] [2022-02-20 23:47:44,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800953687] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:44,377 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:44,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2022-02-20 23:47:44,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355905882] [2022-02-20 23:47:44,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:44,378 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,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:44,378 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:46,984 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:46,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 23:47:46,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:46,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 23:47:46,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2022-02-20 23:47:46,985 INFO L87 Difference]: Start difference. First operand 211 states and 235 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:00,948 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2022-02-20 23:48:00,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:48:00,948 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:48:00,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 176 transitions. [2022-02-20 23:48:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 176 transitions. [2022-02-20 23:48:00,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 176 transitions. [2022-02-20 23:48:01,170 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:48:01,173 INFO L225 Difference]: With dead ends: 223 [2022-02-20 23:48:01,173 INFO L226 Difference]: Without dead ends: 223 [2022-02-20 23:48:01,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=239, Unknown=6, NotChecked=222, Total=552 [2022-02-20 23:48:01,173 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 19 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 514 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:01,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 1322 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 668 Invalid, 0 Unknown, 514 Unchecked, 3.6s Time] [2022-02-20 23:48:01,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-02-20 23:48:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2022-02-20 23:48:01,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:01,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 221 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 216 states have internal predecessors, (241), 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,178 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 221 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 216 states have internal predecessors, (241), 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,178 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 221 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 216 states have internal predecessors, (241), 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,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:01,182 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2022-02-20 23:48:01,182 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 247 transitions. [2022-02-20 23:48:01,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:01,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:01,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 216 states have internal predecessors, (241), 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 223 states. [2022-02-20 23:48:01,183 INFO L87 Difference]: Start difference. First operand has 221 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 216 states have internal predecessors, (241), 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 223 states. [2022-02-20 23:48:01,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:01,187 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2022-02-20 23:48:01,187 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 247 transitions. [2022-02-20 23:48:01,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:01,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:01,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:01,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 216 states have internal predecessors, (241), 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,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 245 transitions. [2022-02-20 23:48:01,192 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 245 transitions. Word has length 27 [2022-02-20 23:48:01,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:01,193 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 245 transitions. [2022-02-20 23:48:01,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 245 transitions. [2022-02-20 23:48:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:48:01,193 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:01,194 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:01,207 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:48:01,405 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:48:01,405 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:48:01,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:01,406 INFO L85 PathProgramCache]: Analyzing trace with hash 201129006, now seen corresponding path program 3 times [2022-02-20 23:48:01,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:01,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699732614] [2022-02-20 23:48:01,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:48:01,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:01,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:01,408 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:48:01,410 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:48:01,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 23:48:01,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:48:01,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-20 23:48:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:01,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:01,868 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:48:01,880 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:48:01,933 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:48:01,947 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:02,170 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:02,171 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:48:02,178 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:48:02,437 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:02,437 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:48:02,444 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:48:02,679 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:02,680 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:48:02,688 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:48:02,852 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:48:02,868 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:48:02,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {11806#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); {11806#true} is VALID [2022-02-20 23:48:02,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {11806#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; {11806#true} is VALID [2022-02-20 23:48:02,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {11806#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; {11806#true} is VALID [2022-02-20 23:48:02,912 INFO L290 TraceCheckUtils]: 3: Hoare triple {11806#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 {11806#true} is VALID [2022-02-20 23:48:02,912 INFO L290 TraceCheckUtils]: 4: Hoare triple {11806#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 {11806#true} is VALID [2022-02-20 23:48:02,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {11806#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {11806#true} is VALID [2022-02-20 23:48:02,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {11806#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 {11806#true} is VALID [2022-02-20 23:48:02,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {11806#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; {11806#true} is VALID [2022-02-20 23:48:02,913 INFO L272 TraceCheckUtils]: 8: Hoare triple {11806#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {11806#true} is VALID [2022-02-20 23:48:02,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {11806#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {11806#true} is VALID [2022-02-20 23:48:02,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {11806#true} assume !#t~short4; {11806#true} is VALID [2022-02-20 23:48:02,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {11806#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); {11844#(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:48:02,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {11844#(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 {11848#(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:48:02,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {11848#(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; {11852#(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:48:02,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {11852#(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, 20bv32); {11852#(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:48:02,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {11852#(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 {11859#(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:48:02,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {11859#(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 {11852#(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:48:02,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {11852#(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; {11852#(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:48:02,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {11852#(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; {11869#(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:48:02,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {11869#(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, 20bv32); {11869#(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:48:02,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {11869#(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 {11876#(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:48:02,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {11876#(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 {11869#(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:48:02,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {11869#(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; {11869#(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:48:02,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {11869#(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; {11886#(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:48:02,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {11886#(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, 20bv32); {11886#(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:48:02,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {11886#(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 {11893#(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|) (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:48:02,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {11893#(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|) (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 write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {11886#(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:48:02,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {11886#(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))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {11886#(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:48:02,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {11886#(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))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {11903#(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 create_data_~counter~0 (_ bv4294967293 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:48:02,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {11903#(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 create_data_~counter~0 (_ bv4294967293 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, 20bv32); {11903#(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 create_data_~counter~0 (_ bv4294967293 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:48:02,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {11903#(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 create_data_~counter~0 (_ bv4294967293 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 {11910#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= (bvadd create_data_~counter~0 (_ bv4294967293 32)) (_ bv0 32)) (= |create_data_#t~mem9.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:02,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {11910#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= (bvadd create_data_~counter~0 (_ bv4294967293 32)) (_ 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)))); {11807#false} is VALID [2022-02-20 23:48:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:02,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:48:03,409 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_364) c_create_data_~data~0.base) .cse0) (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_365) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_364) 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 (_ bv4 32) .cse1 .cse2) (bvadd (_ bv8 32) .cse1 .cse2))))) is different from false [2022-02-20 23:48:03,479 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_364) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_364) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_365) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-02-20 23:48:03,578 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (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 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_364) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_365) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_364 (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_364) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2022-02-20 23:48:03,754 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (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_362) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_363) c_create_data_~data~0.base) .cse2) v_ArrVal_364) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_363)) (.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_362) .cse3 v_ArrVal_364) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_365) c_create_data_~data~0.base) .cse4))))))) is different from false