./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-01-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/forester-heap/dll-01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:36:30,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:36:30,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:36:30,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:36:30,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:36:30,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:36:30,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:36:30,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:36:30,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:36:30,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:36:30,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:36:30,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:36:30,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:36:30,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:36:30,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:36:30,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:36:30,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:36:30,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:36:30,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:36:30,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:36:30,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:36:30,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:36:30,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:36:30,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:36:30,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:36:30,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:36:30,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:36:30,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:36:30,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:36:30,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:36:30,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:36:30,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:36:30,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:36:30,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:36:30,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:36:30,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:36:30,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:36:30,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:36:30,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:36:30,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:36:30,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:36:30,829 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-02-20 23:36:30,846 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:36:30,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:36:30,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:36:30,846 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:36:30,847 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:36:30,847 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:36:30,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:36:30,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:36:30,848 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:36:30,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:36:30,848 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:36:30,848 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:36:30,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:36:30,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:36:30,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:36:30,849 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:36:30,849 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:36:30,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:36:30,849 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:36:30,849 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:36:30,849 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:36:30,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:36:30,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:36:30,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:36:30,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:30,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:36:30,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:36:30,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:36:30,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:36:30,852 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-memcleanup) ) 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 -> dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee [2022-02-20 23:36:31,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:36:31,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:36:31,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:36:31,092 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:36:31,093 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:36:31,095 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-1.i [2022-02-20 23:36:31,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/619c4af5c/a2c6f12a2cb34b60b164e751ed556e46/FLAGc4ab74e16 [2022-02-20 23:36:31,543 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:36:31,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i [2022-02-20 23:36:31,552 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/619c4af5c/a2c6f12a2cb34b60b164e751ed556e46/FLAGc4ab74e16 [2022-02-20 23:36:31,561 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/619c4af5c/a2c6f12a2cb34b60b164e751ed556e46 [2022-02-20 23:36:31,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:36:31,563 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:36:31,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:31,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:36:31,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:36:31,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:31,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c099807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31, skipping insertion in model container [2022-02-20 23:36:31,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:31,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:36:31,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:36:31,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2022-02-20 23:36:31,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2022-02-20 23:36:31,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2022-02-20 23:36:31,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2022-02-20 23:36:31,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2022-02-20 23:36:31,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2022-02-20 23:36:31,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2022-02-20 23:36:31,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2022-02-20 23:36:31,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2022-02-20 23:36:31,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2022-02-20 23:36:31,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2022-02-20 23:36:31,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2022-02-20 23:36:31,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2022-02-20 23:36:31,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:31,910 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:36:31,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2022-02-20 23:36:31,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2022-02-20 23:36:31,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2022-02-20 23:36:31,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2022-02-20 23:36:31,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2022-02-20 23:36:31,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2022-02-20 23:36:31,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2022-02-20 23:36:31,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2022-02-20 23:36:31,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2022-02-20 23:36:31,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2022-02-20 23:36:31,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2022-02-20 23:36:31,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2022-02-20 23:36:31,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2022-02-20 23:36:31,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:31,972 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:36:31,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31 WrapperNode [2022-02-20 23:36:31,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:31,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:31,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:36:31,974 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:36:31,980 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:36:31" (1/1) ... [2022-02-20 23:36:31,991 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:36:31" (1/1) ... [2022-02-20 23:36:32,020 INFO L137 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2022-02-20 23:36:32,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:32,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:36:32,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:36:32,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:36:32,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:32,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:32,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:32,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:32,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:32,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:32,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:32,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:36:32,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:36:32,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:36:32,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:36:32,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:32,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:32,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:36:32,070 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:36:32,081 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:36:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:36:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:36:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:36:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:36:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:36:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:36:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:36:32,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:36:32,214 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:36:32,215 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:36:32,793 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:36:32,801 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:36:32,801 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-02-20 23:36:32,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:32 BoogieIcfgContainer [2022-02-20 23:36:32,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:36:32,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:36:32,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:36:32,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:36:32,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:36:31" (1/3) ... [2022-02-20 23:36:32,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433e3b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:36:32, skipping insertion in model container [2022-02-20 23:36:32,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (2/3) ... [2022-02-20 23:36:32,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433e3b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:36:32, skipping insertion in model container [2022-02-20 23:36:32,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:32" (3/3) ... [2022-02-20 23:36:32,811 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2022-02-20 23:36:32,815 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:36:32,815 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 84 error locations. [2022-02-20 23:36:32,850 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:36:32,856 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:36:32,856 INFO L340 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2022-02-20 23:36:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 115 states have (on average 2.1913043478260867) internal successors, (252), 199 states have internal predecessors, (252), 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:36:32,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:36:32,888 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:32,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:36:32,888 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:32,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:32,894 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:36:32,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:32,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529812616] [2022-02-20 23:36:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:32,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:33,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {203#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {203#true} is VALID [2022-02-20 23:36:33,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:33,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !(1 == #valid[main_~list~0#1.base]); {204#false} is VALID [2022-02-20 23:36:33,046 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:36:33,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:33,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529812616] [2022-02-20 23:36:33,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529812616] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:33,047 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:33,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:33,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757527628] [2022-02-20 23:36:33,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:33,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:36:33,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:33,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:33,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:33,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:33,062 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:33,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:33,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:33,082 INFO L87 Difference]: Start difference. First operand has 200 states, 115 states have (on average 2.1913043478260867) internal successors, (252), 199 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:33,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:33,378 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2022-02-20 23:36:33,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:33,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:36:33,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2022-02-20 23:36:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2022-02-20 23:36:33,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 265 transitions. [2022-02-20 23:36:33,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:33,599 INFO L225 Difference]: With dead ends: 201 [2022-02-20 23:36:33,599 INFO L226 Difference]: Without dead ends: 197 [2022-02-20 23:36:33,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:36:33,602 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 191 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:33,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 122 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:33,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-02-20 23:36:33,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2022-02-20 23:36:33,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:33,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 192 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 191 states have internal predecessors, (204), 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:36:33,627 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 192 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 191 states have internal predecessors, (204), 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:36:33,628 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 192 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 191 states have internal predecessors, (204), 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:36:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:33,636 INFO L93 Difference]: Finished difference Result 197 states and 206 transitions. [2022-02-20 23:36:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 206 transitions. [2022-02-20 23:36:33,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:33,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:33,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 192 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 191 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 197 states. [2022-02-20 23:36:33,638 INFO L87 Difference]: Start difference. First operand has 192 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 191 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 197 states. [2022-02-20 23:36:33,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:33,644 INFO L93 Difference]: Finished difference Result 197 states and 206 transitions. [2022-02-20 23:36:33,644 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 206 transitions. [2022-02-20 23:36:33,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:33,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:33,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:33,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 191 states have internal predecessors, (204), 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:36:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 204 transitions. [2022-02-20 23:36:33,651 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 204 transitions. Word has length 3 [2022-02-20 23:36:33,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:33,651 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 204 transitions. [2022-02-20 23:36:33,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 204 transitions. [2022-02-20 23:36:33,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:36:33,652 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:33,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:36:33,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:36:33,652 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:33,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:33,653 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:36:33,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:33,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396132944] [2022-02-20 23:36:33,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:33,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:33,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {995#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {995#true} is VALID [2022-02-20 23:36:33,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {995#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {997#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:33,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {997#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(4 + main_~list~0#1.offset <= #length[main_~list~0#1.base] && 0 <= main_~list~0#1.offset); {996#false} is VALID [2022-02-20 23:36:33,684 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:36:33,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:33,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396132944] [2022-02-20 23:36:33,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396132944] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:33,685 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:33,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:33,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694284366] [2022-02-20 23:36:33,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:33,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:36:33,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:33,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:33,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:33,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:33,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:33,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:33,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:33,690 INFO L87 Difference]: Start difference. First operand 192 states and 204 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:33,948 INFO L93 Difference]: Finished difference Result 221 states and 232 transitions. [2022-02-20 23:36:33,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:33,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:36:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2022-02-20 23:36:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2022-02-20 23:36:33,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 240 transitions. [2022-02-20 23:36:34,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:34,123 INFO L225 Difference]: With dead ends: 221 [2022-02-20 23:36:34,124 INFO L226 Difference]: Without dead ends: 221 [2022-02-20 23:36:34,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:36:34,125 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 180 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:34,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 148 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:34,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-02-20 23:36:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 201. [2022-02-20 23:36:34,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:34,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 201 states, 134 states have (on average 1.671641791044776) internal successors, (224), 200 states have internal predecessors, (224), 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:36:34,131 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 201 states, 134 states have (on average 1.671641791044776) internal successors, (224), 200 states have internal predecessors, (224), 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:36:34,132 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 201 states, 134 states have (on average 1.671641791044776) internal successors, (224), 200 states have internal predecessors, (224), 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:36:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,140 INFO L93 Difference]: Finished difference Result 221 states and 232 transitions. [2022-02-20 23:36:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 232 transitions. [2022-02-20 23:36:34,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:34,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:34,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 134 states have (on average 1.671641791044776) internal successors, (224), 200 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 221 states. [2022-02-20 23:36:34,142 INFO L87 Difference]: Start difference. First operand has 201 states, 134 states have (on average 1.671641791044776) internal successors, (224), 200 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 221 states. [2022-02-20 23:36:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,150 INFO L93 Difference]: Finished difference Result 221 states and 232 transitions. [2022-02-20 23:36:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 232 transitions. [2022-02-20 23:36:34,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:34,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:34,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:34,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:34,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 134 states have (on average 1.671641791044776) internal successors, (224), 200 states have internal predecessors, (224), 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:36:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 224 transitions. [2022-02-20 23:36:34,159 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 224 transitions. Word has length 3 [2022-02-20 23:36:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:34,159 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 224 transitions. [2022-02-20 23:36:34,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 224 transitions. [2022-02-20 23:36:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:36:34,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:34,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:36:34,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:36:34,160 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:34,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:34,161 INFO L85 PathProgramCache]: Analyzing trace with hash 889446311, now seen corresponding path program 1 times [2022-02-20 23:36:34,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:34,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044981516] [2022-02-20 23:36:34,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:34,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:34,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {1864#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {1864#true} is VALID [2022-02-20 23:36:34,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {1864#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {1866#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:34,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {1866#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {1866#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:34,192 INFO L290 TraceCheckUtils]: 3: Hoare triple {1866#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {1866#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:34,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {1866#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume !(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {1865#false} is VALID [2022-02-20 23:36:34,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {1865#false} assume !false; {1865#false} is VALID [2022-02-20 23:36:34,193 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:36:34,193 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:34,193 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044981516] [2022-02-20 23:36:34,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044981516] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:34,194 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:34,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:36:34,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540656313] [2022-02-20 23:36:34,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:34,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 23:36:34,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:34,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:36:34,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:34,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:34,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:34,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:34,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:34,207 INFO L87 Difference]: Start difference. First operand 201 states and 224 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:36:34,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,360 INFO L93 Difference]: Finished difference Result 216 states and 227 transitions. [2022-02-20 23:36:34,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:34,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 23:36:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:34,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:36:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 23:36:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:36:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 23:36:34,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 226 transitions. [2022-02-20 23:36:34,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:34,525 INFO L225 Difference]: With dead ends: 216 [2022-02-20 23:36:34,525 INFO L226 Difference]: Without dead ends: 216 [2022-02-20 23:36:34,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:34,526 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 176 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:34,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 203 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:36:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-02-20 23:36:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2022-02-20 23:36:34,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:34,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 199 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 198 states have internal predecessors, (221), 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:36:34,534 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 199 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 198 states have internal predecessors, (221), 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:36:34,534 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 199 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 198 states have internal predecessors, (221), 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:36:34,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,538 INFO L93 Difference]: Finished difference Result 216 states and 227 transitions. [2022-02-20 23:36:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 227 transitions. [2022-02-20 23:36:34,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:34,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:34,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 198 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 216 states. [2022-02-20 23:36:34,539 INFO L87 Difference]: Start difference. First operand has 199 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 198 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 216 states. [2022-02-20 23:36:34,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,543 INFO L93 Difference]: Finished difference Result 216 states and 227 transitions. [2022-02-20 23:36:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 227 transitions. [2022-02-20 23:36:34,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:34,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:34,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:34,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 198 states have internal predecessors, (221), 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:36:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 221 transitions. [2022-02-20 23:36:34,548 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 221 transitions. Word has length 6 [2022-02-20 23:36:34,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:34,548 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 221 transitions. [2022-02-20 23:36:34,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:36:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 221 transitions. [2022-02-20 23:36:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:36:34,549 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:34,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:34,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:36:34,550 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:34,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:34,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777177, now seen corresponding path program 1 times [2022-02-20 23:36:34,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:34,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406319779] [2022-02-20 23:36:34,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:34,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:34,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {2716#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {2716#true} is VALID [2022-02-20 23:36:34,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {2716#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {2716#true} is VALID [2022-02-20 23:36:34,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {2716#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {2716#true} is VALID [2022-02-20 23:36:34,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {2716#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {2716#true} is VALID [2022-02-20 23:36:34,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {2716#true} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {2716#true} is VALID [2022-02-20 23:36:34,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {2716#true} goto; {2716#true} is VALID [2022-02-20 23:36:34,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {2716#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {2716#true} is VALID [2022-02-20 23:36:34,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {2716#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {2718#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} is VALID [2022-02-20 23:36:34,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {2718#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-8 {2719#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} is VALID [2022-02-20 23:36:34,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {2719#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2719#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} is VALID [2022-02-20 23:36:34,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {2719#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-10 {2720#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} is VALID [2022-02-20 23:36:34,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {2720#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} assume !(1 == #valid[main_#t~mem4#1.base]); {2717#false} is VALID [2022-02-20 23:36:34,604 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:36:34,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:34,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406319779] [2022-02-20 23:36:34,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406319779] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:34,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:34,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:34,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243120993] [2022-02-20 23:36:34,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:34,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-02-20 23:36:34,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:34,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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:36:34,613 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:36:34,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:34,614 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:34,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:34,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:34,614 INFO L87 Difference]: Start difference. First operand 199 states and 221 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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:36:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,026 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2022-02-20 23:36:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:36:35,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-02-20 23:36:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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:36:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2022-02-20 23:36:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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:36:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2022-02-20 23:36:35,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 188 transitions. [2022-02-20 23:36:35,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:35,118 INFO L225 Difference]: With dead ends: 198 [2022-02-20 23:36:35,118 INFO L226 Difference]: Without dead ends: 198 [2022-02-20 23:36:35,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:36:35,119 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 4 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:35,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 535 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:35,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-02-20 23:36:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-02-20 23:36:35,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:35,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 198 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 197 states have internal predecessors, (220), 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:36:35,124 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 198 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 197 states have internal predecessors, (220), 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:36:35,124 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 198 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 197 states have internal predecessors, (220), 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:36:35,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,127 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2022-02-20 23:36:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2022-02-20 23:36:35,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:35,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:35,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 197 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 198 states. [2022-02-20 23:36:35,129 INFO L87 Difference]: Start difference. First operand has 198 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 197 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 198 states. [2022-02-20 23:36:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,132 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2022-02-20 23:36:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2022-02-20 23:36:35,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:35,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:35,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:35,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 197 states have internal predecessors, (220), 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:36:35,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 220 transitions. [2022-02-20 23:36:35,136 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 220 transitions. Word has length 12 [2022-02-20 23:36:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:35,136 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 220 transitions. [2022-02-20 23:36:35,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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:36:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2022-02-20 23:36:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:36:35,137 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:35,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:35,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:36:35,137 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777178, now seen corresponding path program 1 times [2022-02-20 23:36:35,138 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:35,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740028667] [2022-02-20 23:36:35,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:35,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:35,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {3519#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {3519#true} is VALID [2022-02-20 23:36:35,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {3519#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {3519#true} is VALID [2022-02-20 23:36:35,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {3519#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {3519#true} is VALID [2022-02-20 23:36:35,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {3519#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {3519#true} is VALID [2022-02-20 23:36:35,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {3519#true} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {3519#true} is VALID [2022-02-20 23:36:35,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {3519#true} goto; {3519#true} is VALID [2022-02-20 23:36:35,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {3519#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {3519#true} is VALID [2022-02-20 23:36:35,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {3519#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {3521#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|)))} is VALID [2022-02-20 23:36:35,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {3521#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-8 {3522#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:36:35,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {3522#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3522#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:36:35,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {3522#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-10 {3523#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)))} is VALID [2022-02-20 23:36:35,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {3523#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)))} assume !(4 + main_#t~mem4#1.offset <= #length[main_#t~mem4#1.base] && 0 <= main_#t~mem4#1.offset); {3520#false} is VALID [2022-02-20 23:36:35,246 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:36:35,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:35,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740028667] [2022-02-20 23:36:35,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740028667] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:35,249 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:35,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:35,250 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780525675] [2022-02-20 23:36:35,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:35,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-02-20 23:36:35,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:35,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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:36:35,258 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:36:35,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:35,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:35,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:35,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:35,259 INFO L87 Difference]: Start difference. First operand 198 states and 220 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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:36:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,777 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2022-02-20 23:36:35,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:36:35,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-02-20 23:36:35,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:35,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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:36:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2022-02-20 23:36:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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:36:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2022-02-20 23:36:35,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 187 transitions. [2022-02-20 23:36:35,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:35,901 INFO L225 Difference]: With dead ends: 197 [2022-02-20 23:36:35,901 INFO L226 Difference]: Without dead ends: 197 [2022-02-20 23:36:35,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:36:35,903 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 2 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:35,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 546 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-02-20 23:36:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-02-20 23:36:35,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:35,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 197 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 196 states have internal predecessors, (219), 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:36:35,920 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 197 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 196 states have internal predecessors, (219), 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:36:35,921 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 197 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 196 states have internal predecessors, (219), 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:36:35,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,926 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2022-02-20 23:36:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2022-02-20 23:36:35,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:35,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:35,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 196 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 197 states. [2022-02-20 23:36:35,927 INFO L87 Difference]: Start difference. First operand has 197 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 196 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 197 states. [2022-02-20 23:36:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,930 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2022-02-20 23:36:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2022-02-20 23:36:35,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:35,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:35,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:35,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 196 states have internal predecessors, (219), 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:36:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2022-02-20 23:36:35,944 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 12 [2022-02-20 23:36:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:35,945 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2022-02-20 23:36:35,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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:36:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2022-02-20 23:36:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:36:35,945 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:35,945 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:35,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:36:35,946 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:35,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:35,947 INFO L85 PathProgramCache]: Analyzing trace with hash 373192235, now seen corresponding path program 1 times [2022-02-20 23:36:35,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:35,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790325981] [2022-02-20 23:36:35,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:35,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:35,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {4318#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {4318#true} is VALID [2022-02-20 23:36:35,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {4318#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {4318#true} is VALID [2022-02-20 23:36:35,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {4318#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {4318#true} is VALID [2022-02-20 23:36:35,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {4318#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {4318#true} is VALID [2022-02-20 23:36:35,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {4318#true} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {4318#true} is VALID [2022-02-20 23:36:35,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {4318#true} goto; {4318#true} is VALID [2022-02-20 23:36:35,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {4318#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {4318#true} is VALID [2022-02-20 23:36:35,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {4318#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {4318#true} is VALID [2022-02-20 23:36:35,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {4318#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {4318#true} is VALID [2022-02-20 23:36:35,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {4318#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {4318#true} is VALID [2022-02-20 23:36:35,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {4318#true} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {4318#true} is VALID [2022-02-20 23:36:35,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {4318#true} assume main_#t~short8#1; {4320#|ULTIMATE.start_main_#t~short8#1|} is VALID [2022-02-20 23:36:35,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {4320#|ULTIMATE.start_main_#t~short8#1|} assume !main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {4319#false} is VALID [2022-02-20 23:36:35,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {4319#false} assume !false; {4319#false} is VALID [2022-02-20 23:36:35,997 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:36:35,997 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:35,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790325981] [2022-02-20 23:36:35,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790325981] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:35,997 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:35,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:36:35,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763189243] [2022-02-20 23:36:35,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:35,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-02-20 23:36:35,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:35,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:36:36,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:36,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:36,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:36,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:36,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:36,007 INFO L87 Difference]: Start difference. First operand 197 states and 219 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:36:36,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,131 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2022-02-20 23:36:36,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:36,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-02-20 23:36:36,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:36:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2022-02-20 23:36:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:36:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2022-02-20 23:36:36,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2022-02-20 23:36:36,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:36,225 INFO L225 Difference]: With dead ends: 198 [2022-02-20 23:36:36,225 INFO L226 Difference]: Without dead ends: 198 [2022-02-20 23:36:36,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:36,226 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:36,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:36:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-02-20 23:36:36,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-02-20 23:36:36,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:36,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 198 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 197 states have internal predecessors, (220), 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:36:36,230 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 198 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 197 states have internal predecessors, (220), 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:36:36,230 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 198 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 197 states have internal predecessors, (220), 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:36:36,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,232 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2022-02-20 23:36:36,232 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2022-02-20 23:36:36,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:36,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:36,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 197 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 198 states. [2022-02-20 23:36:36,233 INFO L87 Difference]: Start difference. First operand has 198 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 197 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 198 states. [2022-02-20 23:36:36,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,236 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2022-02-20 23:36:36,236 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2022-02-20 23:36:36,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:36,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:36,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:36,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 197 states have internal predecessors, (220), 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:36:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 220 transitions. [2022-02-20 23:36:36,239 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 220 transitions. Word has length 14 [2022-02-20 23:36:36,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:36,239 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 220 transitions. [2022-02-20 23:36:36,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:36:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2022-02-20 23:36:36,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:36:36,239 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:36,240 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:36,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:36:36,240 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:36,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:36,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692102, now seen corresponding path program 1 times [2022-02-20 23:36:36,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:36,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629691302] [2022-02-20 23:36:36,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:36,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:36,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {5115#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {5115#true} is VALID [2022-02-20 23:36:36,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {5115#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {5115#true} is VALID [2022-02-20 23:36:36,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {5115#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {5117#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:36,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {5117#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {5117#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:36,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {5117#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {5117#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:36,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {5117#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} goto; {5117#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:36,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {5117#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {5117#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:36,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {5117#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {5118#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:36,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {5118#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-8 {5119#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1))} is VALID [2022-02-20 23:36:36,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {5119#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {5119#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1))} is VALID [2022-02-20 23:36:36,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {5119#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-10 {5120#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1))} is VALID [2022-02-20 23:36:36,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {5120#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem4#1.base, main_#t~mem4#1.offset, 4); srcloc: L1006-11 {5121#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} is VALID [2022-02-20 23:36:36,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {5121#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {5121#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} is VALID [2022-02-20 23:36:36,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {5121#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-13 {5122#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} is VALID [2022-02-20 23:36:36,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {5122#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} assume !(1 == #valid[main_#t~mem5#1.base]); {5116#false} is VALID [2022-02-20 23:36:36,357 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:36:36,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:36,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629691302] [2022-02-20 23:36:36,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629691302] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:36,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:36,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:36:36,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684639856] [2022-02-20 23:36:36,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:36,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 15 [2022-02-20 23:36:36,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:36,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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:36:36,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:36,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:36:36,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:36,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:36:36,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:36:36,370 INFO L87 Difference]: Start difference. First operand 198 states and 220 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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:36:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,274 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2022-02-20 23:36:37,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:36:37,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 15 [2022-02-20 23:36:37,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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:36:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-02-20 23:36:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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:36:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-02-20 23:36:37,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 190 transitions. [2022-02-20 23:36:37,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:37,415 INFO L225 Difference]: With dead ends: 198 [2022-02-20 23:36:37,415 INFO L226 Difference]: Without dead ends: 198 [2022-02-20 23:36:37,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:36:37,415 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:37,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 669 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:36:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-02-20 23:36:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2022-02-20 23:36:37,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:37,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 197 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 196 states have internal predecessors, (219), 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:36:37,418 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 197 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 196 states have internal predecessors, (219), 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:36:37,418 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 197 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 196 states have internal predecessors, (219), 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:36:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,422 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2022-02-20 23:36:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2022-02-20 23:36:37,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:37,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:37,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 196 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 198 states. [2022-02-20 23:36:37,423 INFO L87 Difference]: Start difference. First operand has 197 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 196 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 198 states. [2022-02-20 23:36:37,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,425 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2022-02-20 23:36:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2022-02-20 23:36:37,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:37,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:37,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:37,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 196 states have internal predecessors, (219), 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:36:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2022-02-20 23:36:37,428 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 15 [2022-02-20 23:36:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:37,429 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2022-02-20 23:36:37,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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:36:37,429 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2022-02-20 23:36:37,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:36:37,429 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:37,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:37,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:36:37,430 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:37,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692101, now seen corresponding path program 1 times [2022-02-20 23:36:37,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:37,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269764973] [2022-02-20 23:36:37,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:37,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:37,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {5928#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {5928#true} is VALID [2022-02-20 23:36:37,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {5928#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {5928#true} is VALID [2022-02-20 23:36:37,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {5928#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {5930#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {5930#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {5930#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {5930#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {5930#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {5930#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} goto; {5930#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {5930#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {5930#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {5930#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {5931#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} is VALID [2022-02-20 23:36:37,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {5931#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-8 {5932#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:37,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {5932#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {5932#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:37,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {5932#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-10 {5933#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:37,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {5933#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem4#1.base, main_#t~mem4#1.offset, 4); srcloc: L1006-11 {5934#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:37,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {5934#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {5934#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:37,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {5934#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-13 {5935#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) 12))} is VALID [2022-02-20 23:36:37,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {5935#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) 12))} assume !(4 + (8 + main_#t~mem5#1.offset) <= #length[main_#t~mem5#1.base] && 0 <= 8 + main_#t~mem5#1.offset); {5929#false} is VALID [2022-02-20 23:36:37,567 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:36:37,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:37,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269764973] [2022-02-20 23:36:37,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269764973] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:37,567 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:37,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:36:37,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994570908] [2022-02-20 23:36:37,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:37,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 15 [2022-02-20 23:36:37,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:37,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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:36:37,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:37,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:36:37,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:37,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:36:37,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:36:37,577 INFO L87 Difference]: Start difference. First operand 197 states and 219 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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:36:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:38,470 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2022-02-20 23:36:38,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:36:38,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 15 [2022-02-20 23:36:38,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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:36:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2022-02-20 23:36:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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:36:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2022-02-20 23:36:38,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 189 transitions. [2022-02-20 23:36:38,572 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:36:38,574 INFO L225 Difference]: With dead ends: 197 [2022-02-20 23:36:38,574 INFO L226 Difference]: Without dead ends: 197 [2022-02-20 23:36:38,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:36:38,576 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 171 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:38,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 486 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:36:38,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-02-20 23:36:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2022-02-20 23:36:38,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:38,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 196 states, 134 states have (on average 1.626865671641791) internal successors, (218), 195 states have internal predecessors, (218), 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:36:38,581 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 196 states, 134 states have (on average 1.626865671641791) internal successors, (218), 195 states have internal predecessors, (218), 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:36:38,587 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 196 states, 134 states have (on average 1.626865671641791) internal successors, (218), 195 states have internal predecessors, (218), 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:36:38,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:38,590 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2022-02-20 23:36:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2022-02-20 23:36:38,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:38,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:38,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 134 states have (on average 1.626865671641791) internal successors, (218), 195 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 197 states. [2022-02-20 23:36:38,592 INFO L87 Difference]: Start difference. First operand has 196 states, 134 states have (on average 1.626865671641791) internal successors, (218), 195 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 197 states. [2022-02-20 23:36:38,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:38,594 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2022-02-20 23:36:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2022-02-20 23:36:38,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:38,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:38,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:38,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 134 states have (on average 1.626865671641791) internal successors, (218), 195 states have internal predecessors, (218), 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:36:38,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 218 transitions. [2022-02-20 23:36:38,598 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 218 transitions. Word has length 15 [2022-02-20 23:36:38,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:38,598 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 218 transitions. [2022-02-20 23:36:38,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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:36:38,599 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2022-02-20 23:36:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:36:38,599 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:38,599 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:38,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:36:38,599 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:38,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2137878992, now seen corresponding path program 1 times [2022-02-20 23:36:38,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:38,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736850673] [2022-02-20 23:36:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:38,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {6737#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {6737#true} is VALID [2022-02-20 23:36:38,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {6737#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {6737#true} is VALID [2022-02-20 23:36:38,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {6737#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {6737#true} is VALID [2022-02-20 23:36:38,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {6737#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {6737#true} is VALID [2022-02-20 23:36:38,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {6737#true} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {6737#true} is VALID [2022-02-20 23:36:38,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {6737#true} goto; {6737#true} is VALID [2022-02-20 23:36:38,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {6737#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {6737#true} is VALID [2022-02-20 23:36:38,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {6737#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {6737#true} is VALID [2022-02-20 23:36:38,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {6737#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {6737#true} is VALID [2022-02-20 23:36:38,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {6737#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {6739#(and (= |ULTIMATE.start_main_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) |ULTIMATE.start_main_#t~mem6#1.offset|))} is VALID [2022-02-20 23:36:38,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {6739#(and (= |ULTIMATE.start_main_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) |ULTIMATE.start_main_#t~mem6#1.offset|))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {6740#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) |ULTIMATE.start_main_#t~short8#1|)} is VALID [2022-02-20 23:36:38,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {6740#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) |ULTIMATE.start_main_#t~short8#1|)} assume !main_#t~short8#1; {6741#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:36:38,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {6741#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {6742#(and (= |ULTIMATE.start_main_#t~mem7#1.base| 0) (= |ULTIMATE.start_main_#t~mem7#1.offset| 0))} is VALID [2022-02-20 23:36:38,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {6742#(and (= |ULTIMATE.start_main_#t~mem7#1.base| 0) (= |ULTIMATE.start_main_#t~mem7#1.offset| 0))} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {6743#|ULTIMATE.start_main_#t~short8#1|} is VALID [2022-02-20 23:36:38,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {6743#|ULTIMATE.start_main_#t~short8#1|} assume !main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {6738#false} is VALID [2022-02-20 23:36:38,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {6738#false} assume !false; {6738#false} is VALID [2022-02-20 23:36:38,709 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:36:38,709 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:38,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736850673] [2022-02-20 23:36:38,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736850673] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:38,709 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:38,710 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:36:38,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482169254] [2022-02-20 23:36:38,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:38,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:36:38,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:38,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:38,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:38,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:36:38,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:38,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:36:38,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:36:38,720 INFO L87 Difference]: Start difference. First operand 196 states and 218 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:39,454 INFO L93 Difference]: Finished difference Result 283 states and 311 transitions. [2022-02-20 23:36:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:36:39,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:36:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:39,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:39,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 278 transitions. [2022-02-20 23:36:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 278 transitions. [2022-02-20 23:36:39,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 278 transitions. [2022-02-20 23:36:39,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:39,626 INFO L225 Difference]: With dead ends: 283 [2022-02-20 23:36:39,627 INFO L226 Difference]: Without dead ends: 283 [2022-02-20 23:36:39,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:36:39,627 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 103 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:39,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 863 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:39,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-02-20 23:36:39,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 193. [2022-02-20 23:36:39,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:39,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 193 states, 132 states have (on average 1.628787878787879) internal successors, (215), 192 states have internal predecessors, (215), 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:36:39,630 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 193 states, 132 states have (on average 1.628787878787879) internal successors, (215), 192 states have internal predecessors, (215), 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:36:39,630 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 193 states, 132 states have (on average 1.628787878787879) internal successors, (215), 192 states have internal predecessors, (215), 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:36:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:39,633 INFO L93 Difference]: Finished difference Result 283 states and 311 transitions. [2022-02-20 23:36:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 311 transitions. [2022-02-20 23:36:39,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:39,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:39,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 132 states have (on average 1.628787878787879) internal successors, (215), 192 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 283 states. [2022-02-20 23:36:39,634 INFO L87 Difference]: Start difference. First operand has 193 states, 132 states have (on average 1.628787878787879) internal successors, (215), 192 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 283 states. [2022-02-20 23:36:39,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:39,637 INFO L93 Difference]: Finished difference Result 283 states and 311 transitions. [2022-02-20 23:36:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 311 transitions. [2022-02-20 23:36:39,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:39,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:39,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:39,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 132 states have (on average 1.628787878787879) internal successors, (215), 192 states have internal predecessors, (215), 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:36:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2022-02-20 23:36:39,640 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 16 [2022-02-20 23:36:39,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:39,641 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2022-02-20 23:36:39,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2022-02-20 23:36:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:36:39,641 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:39,641 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:39,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:36:39,641 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:39,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1339025717, now seen corresponding path program 1 times [2022-02-20 23:36:39,642 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:39,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870481697] [2022-02-20 23:36:39,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:39,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:39,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {7800#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {7800#true} is VALID [2022-02-20 23:36:39,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {7800#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {7800#true} is VALID [2022-02-20 23:36:39,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {7800#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {7800#true} is VALID [2022-02-20 23:36:39,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {7800#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {7800#true} is VALID [2022-02-20 23:36:39,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {7800#true} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {7800#true} is VALID [2022-02-20 23:36:39,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {7800#true} goto; {7800#true} is VALID [2022-02-20 23:36:39,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {7800#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {7800#true} is VALID [2022-02-20 23:36:39,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {7800#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {7800#true} is VALID [2022-02-20 23:36:39,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {7800#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {7802#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:36:39,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {7802#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {7803#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| 0) (= |ULTIMATE.start_main_#t~mem6#1.base| 0))} is VALID [2022-02-20 23:36:39,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {7803#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| 0) (= |ULTIMATE.start_main_#t~mem6#1.base| 0))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {7804#(not |ULTIMATE.start_main_#t~short8#1|)} is VALID [2022-02-20 23:36:39,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {7804#(not |ULTIMATE.start_main_#t~short8#1|)} assume main_#t~short8#1; {7801#false} is VALID [2022-02-20 23:36:39,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {7801#false} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {7801#false} is VALID [2022-02-20 23:36:39,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {7801#false} goto; {7801#false} is VALID [2022-02-20 23:36:39,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {7801#false} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {7801#false} is VALID [2022-02-20 23:36:39,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {7801#false} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {7801#false} is VALID [2022-02-20 23:36:39,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {7801#false} assume !!(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(12); {7801#false} is VALID [2022-02-20 23:36:39,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {7801#false} assume !(1 == #valid[main_~end~0#1.base]); {7801#false} is VALID [2022-02-20 23:36:39,685 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:36:39,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:39,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870481697] [2022-02-20 23:36:39,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870481697] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:39,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:39,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:36:39,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789410708] [2022-02-20 23:36:39,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:39,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:36:39,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:39,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:39,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:39,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:39,708 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:39,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:39,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:39,708 INFO L87 Difference]: Start difference. First operand 193 states and 215 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,160 INFO L93 Difference]: Finished difference Result 284 states and 311 transitions. [2022-02-20 23:36:40,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:36:40,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:36:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:40,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 278 transitions. [2022-02-20 23:36:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 278 transitions. [2022-02-20 23:36:40,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 278 transitions. [2022-02-20 23:36:40,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:40,348 INFO L225 Difference]: With dead ends: 284 [2022-02-20 23:36:40,348 INFO L226 Difference]: Without dead ends: 284 [2022-02-20 23:36:40,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:36:40,349 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 100 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:40,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 611 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-02-20 23:36:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 196. [2022-02-20 23:36:40,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:40,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 196 states, 135 states have (on average 1.614814814814815) internal successors, (218), 195 states have internal predecessors, (218), 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:36:40,352 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 196 states, 135 states have (on average 1.614814814814815) internal successors, (218), 195 states have internal predecessors, (218), 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:36:40,352 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 196 states, 135 states have (on average 1.614814814814815) internal successors, (218), 195 states have internal predecessors, (218), 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:36:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,356 INFO L93 Difference]: Finished difference Result 284 states and 311 transitions. [2022-02-20 23:36:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 311 transitions. [2022-02-20 23:36:40,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:40,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:40,357 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 135 states have (on average 1.614814814814815) internal successors, (218), 195 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 284 states. [2022-02-20 23:36:40,357 INFO L87 Difference]: Start difference. First operand has 196 states, 135 states have (on average 1.614814814814815) internal successors, (218), 195 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 284 states. [2022-02-20 23:36:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,361 INFO L93 Difference]: Finished difference Result 284 states and 311 transitions. [2022-02-20 23:36:40,361 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 311 transitions. [2022-02-20 23:36:40,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:40,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:40,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:40,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 135 states have (on average 1.614814814814815) internal successors, (218), 195 states have internal predecessors, (218), 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:36:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 218 transitions. [2022-02-20 23:36:40,364 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 218 transitions. Word has length 18 [2022-02-20 23:36:40,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:40,364 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 218 transitions. [2022-02-20 23:36:40,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2022-02-20 23:36:40,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:36:40,365 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:40,365 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:40,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:36:40,365 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:40,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:40,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802310, now seen corresponding path program 1 times [2022-02-20 23:36:40,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:40,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905072802] [2022-02-20 23:36:40,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:40,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:40,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {8859#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {8859#true} is VALID [2022-02-20 23:36:40,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {8859#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,447 INFO L290 TraceCheckUtils]: 4: Hoare triple {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} goto; {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !main_#t~short8#1; {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} goto; {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {8861#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {8862#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {8862#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {8862#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {8862#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !!(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(12); {8862#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {8862#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !(1 == #valid[main_~end~0#1.base]); {8860#false} is VALID [2022-02-20 23:36:40,452 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:36:40,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:40,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905072802] [2022-02-20 23:36:40,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905072802] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:40,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:40,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:36:40,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247277748] [2022-02-20 23:36:40,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:40,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2022-02-20 23:36:40,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:40,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:36:40,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:40,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:36:40,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:40,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:36:40,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:36:40,470 INFO L87 Difference]: Start difference. First operand 196 states and 218 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:36:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,738 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-02-20 23:36:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:36:40,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2022-02-20 23:36:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:36:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2022-02-20 23:36:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:36:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2022-02-20 23:36:40,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 194 transitions. [2022-02-20 23:36:40,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:40,870 INFO L225 Difference]: With dead ends: 191 [2022-02-20 23:36:40,870 INFO L226 Difference]: Without dead ends: 191 [2022-02-20 23:36:40,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:36:40,871 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 257 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:40,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 115 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-02-20 23:36:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 186. [2022-02-20 23:36:40,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:40,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 186 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 185 states have internal predecessors, (208), 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:36:40,873 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 186 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 185 states have internal predecessors, (208), 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:36:40,873 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 186 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 185 states have internal predecessors, (208), 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:36:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,875 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-02-20 23:36:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2022-02-20 23:36:40,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:40,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:40,875 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 185 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 191 states. [2022-02-20 23:36:40,877 INFO L87 Difference]: Start difference. First operand has 186 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 185 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 191 states. [2022-02-20 23:36:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,878 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-02-20 23:36:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2022-02-20 23:36:40,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:40,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:40,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:40,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 185 states have internal predecessors, (208), 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:36:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2022-02-20 23:36:40,884 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 20 [2022-02-20 23:36:40,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:40,884 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2022-02-20 23:36:40,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:36:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2022-02-20 23:36:40,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:36:40,885 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:40,885 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:40,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:36:40,885 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:40,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:40,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802309, now seen corresponding path program 1 times [2022-02-20 23:36:40,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:40,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165964763] [2022-02-20 23:36:40,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:40,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:40,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {9626#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {9626#true} is VALID [2022-02-20 23:36:40,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {9626#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {9628#(and (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:40,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {9628#(and (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:40,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:40,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:40,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} goto; {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:40,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:40,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:40,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:40,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:40,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:40,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} assume !main_#t~short8#1; {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:40,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:40,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:40,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:40,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} goto; {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:40,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {9629#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {9630#(and (<= 12 (select |#length| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1))} is VALID [2022-02-20 23:36:40,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {9630#(and (<= 12 (select |#length| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {9630#(and (<= 12 (select |#length| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1))} is VALID [2022-02-20 23:36:40,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {9630#(and (<= 12 (select |#length| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1))} assume !!(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(12); {9631#(and (<= 12 (select |#length| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:36:40,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {9631#(and (<= 12 (select |#length| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume !(4 + main_~end~0#1.offset <= #length[main_~end~0#1.base] && 0 <= main_~end~0#1.offset); {9627#false} is VALID [2022-02-20 23:36:40,995 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:36:40,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:40,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165964763] [2022-02-20 23:36:40,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165964763] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:40,996 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:40,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:36:40,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118059084] [2022-02-20 23:36:40,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:40,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2022-02-20 23:36:40,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:40,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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:36:41,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:41,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:36:41,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:41,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:36:41,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:36:41,009 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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:36:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:41,408 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2022-02-20 23:36:41,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:36:41,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2022-02-20 23:36:41,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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:36:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 262 transitions. [2022-02-20 23:36:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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:36:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 262 transitions. [2022-02-20 23:36:41,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 262 transitions. [2022-02-20 23:36:41,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:41,596 INFO L225 Difference]: With dead ends: 247 [2022-02-20 23:36:41,596 INFO L226 Difference]: Without dead ends: 247 [2022-02-20 23:36:41,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:36:41,597 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 307 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:41,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 207 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:41,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-02-20 23:36:41,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 210. [2022-02-20 23:36:41,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:41,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 210 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 209 states have internal predecessors, (246), 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:36:41,600 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 210 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 209 states have internal predecessors, (246), 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:36:41,600 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 210 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 209 states have internal predecessors, (246), 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:36:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:41,603 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2022-02-20 23:36:41,603 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 262 transitions. [2022-02-20 23:36:41,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:41,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:41,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 210 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 209 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 247 states. [2022-02-20 23:36:41,604 INFO L87 Difference]: Start difference. First operand has 210 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 209 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 247 states. [2022-02-20 23:36:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:41,607 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2022-02-20 23:36:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 262 transitions. [2022-02-20 23:36:41,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:41,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:41,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:41,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 209 states have internal predecessors, (246), 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:36:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 246 transitions. [2022-02-20 23:36:41,610 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 246 transitions. Word has length 20 [2022-02-20 23:36:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:41,610 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 246 transitions. [2022-02-20 23:36:41,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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:36:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 246 transitions. [2022-02-20 23:36:41,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:36:41,611 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:41,611 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:41,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:36:41,611 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:41,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1797484881, now seen corresponding path program 1 times [2022-02-20 23:36:41,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:41,612 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001028700] [2022-02-20 23:36:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:41,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:41,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {10587#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {10587#true} is VALID [2022-02-20 23:36:41,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {10587#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} goto; {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume !main_#t~short8#1; {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} goto; {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:36:41,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {10589#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {10590#(not (= |ULTIMATE.start_main_~end~0#1.base| 0))} is VALID [2022-02-20 23:36:41,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {10590#(not (= |ULTIMATE.start_main_~end~0#1.base| 0))} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {10588#false} is VALID [2022-02-20 23:36:41,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {10588#false} assume !false; {10588#false} is VALID [2022-02-20 23:36:41,648 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:36:41,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:41,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001028700] [2022-02-20 23:36:41,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001028700] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:41,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:41,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:41,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243494466] [2022-02-20 23:36:41,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:41,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-02-20 23:36:41,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:41,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:36:41,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:41,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:36:41,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:41,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:36:41,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:36:41,663 INFO L87 Difference]: Start difference. First operand 210 states and 246 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:36:41,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:41,922 INFO L93 Difference]: Finished difference Result 242 states and 256 transitions. [2022-02-20 23:36:41,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:36:41,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-02-20 23:36:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:36:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2022-02-20 23:36:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:36:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2022-02-20 23:36:41,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 252 transitions. [2022-02-20 23:36:42,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:42,088 INFO L225 Difference]: With dead ends: 242 [2022-02-20 23:36:42,088 INFO L226 Difference]: Without dead ends: 242 [2022-02-20 23:36:42,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:36:42,089 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 233 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:42,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 271 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-02-20 23:36:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 208. [2022-02-20 23:36:42,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:42,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 208 states, 160 states have (on average 1.51875) internal successors, (243), 207 states have internal predecessors, (243), 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:36:42,092 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 208 states, 160 states have (on average 1.51875) internal successors, (243), 207 states have internal predecessors, (243), 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:36:42,092 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 208 states, 160 states have (on average 1.51875) internal successors, (243), 207 states have internal predecessors, (243), 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:36:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:42,095 INFO L93 Difference]: Finished difference Result 242 states and 256 transitions. [2022-02-20 23:36:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 256 transitions. [2022-02-20 23:36:42,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:42,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:42,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 160 states have (on average 1.51875) internal successors, (243), 207 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 242 states. [2022-02-20 23:36:42,096 INFO L87 Difference]: Start difference. First operand has 208 states, 160 states have (on average 1.51875) internal successors, (243), 207 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 242 states. [2022-02-20 23:36:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:42,099 INFO L93 Difference]: Finished difference Result 242 states and 256 transitions. [2022-02-20 23:36:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 256 transitions. [2022-02-20 23:36:42,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:42,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:42,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:42,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.51875) internal successors, (243), 207 states have internal predecessors, (243), 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:36:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 243 transitions. [2022-02-20 23:36:42,102 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 243 transitions. Word has length 22 [2022-02-20 23:36:42,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:42,102 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 243 transitions. [2022-02-20 23:36:42,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:36:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 243 transitions. [2022-02-20 23:36:42,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:36:42,103 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:42,103 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:42,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:36:42,103 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:42,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:42,104 INFO L85 PathProgramCache]: Analyzing trace with hash 110847663, now seen corresponding path program 1 times [2022-02-20 23:36:42,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:42,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607909629] [2022-02-20 23:36:42,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:42,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:42,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {11529#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {11529#true} is VALID [2022-02-20 23:36:42,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {11529#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {11529#true} is VALID [2022-02-20 23:36:42,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {11529#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {11529#true} is VALID [2022-02-20 23:36:42,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {11529#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {11529#true} is VALID [2022-02-20 23:36:42,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {11529#true} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {11529#true} is VALID [2022-02-20 23:36:42,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {11529#true} goto; {11529#true} is VALID [2022-02-20 23:36:42,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {11529#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {11529#true} is VALID [2022-02-20 23:36:42,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {11529#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {11529#true} is VALID [2022-02-20 23:36:42,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {11529#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {11529#true} is VALID [2022-02-20 23:36:42,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {11529#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {11529#true} is VALID [2022-02-20 23:36:42,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {11529#true} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {11529#true} is VALID [2022-02-20 23:36:42,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {11529#true} assume !main_#t~short8#1; {11529#true} is VALID [2022-02-20 23:36:42,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {11529#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {11529#true} is VALID [2022-02-20 23:36:42,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {11529#true} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {11529#true} is VALID [2022-02-20 23:36:42,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {11529#true} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {11529#true} is VALID [2022-02-20 23:36:42,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {11529#true} goto; {11529#true} is VALID [2022-02-20 23:36:42,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {11529#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {11529#true} is VALID [2022-02-20 23:36:42,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {11529#true} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {11529#true} is VALID [2022-02-20 23:36:42,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {11529#true} assume !!(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(12); {11531#(= 1 (select |#valid| |ULTIMATE.start_main_#t~malloc10#1.base|))} is VALID [2022-02-20 23:36:42,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {11531#(= 1 (select |#valid| |ULTIMATE.start_main_#t~malloc10#1.base|))} SUMMARY for call write~$Pointer$(main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1014 {11532#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:42,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {11532#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset; {11532#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:42,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {11532#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1015 {11533#(= (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|) 1)} is VALID [2022-02-20 23:36:42,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {11533#(= (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|) 1)} assume !(1 == #valid[main_#t~mem11#1.base]); {11530#false} is VALID [2022-02-20 23:36:42,150 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:36:42,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:42,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607909629] [2022-02-20 23:36:42,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607909629] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:42,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:42,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:42,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942683788] [2022-02-20 23:36:42,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:42,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2022-02-20 23:36:42,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:42,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:36:42,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:42,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:42,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:42,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:42,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:42,167 INFO L87 Difference]: Start difference. First operand 208 states and 243 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:36:42,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:42,552 INFO L93 Difference]: Finished difference Result 207 states and 241 transitions. [2022-02-20 23:36:42,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:36:42,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2022-02-20 23:36:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:36:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2022-02-20 23:36:42,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:36:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2022-02-20 23:36:42,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 168 transitions. [2022-02-20 23:36:42,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:42,659 INFO L225 Difference]: With dead ends: 207 [2022-02-20 23:36:42,659 INFO L226 Difference]: Without dead ends: 207 [2022-02-20 23:36:42,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:36:42,659 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 9 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:42,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 464 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-02-20 23:36:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-02-20 23:36:42,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:42,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 207 states, 160 states have (on average 1.50625) internal successors, (241), 206 states have internal predecessors, (241), 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:36:42,662 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 207 states, 160 states have (on average 1.50625) internal successors, (241), 206 states have internal predecessors, (241), 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:36:42,662 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 207 states, 160 states have (on average 1.50625) internal successors, (241), 206 states have internal predecessors, (241), 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:36:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:42,664 INFO L93 Difference]: Finished difference Result 207 states and 241 transitions. [2022-02-20 23:36:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2022-02-20 23:36:42,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:42,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:42,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 160 states have (on average 1.50625) internal successors, (241), 206 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 207 states. [2022-02-20 23:36:42,668 INFO L87 Difference]: Start difference. First operand has 207 states, 160 states have (on average 1.50625) internal successors, (241), 206 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 207 states. [2022-02-20 23:36:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:42,670 INFO L93 Difference]: Finished difference Result 207 states and 241 transitions. [2022-02-20 23:36:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2022-02-20 23:36:42,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:42,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:42,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:42,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 160 states have (on average 1.50625) internal successors, (241), 206 states have internal predecessors, (241), 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:36:42,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2022-02-20 23:36:42,674 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 23 [2022-02-20 23:36:42,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:42,674 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2022-02-20 23:36:42,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:36:42,674 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2022-02-20 23:36:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:36:42,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:42,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:42,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:36:42,687 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:42,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:42,688 INFO L85 PathProgramCache]: Analyzing trace with hash 110847664, now seen corresponding path program 1 times [2022-02-20 23:36:42,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:42,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43419982] [2022-02-20 23:36:42,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:42,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:42,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {12368#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {12368#true} is VALID [2022-02-20 23:36:42,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {12368#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {12368#true} is VALID [2022-02-20 23:36:42,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {12368#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {12368#true} is VALID [2022-02-20 23:36:42,760 INFO L290 TraceCheckUtils]: 3: Hoare triple {12368#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {12368#true} is VALID [2022-02-20 23:36:42,761 INFO L290 TraceCheckUtils]: 4: Hoare triple {12368#true} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {12368#true} is VALID [2022-02-20 23:36:42,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {12368#true} goto; {12368#true} is VALID [2022-02-20 23:36:42,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {12368#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {12368#true} is VALID [2022-02-20 23:36:42,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {12368#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {12368#true} is VALID [2022-02-20 23:36:42,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {12368#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {12368#true} is VALID [2022-02-20 23:36:42,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {12368#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {12368#true} is VALID [2022-02-20 23:36:42,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {12368#true} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {12368#true} is VALID [2022-02-20 23:36:42,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {12368#true} assume !main_#t~short8#1; {12368#true} is VALID [2022-02-20 23:36:42,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {12368#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {12368#true} is VALID [2022-02-20 23:36:42,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {12368#true} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {12368#true} is VALID [2022-02-20 23:36:42,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {12368#true} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {12368#true} is VALID [2022-02-20 23:36:42,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {12368#true} goto; {12368#true} is VALID [2022-02-20 23:36:42,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {12368#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {12368#true} is VALID [2022-02-20 23:36:42,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {12368#true} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {12368#true} is VALID [2022-02-20 23:36:42,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {12368#true} assume !!(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(12); {12370#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) 12) (= |ULTIMATE.start_main_#t~malloc10#1.offset| 0))} is VALID [2022-02-20 23:36:42,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {12370#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) 12) (= |ULTIMATE.start_main_#t~malloc10#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1014 {12371#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:36:42,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {12371#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset; {12371#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:36:42,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {12371#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1015 {12372#(and (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem11#1.base|)) 0))} is VALID [2022-02-20 23:36:42,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {12372#(and (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem11#1.base|)) 0))} assume !(4 + (4 + main_#t~mem11#1.offset) <= #length[main_#t~mem11#1.base] && 0 <= 4 + main_#t~mem11#1.offset); {12369#false} is VALID [2022-02-20 23:36:42,767 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:36:42,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:42,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43419982] [2022-02-20 23:36:42,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43419982] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:42,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:42,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:42,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425818121] [2022-02-20 23:36:42,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:42,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2022-02-20 23:36:42,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:42,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:36:42,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:42,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:42,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:42,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:42,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:42,782 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:36:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,131 INFO L93 Difference]: Finished difference Result 206 states and 239 transitions. [2022-02-20 23:36:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:36:43,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2022-02-20 23:36:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:36:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2022-02-20 23:36:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:36:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2022-02-20 23:36:43,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 167 transitions. [2022-02-20 23:36:43,248 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:36:43,250 INFO L225 Difference]: With dead ends: 206 [2022-02-20 23:36:43,250 INFO L226 Difference]: Without dead ends: 206 [2022-02-20 23:36:43,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:36:43,250 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:43,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 456 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-02-20 23:36:43,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-02-20 23:36:43,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:43,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 206 states, 160 states have (on average 1.49375) internal successors, (239), 205 states have internal predecessors, (239), 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:36:43,253 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 206 states, 160 states have (on average 1.49375) internal successors, (239), 205 states have internal predecessors, (239), 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:36:43,253 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 206 states, 160 states have (on average 1.49375) internal successors, (239), 205 states have internal predecessors, (239), 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:36:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,255 INFO L93 Difference]: Finished difference Result 206 states and 239 transitions. [2022-02-20 23:36:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 239 transitions. [2022-02-20 23:36:43,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:43,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:43,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 160 states have (on average 1.49375) internal successors, (239), 205 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 206 states. [2022-02-20 23:36:43,256 INFO L87 Difference]: Start difference. First operand has 206 states, 160 states have (on average 1.49375) internal successors, (239), 205 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 206 states. [2022-02-20 23:36:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,258 INFO L93 Difference]: Finished difference Result 206 states and 239 transitions. [2022-02-20 23:36:43,258 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 239 transitions. [2022-02-20 23:36:43,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:43,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:43,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:43,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 160 states have (on average 1.49375) internal successors, (239), 205 states have internal predecessors, (239), 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:36:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 239 transitions. [2022-02-20 23:36:43,261 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 239 transitions. Word has length 23 [2022-02-20 23:36:43,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:43,261 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 239 transitions. [2022-02-20 23:36:43,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:36:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 239 transitions. [2022-02-20 23:36:43,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:36:43,262 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:43,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:43,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:36:43,262 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:43,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:43,262 INFO L85 PathProgramCache]: Analyzing trace with hash -398547279, now seen corresponding path program 1 times [2022-02-20 23:36:43,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:43,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440450208] [2022-02-20 23:36:43,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:43,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:43,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {13203#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {13203#true} is VALID [2022-02-20 23:36:43,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {13203#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {13203#true} is VALID [2022-02-20 23:36:43,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {13203#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,377 INFO L290 TraceCheckUtils]: 3: Hoare triple {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,377 INFO L290 TraceCheckUtils]: 4: Hoare triple {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} goto; {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !main_#t~short8#1; {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} goto; {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {13205#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {13206#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {13206#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {13206#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {13206#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !!(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(12); {13207#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~malloc10#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_#t~malloc10#1.base|)))} is VALID [2022-02-20 23:36:43,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {13207#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~malloc10#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_#t~malloc10#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1014 {13208#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:43,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {13208#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset; {13208#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:43,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {13208#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1015 {13209#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem11#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:43,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {13209#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem11#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); srcloc: L1015-1 {13210#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:43,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {13210#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {13210#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:43,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {13210#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1016 {13211#(= (select |#valid| |ULTIMATE.start_main_#t~mem12#1.base|) 1)} is VALID [2022-02-20 23:36:43,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {13211#(= (select |#valid| |ULTIMATE.start_main_#t~mem12#1.base|) 1)} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset; {13206#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {13206#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !(1 == #valid[main_~end~0#1.base]); {13204#false} is VALID [2022-02-20 23:36:43,386 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:36:43,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:43,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440450208] [2022-02-20 23:36:43,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440450208] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:43,386 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:43,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:36:43,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761758745] [2022-02-20 23:36:43,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:43,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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 27 [2022-02-20 23:36:43,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:43,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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:36:43,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:43,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:36:43,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:43,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:36:43,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:36:43,406 INFO L87 Difference]: Start difference. First operand 206 states and 239 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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:36:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:44,261 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2022-02-20 23:36:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:36:44,261 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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 27 [2022-02-20 23:36:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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:36:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2022-02-20 23:36:44,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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:36:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2022-02-20 23:36:44,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 172 transitions. [2022-02-20 23:36:44,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:44,347 INFO L225 Difference]: With dead ends: 206 [2022-02-20 23:36:44,348 INFO L226 Difference]: Without dead ends: 206 [2022-02-20 23:36:44,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:36:44,348 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 250 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:44,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 353 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:36:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-02-20 23:36:44,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2022-02-20 23:36:44,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:44,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 205 states, 160 states have (on average 1.4875) internal successors, (238), 204 states have internal predecessors, (238), 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:36:44,351 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 205 states, 160 states have (on average 1.4875) internal successors, (238), 204 states have internal predecessors, (238), 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:36:44,351 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 205 states, 160 states have (on average 1.4875) internal successors, (238), 204 states have internal predecessors, (238), 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:36:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:44,353 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2022-02-20 23:36:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 238 transitions. [2022-02-20 23:36:44,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:44,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:44,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 160 states have (on average 1.4875) internal successors, (238), 204 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 206 states. [2022-02-20 23:36:44,355 INFO L87 Difference]: Start difference. First operand has 205 states, 160 states have (on average 1.4875) internal successors, (238), 204 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 206 states. [2022-02-20 23:36:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:44,366 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2022-02-20 23:36:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 238 transitions. [2022-02-20 23:36:44,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:44,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:44,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:44,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 160 states have (on average 1.4875) internal successors, (238), 204 states have internal predecessors, (238), 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:36:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 238 transitions. [2022-02-20 23:36:44,368 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 238 transitions. Word has length 27 [2022-02-20 23:36:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:44,369 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 238 transitions. [2022-02-20 23:36:44,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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:36:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 238 transitions. [2022-02-20 23:36:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:36:44,370 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:44,370 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:44,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:36:44,371 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:44,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:44,371 INFO L85 PathProgramCache]: Analyzing trace with hash -398547278, now seen corresponding path program 1 times [2022-02-20 23:36:44,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:44,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785221827] [2022-02-20 23:36:44,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:44,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:44,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {14049#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {14049#true} is VALID [2022-02-20 23:36:44,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {14049#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {14049#true} is VALID [2022-02-20 23:36:44,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {14049#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} goto; {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !main_#t~short8#1; {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} goto; {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {14051#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {14052#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {14052#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {14052#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {14052#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !!(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(12); {14053#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~malloc10#1.base|)) (= (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) 12) (= |ULTIMATE.start_main_#t~malloc10#1.offset| 0))} is VALID [2022-02-20 23:36:44,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {14053#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~malloc10#1.base|)) (= (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) 12) (= |ULTIMATE.start_main_#t~malloc10#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1014 {14054#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:36:44,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {14054#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset; {14054#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:36:44,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {14054#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1015 {14055#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem11#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:36:44,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {14055#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem11#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); srcloc: L1015-1 {14056#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:36:44,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {14056#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {14056#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:36:44,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {14056#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1016 {14057#(and (= (select |#length| |ULTIMATE.start_main_#t~mem12#1.base|) 12) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} is VALID [2022-02-20 23:36:44,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {14057#(and (= (select |#length| |ULTIMATE.start_main_#t~mem12#1.base|) 12) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset; {14058#(and (= 0 (+ (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (- 12))) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:36:44,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {14058#(and (= 0 (+ (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (- 12))) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume !(4 + main_~end~0#1.offset <= #length[main_~end~0#1.base] && 0 <= main_~end~0#1.offset); {14050#false} is VALID [2022-02-20 23:36:44,596 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:36:44,596 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:44,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785221827] [2022-02-20 23:36:44,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785221827] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:44,596 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:44,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:36:44,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523309623] [2022-02-20 23:36:44,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:44,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 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 27 [2022-02-20 23:36:44,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:44,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 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:36:44,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:44,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:36:44,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:44,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:36:44,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:36:44,618 INFO L87 Difference]: Start difference. First operand 205 states and 238 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 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:36:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:45,811 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2022-02-20 23:36:45,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:36:45,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 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 27 [2022-02-20 23:36:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 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:36:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 182 transitions. [2022-02-20 23:36:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 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:36:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 182 transitions. [2022-02-20 23:36:45,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 182 transitions. [2022-02-20 23:36:45,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:45,918 INFO L225 Difference]: With dead ends: 198 [2022-02-20 23:36:45,918 INFO L226 Difference]: Without dead ends: 198 [2022-02-20 23:36:45,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:36:45,920 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 263 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:45,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 556 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:36:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-02-20 23:36:45,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2022-02-20 23:36:45,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:45,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 187 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 186 states have internal predecessors, (219), 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:36:45,924 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 187 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 186 states have internal predecessors, (219), 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:36:45,924 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 187 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 186 states have internal predecessors, (219), 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:36:45,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:45,927 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2022-02-20 23:36:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 230 transitions. [2022-02-20 23:36:45,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:45,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:45,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 186 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 198 states. [2022-02-20 23:36:45,928 INFO L87 Difference]: Start difference. First operand has 187 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 186 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 198 states. [2022-02-20 23:36:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:45,936 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2022-02-20 23:36:45,936 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 230 transitions. [2022-02-20 23:36:45,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:45,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:45,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:45,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 186 states have internal predecessors, (219), 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:36:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 219 transitions. [2022-02-20 23:36:45,939 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 219 transitions. Word has length 27 [2022-02-20 23:36:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:45,940 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 219 transitions. [2022-02-20 23:36:45,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 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:36:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 219 transitions. [2022-02-20 23:36:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:36:45,942 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:45,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:45,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:36:45,943 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:45,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:45,943 INFO L85 PathProgramCache]: Analyzing trace with hash 329779259, now seen corresponding path program 1 times [2022-02-20 23:36:45,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:45,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361736983] [2022-02-20 23:36:45,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:45,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:45,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {14868#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {14868#true} is VALID [2022-02-20 23:36:45,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {14868#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {14868#true} is VALID [2022-02-20 23:36:45,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {14868#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {14868#true} is VALID [2022-02-20 23:36:45,986 INFO L290 TraceCheckUtils]: 3: Hoare triple {14868#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {14868#true} is VALID [2022-02-20 23:36:45,986 INFO L290 TraceCheckUtils]: 4: Hoare triple {14868#true} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {14868#true} is VALID [2022-02-20 23:36:45,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {14868#true} goto; {14868#true} is VALID [2022-02-20 23:36:45,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {14868#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {14868#true} is VALID [2022-02-20 23:36:45,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {14868#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {14868#true} is VALID [2022-02-20 23:36:45,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {14868#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {14868#true} is VALID [2022-02-20 23:36:45,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {14868#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {14868#true} is VALID [2022-02-20 23:36:45,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {14868#true} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {14868#true} is VALID [2022-02-20 23:36:45,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {14868#true} assume !main_#t~short8#1; {14868#true} is VALID [2022-02-20 23:36:45,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {14868#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {14868#true} is VALID [2022-02-20 23:36:45,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {14868#true} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {14868#true} is VALID [2022-02-20 23:36:45,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {14868#true} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {14868#true} is VALID [2022-02-20 23:36:45,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {14868#true} goto; {14868#true} is VALID [2022-02-20 23:36:45,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {14868#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {14868#true} is VALID [2022-02-20 23:36:45,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {14868#true} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {14868#true} is VALID [2022-02-20 23:36:45,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {14868#true} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {14868#true} is VALID [2022-02-20 23:36:45,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {14868#true} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {14868#true} is VALID [2022-02-20 23:36:45,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {14868#true} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {14868#true} is VALID [2022-02-20 23:36:45,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {14868#true} goto; {14868#true} is VALID [2022-02-20 23:36:45,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {14868#true} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);main_~len~0#1 := 0; {14870#(= |ULTIMATE.start_main_~len~0#1| 0)} is VALID [2022-02-20 23:36:45,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {14870#(= |ULTIMATE.start_main_~len~0#1| 0)} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1031 {14870#(= |ULTIMATE.start_main_~len~0#1| 0)} is VALID [2022-02-20 23:36:45,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {14870#(= |ULTIMATE.start_main_~len~0#1| 0)} main_~inner~0#1.base, main_~inner~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {14870#(= |ULTIMATE.start_main_~len~0#1| 0)} is VALID [2022-02-20 23:36:45,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {14870#(= |ULTIMATE.start_main_~len~0#1| 0)} assume !(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {14870#(= |ULTIMATE.start_main_~len~0#1| 0)} is VALID [2022-02-20 23:36:45,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {14870#(= |ULTIMATE.start_main_~len~0#1| 0)} assume !(main_~len~0#1 <= 1); {14869#false} is VALID [2022-02-20 23:36:45,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {14869#false} assume !false; {14869#false} is VALID [2022-02-20 23:36:45,990 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:36:45,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:45,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361736983] [2022-02-20 23:36:45,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361736983] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:45,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:45,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:36:45,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930181101] [2022-02-20 23:36:45,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:45,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-02-20 23:36:45,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:45,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:36:46,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:46,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:46,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:46,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:46,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:46,009 INFO L87 Difference]: Start difference. First operand 187 states and 219 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:36:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:46,126 INFO L93 Difference]: Finished difference Result 260 states and 307 transitions. [2022-02-20 23:36:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:46,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-02-20 23:36:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:36:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2022-02-20 23:36:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:36:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2022-02-20 23:36:46,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 208 transitions. [2022-02-20 23:36:46,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:46,265 INFO L225 Difference]: With dead ends: 260 [2022-02-20 23:36:46,266 INFO L226 Difference]: Without dead ends: 260 [2022-02-20 23:36:46,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:46,266 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 50 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:46,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 299 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:36:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-02-20 23:36:46,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 193. [2022-02-20 23:36:46,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:46,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand has 193 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 192 states have internal predecessors, (227), 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:36:46,271 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand has 193 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 192 states have internal predecessors, (227), 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:36:46,272 INFO L87 Difference]: Start difference. First operand 260 states. Second operand has 193 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 192 states have internal predecessors, (227), 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:36:46,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:46,276 INFO L93 Difference]: Finished difference Result 260 states and 307 transitions. [2022-02-20 23:36:46,276 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 307 transitions. [2022-02-20 23:36:46,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:46,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:46,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 192 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 260 states. [2022-02-20 23:36:46,277 INFO L87 Difference]: Start difference. First operand has 193 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 192 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 260 states. [2022-02-20 23:36:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:46,281 INFO L93 Difference]: Finished difference Result 260 states and 307 transitions. [2022-02-20 23:36:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 307 transitions. [2022-02-20 23:36:46,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:46,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:46,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:46,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:46,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 192 states have internal predecessors, (227), 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:36:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 227 transitions. [2022-02-20 23:36:46,284 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 227 transitions. Word has length 28 [2022-02-20 23:36:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:46,284 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 227 transitions. [2022-02-20 23:36:46,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:36:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 227 transitions. [2022-02-20 23:36:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:36:46,285 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:46,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:46,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:36:46,286 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:46,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:46,286 INFO L85 PathProgramCache]: Analyzing trace with hash -751842895, now seen corresponding path program 1 times [2022-02-20 23:36:46,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:46,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190123860] [2022-02-20 23:36:46,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:46,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:46,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {15846#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {15848#(= (select |#valid| 0) 0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {15848#(= (select |#valid| 0) 0)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {15848#(= (select |#valid| 0) 0)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {15848#(= (select |#valid| 0) 0)} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {15848#(= (select |#valid| 0) 0)} goto; {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {15848#(= (select |#valid| 0) 0)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {15848#(= (select |#valid| 0) 0)} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {15848#(= (select |#valid| 0) 0)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {15848#(= (select |#valid| 0) 0)} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {15848#(= (select |#valid| 0) 0)} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {15848#(= (select |#valid| 0) 0)} assume !main_#t~short8#1; {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {15848#(= (select |#valid| 0) 0)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {15848#(= (select |#valid| 0) 0)} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {15848#(= (select |#valid| 0) 0)} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {15848#(= (select |#valid| 0) 0)} goto; {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {15848#(= (select |#valid| 0) 0)} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {15848#(= (select |#valid| 0) 0)} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {15848#(= (select |#valid| 0) 0)} assume !!(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(12); {15849#(and (not (= |ULTIMATE.start_main_#t~malloc10#1.base| 0)) (= (select |#valid| 0) 0))} is VALID [2022-02-20 23:36:46,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {15849#(and (not (= |ULTIMATE.start_main_#t~malloc10#1.base| 0)) (= (select |#valid| 0) 0))} SUMMARY for call write~$Pointer$(main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1014 {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {15848#(= (select |#valid| 0) 0)} havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset; {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {15848#(= (select |#valid| 0) 0)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1015 {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {15848#(= (select |#valid| 0) 0)} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); srcloc: L1015-1 {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {15848#(= (select |#valid| 0) 0)} havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {15848#(= (select |#valid| 0) 0)} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1016 {15848#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:46,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {15848#(= (select |#valid| 0) 0)} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset; {15850#(or (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 0) (not (= |ULTIMATE.start_main_~end~0#1.base| 0)))} is VALID [2022-02-20 23:36:46,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {15850#(or (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 0) (not (= |ULTIMATE.start_main_~end~0#1.base| 0)))} SUMMARY for call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1017 {15851#(not (= |ULTIMATE.start_main_~end~0#1.base| 0))} is VALID [2022-02-20 23:36:46,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {15851#(not (= |ULTIMATE.start_main_~end~0#1.base| 0))} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {15847#false} is VALID [2022-02-20 23:36:46,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {15847#false} assume !false; {15847#false} is VALID [2022-02-20 23:36:46,378 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:36:46,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:46,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190123860] [2022-02-20 23:36:46,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190123860] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:46,379 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:46,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:36:46,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215906407] [2022-02-20 23:36:46,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:46,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2022-02-20 23:36:46,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:46,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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:36:46,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:46,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:36:46,398 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:46,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:36:46,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:36:46,398 INFO L87 Difference]: Start difference. First operand 193 states and 227 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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:36:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:46,907 INFO L93 Difference]: Finished difference Result 193 states and 228 transitions. [2022-02-20 23:36:46,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:36:46,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2022-02-20 23:36:46,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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:36:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2022-02-20 23:36:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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:36:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2022-02-20 23:36:46,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 158 transitions. [2022-02-20 23:36:47,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:47,041 INFO L225 Difference]: With dead ends: 193 [2022-02-20 23:36:47,041 INFO L226 Difference]: Without dead ends: 193 [2022-02-20 23:36:47,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:36:47,042 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 348 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:47,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 226 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:47,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-02-20 23:36:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2022-02-20 23:36:47,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:47,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 189 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 188 states have internal predecessors, (223), 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:36:47,056 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 189 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 188 states have internal predecessors, (223), 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:36:47,056 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 189 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 188 states have internal predecessors, (223), 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:36:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:47,059 INFO L93 Difference]: Finished difference Result 193 states and 228 transitions. [2022-02-20 23:36:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 228 transitions. [2022-02-20 23:36:47,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:47,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:47,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 188 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 193 states. [2022-02-20 23:36:47,060 INFO L87 Difference]: Start difference. First operand has 189 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 188 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 193 states. [2022-02-20 23:36:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:47,063 INFO L93 Difference]: Finished difference Result 193 states and 228 transitions. [2022-02-20 23:36:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 228 transitions. [2022-02-20 23:36:47,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:47,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:47,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:47,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 188 states have internal predecessors, (223), 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:36:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 223 transitions. [2022-02-20 23:36:47,071 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 223 transitions. Word has length 29 [2022-02-20 23:36:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:47,072 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 223 transitions. [2022-02-20 23:36:47,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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:36:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 223 transitions. [2022-02-20 23:36:47,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:36:47,072 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:47,072 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:47,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:36:47,073 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:47,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:47,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1633211075, now seen corresponding path program 1 times [2022-02-20 23:36:47,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:47,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322628774] [2022-02-20 23:36:47,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:47,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:47,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {16626#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {16626#true} is VALID [2022-02-20 23:36:47,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {16626#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {16626#true} is VALID [2022-02-20 23:36:47,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {16626#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {16626#true} is VALID [2022-02-20 23:36:47,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {16626#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {16626#true} is VALID [2022-02-20 23:36:47,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {16626#true} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {16626#true} is VALID [2022-02-20 23:36:47,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {16626#true} goto; {16626#true} is VALID [2022-02-20 23:36:47,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {16626#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {16626#true} is VALID [2022-02-20 23:36:47,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {16626#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {16626#true} is VALID [2022-02-20 23:36:47,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {16626#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {16626#true} is VALID [2022-02-20 23:36:47,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {16626#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {16626#true} is VALID [2022-02-20 23:36:47,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {16626#true} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {16626#true} is VALID [2022-02-20 23:36:47,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {16626#true} assume !main_#t~short8#1; {16626#true} is VALID [2022-02-20 23:36:47,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {16626#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {16626#true} is VALID [2022-02-20 23:36:47,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {16626#true} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {16626#true} is VALID [2022-02-20 23:36:47,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {16626#true} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {16626#true} is VALID [2022-02-20 23:36:47,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {16626#true} goto; {16626#true} is VALID [2022-02-20 23:36:47,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {16626#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {16626#true} is VALID [2022-02-20 23:36:47,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {16626#true} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {16626#true} is VALID [2022-02-20 23:36:47,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {16626#true} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {16626#true} is VALID [2022-02-20 23:36:47,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {16626#true} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {16626#true} is VALID [2022-02-20 23:36:47,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {16626#true} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {16626#true} is VALID [2022-02-20 23:36:47,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {16626#true} goto; {16626#true} is VALID [2022-02-20 23:36:47,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {16626#true} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);main_~len~0#1 := 0; {16626#true} is VALID [2022-02-20 23:36:47,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {16626#true} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1031 {16626#true} is VALID [2022-02-20 23:36:47,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {16626#true} main_~inner~0#1.base, main_~inner~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {16626#true} is VALID [2022-02-20 23:36:47,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {16626#true} assume !!(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {16628#(or (not (= |ULTIMATE.start_main_~inner~0#1.offset| 0)) (not (= |ULTIMATE.start_main_~inner~0#1.base| 0)))} is VALID [2022-02-20 23:36:47,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {16628#(or (not (= |ULTIMATE.start_main_~inner~0#1.offset| 0)) (not (= |ULTIMATE.start_main_~inner~0#1.base| 0)))} assume 0 == main_~len~0#1;main_~len~0#1 := 1; {16628#(or (not (= |ULTIMATE.start_main_~inner~0#1.offset| 0)) (not (= |ULTIMATE.start_main_~inner~0#1.base| 0)))} is VALID [2022-02-20 23:36:47,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {16628#(or (not (= |ULTIMATE.start_main_~inner~0#1.offset| 0)) (not (= |ULTIMATE.start_main_~inner~0#1.base| 0)))} assume !(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {16627#false} is VALID [2022-02-20 23:36:47,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {16627#false} assume !false; {16627#false} is VALID [2022-02-20 23:36:47,131 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:36:47,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:47,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322628774] [2022-02-20 23:36:47,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322628774] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:47,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:47,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:36:47,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565755033] [2022-02-20 23:36:47,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:47,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2022-02-20 23:36:47,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:47,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:36:47,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:47,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:47,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:47,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:47,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:47,161 INFO L87 Difference]: Start difference. First operand 189 states and 223 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:36:47,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:47,281 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2022-02-20 23:36:47,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:47,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2022-02-20 23:36:47,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:36:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-20 23:36:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:36:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-20 23:36:47,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2022-02-20 23:36:47,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:47,372 INFO L225 Difference]: With dead ends: 187 [2022-02-20 23:36:47,372 INFO L226 Difference]: Without dead ends: 187 [2022-02-20 23:36:47,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:47,373 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 20 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:47,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 262 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:36:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-02-20 23:36:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-02-20 23:36:47,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:47,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 187 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 186 states have internal predecessors, (220), 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:36:47,375 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 187 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 186 states have internal predecessors, (220), 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:36:47,376 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 187 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 186 states have internal predecessors, (220), 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:36:47,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:47,377 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2022-02-20 23:36:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 220 transitions. [2022-02-20 23:36:47,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:47,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:47,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 186 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 187 states. [2022-02-20 23:36:47,378 INFO L87 Difference]: Start difference. First operand has 187 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 186 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 187 states. [2022-02-20 23:36:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:47,380 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2022-02-20 23:36:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 220 transitions. [2022-02-20 23:36:47,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:47,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:47,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:47,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 186 states have internal predecessors, (220), 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:36:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 220 transitions. [2022-02-20 23:36:47,382 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 220 transitions. Word has length 29 [2022-02-20 23:36:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:47,382 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 220 transitions. [2022-02-20 23:36:47,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:36:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 220 transitions. [2022-02-20 23:36:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:36:47,383 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:47,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:47,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 23:36:47,383 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:47,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:47,384 INFO L85 PathProgramCache]: Analyzing trace with hash -910059888, now seen corresponding path program 1 times [2022-02-20 23:36:47,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:47,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650445082] [2022-02-20 23:36:47,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:47,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:47,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {17379#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {17379#true} is VALID [2022-02-20 23:36:47,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {17379#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} is VALID [2022-02-20 23:36:47,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} is VALID [2022-02-20 23:36:47,488 INFO L290 TraceCheckUtils]: 3: Hoare triple {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} is VALID [2022-02-20 23:36:47,489 INFO L290 TraceCheckUtils]: 4: Hoare triple {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} is VALID [2022-02-20 23:36:47,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} goto; {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} is VALID [2022-02-20 23:36:47,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} is VALID [2022-02-20 23:36:47,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} is VALID [2022-02-20 23:36:47,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} is VALID [2022-02-20 23:36:47,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {17381#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {17382#(and (= |ULTIMATE.start_main_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) |ULTIMATE.start_main_#t~mem6#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:47,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {17382#(and (= |ULTIMATE.start_main_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) |ULTIMATE.start_main_#t~mem6#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {17383#(and (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) |ULTIMATE.start_main_#t~short8#1|))} is VALID [2022-02-20 23:36:47,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {17383#(and (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) |ULTIMATE.start_main_#t~short8#1|))} assume !main_#t~short8#1; {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:47,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:47,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:47,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:47,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} goto; {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:47,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:47,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:47,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:47,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {17384#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {17385#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:36:47,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {17385#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {17385#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:36:47,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {17385#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} goto; {17385#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:36:47,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {17385#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);main_~len~0#1 := 0; {17385#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:36:47,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {17385#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1031 {17386#(and (= |ULTIMATE.start_main_#t~mem20#1.base| 0) (= |ULTIMATE.start_main_#t~mem20#1.offset| 0))} is VALID [2022-02-20 23:36:47,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {17386#(and (= |ULTIMATE.start_main_#t~mem20#1.base| 0) (= |ULTIMATE.start_main_#t~mem20#1.offset| 0))} main_~inner~0#1.base, main_~inner~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {17387#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= |ULTIMATE.start_main_~inner~0#1.base| 0))} is VALID [2022-02-20 23:36:47,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {17387#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= |ULTIMATE.start_main_~inner~0#1.base| 0))} assume !!(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {17380#false} is VALID [2022-02-20 23:36:47,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {17380#false} assume 0 == main_~len~0#1;main_~len~0#1 := 1; {17380#false} is VALID [2022-02-20 23:36:47,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {17380#false} assume !!(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {17380#false} is VALID [2022-02-20 23:36:47,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {17380#false} goto; {17380#false} is VALID [2022-02-20 23:36:47,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {17380#false} assume !(1 == #valid[main_~inner~0#1.base]); {17380#false} is VALID [2022-02-20 23:36:47,499 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:36:47,500 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:47,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650445082] [2022-02-20 23:36:47,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650445082] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:47,500 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:47,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:36:47,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181260042] [2022-02-20 23:36:47,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:47,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 30 [2022-02-20 23:36:47,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:47,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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:36:47,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:47,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:36:47,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:47,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:36:47,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:36:47,525 INFO L87 Difference]: Start difference. First operand 187 states and 220 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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:36:48,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:48,474 INFO L93 Difference]: Finished difference Result 290 states and 320 transitions. [2022-02-20 23:36:48,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:36:48,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 30 [2022-02-20 23:36:48,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:48,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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:36:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 279 transitions. [2022-02-20 23:36:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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:36:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 279 transitions. [2022-02-20 23:36:48,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 279 transitions. [2022-02-20 23:36:48,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:48,609 INFO L225 Difference]: With dead ends: 290 [2022-02-20 23:36:48,610 INFO L226 Difference]: Without dead ends: 290 [2022-02-20 23:36:48,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:36:48,610 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 451 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:48,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 706 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:36:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-02-20 23:36:48,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 199. [2022-02-20 23:36:48,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:48,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 290 states. Second operand has 199 states, 167 states have (on average 1.3952095808383234) internal successors, (233), 198 states have internal predecessors, (233), 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:36:48,613 INFO L74 IsIncluded]: Start isIncluded. First operand 290 states. Second operand has 199 states, 167 states have (on average 1.3952095808383234) internal successors, (233), 198 states have internal predecessors, (233), 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:36:48,614 INFO L87 Difference]: Start difference. First operand 290 states. Second operand has 199 states, 167 states have (on average 1.3952095808383234) internal successors, (233), 198 states have internal predecessors, (233), 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:36:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:48,617 INFO L93 Difference]: Finished difference Result 290 states and 320 transitions. [2022-02-20 23:36:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 320 transitions. [2022-02-20 23:36:48,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:48,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:48,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 167 states have (on average 1.3952095808383234) internal successors, (233), 198 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 290 states. [2022-02-20 23:36:48,618 INFO L87 Difference]: Start difference. First operand has 199 states, 167 states have (on average 1.3952095808383234) internal successors, (233), 198 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 290 states. [2022-02-20 23:36:48,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:48,621 INFO L93 Difference]: Finished difference Result 290 states and 320 transitions. [2022-02-20 23:36:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 320 transitions. [2022-02-20 23:36:48,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:48,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:48,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:48,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 167 states have (on average 1.3952095808383234) internal successors, (233), 198 states have internal predecessors, (233), 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:36:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2022-02-20 23:36:48,624 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 30 [2022-02-20 23:36:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:48,624 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2022-02-20 23:36:48,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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:36:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2022-02-20 23:36:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:36:48,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:48,625 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:48,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 23:36:48,625 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:48,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:48,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2071508259, now seen corresponding path program 1 times [2022-02-20 23:36:48,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:48,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145434575] [2022-02-20 23:36:48,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:48,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {18473#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {18473#true} is VALID [2022-02-20 23:36:48,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {18473#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {18473#true} is VALID [2022-02-20 23:36:48,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {18473#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} goto; {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} assume !main_#t~short8#1; {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} goto; {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {18475#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} goto; {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);main_~len~0#1 := 0; {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1031 {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} main_~inner~0#1.base, main_~inner~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} assume !(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} assume !!(main_~len~0#1 <= 1); {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} goto; {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:36:48,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {18476#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1043-4 {18477#(and (= |ULTIMATE.start_main_#t~mem24#1.base| 0) (= |ULTIMATE.start_main_#t~mem24#1.offset| 0))} is VALID [2022-02-20 23:36:48,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {18477#(and (= |ULTIMATE.start_main_#t~mem24#1.base| 0) (= |ULTIMATE.start_main_#t~mem24#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {18478#(and (= |ULTIMATE.start_main_~end~0#1.base| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:36:48,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {18478#(and (= |ULTIMATE.start_main_~end~0#1.base| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);main_~len~0#1 := 0; {18474#false} is VALID [2022-02-20 23:36:48,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {18474#false} assume !(1 == #valid[main_~end~0#1.base]); {18474#false} is VALID [2022-02-20 23:36:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:48,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:48,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145434575] [2022-02-20 23:36:48,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145434575] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:36:48,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128971396] [2022-02-20 23:36:48,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:48,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:36:48,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:36:48,728 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:36:48,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:36:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:48,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 23:36:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:48,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:36:48,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:36:48,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:36:48,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:36:48,963 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 21 treesize of output 20 [2022-02-20 23:36:48,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:36:48,971 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 21 treesize of output 20 [2022-02-20 23:36:49,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:36:49,078 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 21 treesize of output 20 [2022-02-20 23:36:49,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:36:49,099 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 21 treesize of output 20 [2022-02-20 23:36:49,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:36:49,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:36:49,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:36:49,453 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:36:49,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-02-20 23:36:49,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {18473#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {18473#true} is VALID [2022-02-20 23:36:49,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {18473#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {18485#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} is VALID [2022-02-20 23:36:49,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {18485#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,476 INFO L290 TraceCheckUtils]: 3: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,477 INFO L290 TraceCheckUtils]: 4: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} goto; {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !main_#t~short8#1; {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} goto; {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {18489#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} is VALID [2022-02-20 23:36:49,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} is VALID [2022-02-20 23:36:49,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} goto; {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} is VALID [2022-02-20 23:36:49,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);main_~len~0#1 := 0; {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} is VALID [2022-02-20 23:36:49,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1031 {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} is VALID [2022-02-20 23:36:49,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} main_~inner~0#1.base, main_~inner~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} is VALID [2022-02-20 23:36:49,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} assume !(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} is VALID [2022-02-20 23:36:49,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} assume !!(main_~len~0#1 <= 1); {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} is VALID [2022-02-20 23:36:49,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} goto; {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} is VALID [2022-02-20 23:36:49,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {18541#(and (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) 0) 0))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1043-4 {18477#(and (= |ULTIMATE.start_main_#t~mem24#1.base| 0) (= |ULTIMATE.start_main_#t~mem24#1.offset| 0))} is VALID [2022-02-20 23:36:49,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {18477#(and (= |ULTIMATE.start_main_#t~mem24#1.base| 0) (= |ULTIMATE.start_main_#t~mem24#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {18478#(and (= |ULTIMATE.start_main_~end~0#1.base| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:36:49,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {18478#(and (= |ULTIMATE.start_main_~end~0#1.base| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);main_~len~0#1 := 0; {18474#false} is VALID [2022-02-20 23:36:49,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {18474#false} assume !(1 == #valid[main_~end~0#1.base]); {18474#false} is VALID [2022-02-20 23:36:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:49,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:36:51,638 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 19 [2022-02-20 23:36:51,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-02-20 23:36:51,679 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 23 treesize of output 21 [2022-02-20 23:36:51,708 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 22 treesize of output 20 [2022-02-20 23:36:51,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {18474#false} assume !(1 == #valid[main_~end~0#1.base]); {18474#false} is VALID [2022-02-20 23:36:51,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {18478#(and (= |ULTIMATE.start_main_~end~0#1.base| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);main_~len~0#1 := 0; {18474#false} is VALID [2022-02-20 23:36:51,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {18477#(and (= |ULTIMATE.start_main_#t~mem24#1.base| 0) (= |ULTIMATE.start_main_#t~mem24#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {18478#(and (= |ULTIMATE.start_main_~end~0#1.base| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:36:51,803 INFO L290 TraceCheckUtils]: 28: Hoare triple {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1043-4 {18477#(and (= |ULTIMATE.start_main_#t~mem24#1.base| 0) (= |ULTIMATE.start_main_#t~mem24#1.offset| 0))} is VALID [2022-02-20 23:36:51,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:36:51,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(main_~len~0#1 <= 1); {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:36:51,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:36:51,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} main_~inner~0#1.base, main_~inner~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:36:51,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1031 {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:36:51,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);main_~len~0#1 := 0; {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:36:51,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:36:51,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:36:51,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {18587#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:36:51,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} goto; {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} assume !main_#t~short8#1; {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} goto; {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,823 INFO L290 TraceCheckUtils]: 4: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {18667#(<= |ULTIMATE.start_main_~list~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {18615#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_56| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56|) 0))))} is VALID [2022-02-20 23:36:51,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {18473#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {18667#(<= |ULTIMATE.start_main_~list~0#1.offset| 0)} is VALID [2022-02-20 23:36:51,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {18473#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {18473#true} is VALID [2022-02-20 23:36:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:51,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128971396] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:36:51,827 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:36:51,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-02-20 23:36:51,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712317712] [2022-02-20 23:36:51,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:36:51,828 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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 32 [2022-02-20 23:36:51,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:51,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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:36:51,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:51,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:36:51,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:51,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:36:51,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:36:51,914 INFO L87 Difference]: Start difference. First operand 199 states and 233 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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:36:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:53,038 INFO L93 Difference]: Finished difference Result 286 states and 316 transitions. [2022-02-20 23:36:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:36:53,039 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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 32 [2022-02-20 23:36:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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:36:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 256 transitions. [2022-02-20 23:36:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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:36:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 256 transitions. [2022-02-20 23:36:53,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 256 transitions. [2022-02-20 23:36:53,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:53,233 INFO L225 Difference]: With dead ends: 286 [2022-02-20 23:36:53,233 INFO L226 Difference]: Without dead ends: 286 [2022-02-20 23:36:53,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:36:53,233 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 375 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:53,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 863 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 409 Invalid, 0 Unknown, 40 Unchecked, 0.3s Time] [2022-02-20 23:36:53,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-02-20 23:36:53,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 227. [2022-02-20 23:36:53,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:53,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand has 227 states, 195 states have (on average 1.405128205128205) internal successors, (274), 226 states have internal predecessors, (274), 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:36:53,240 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand has 227 states, 195 states have (on average 1.405128205128205) internal successors, (274), 226 states have internal predecessors, (274), 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:36:53,240 INFO L87 Difference]: Start difference. First operand 286 states. Second operand has 227 states, 195 states have (on average 1.405128205128205) internal successors, (274), 226 states have internal predecessors, (274), 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:36:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:53,243 INFO L93 Difference]: Finished difference Result 286 states and 316 transitions. [2022-02-20 23:36:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 316 transitions. [2022-02-20 23:36:53,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:53,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:53,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 227 states, 195 states have (on average 1.405128205128205) internal successors, (274), 226 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 286 states. [2022-02-20 23:36:53,244 INFO L87 Difference]: Start difference. First operand has 227 states, 195 states have (on average 1.405128205128205) internal successors, (274), 226 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 286 states. [2022-02-20 23:36:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:53,263 INFO L93 Difference]: Finished difference Result 286 states and 316 transitions. [2022-02-20 23:36:53,263 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 316 transitions. [2022-02-20 23:36:53,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:53,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:53,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:53,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 195 states have (on average 1.405128205128205) internal successors, (274), 226 states have internal predecessors, (274), 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:36:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 274 transitions. [2022-02-20 23:36:53,266 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 274 transitions. Word has length 32 [2022-02-20 23:36:53,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:53,267 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 274 transitions. [2022-02-20 23:36:53,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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:36:53,267 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 274 transitions. [2022-02-20 23:36:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:36:53,267 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:53,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:53,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:36:53,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-02-20 23:36:53,485 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:53,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:53,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921825, now seen corresponding path program 1 times [2022-02-20 23:36:53,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:53,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912140933] [2022-02-20 23:36:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:53,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:53,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {19768#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {19768#true} is VALID [2022-02-20 23:36:53,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {19768#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {19768#true} is VALID [2022-02-20 23:36:53,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {19768#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {19770#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:53,657 INFO L290 TraceCheckUtils]: 3: Hoare triple {19770#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {19770#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:53,658 INFO L290 TraceCheckUtils]: 4: Hoare triple {19770#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {19770#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:53,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {19770#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} goto; {19770#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:53,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {19770#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {19770#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:36:53,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {19770#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {19771#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:36:53,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {19771#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-8 {19772#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1))} is VALID [2022-02-20 23:36:53,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {19772#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {19772#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1))} is VALID [2022-02-20 23:36:53,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {19772#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-10 {19773#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))))} is VALID [2022-02-20 23:36:53,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {19773#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem4#1.base, main_#t~mem4#1.offset, 4); srcloc: L1006-11 {19772#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1))} is VALID [2022-02-20 23:36:53,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {19772#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {19772#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1))} is VALID [2022-02-20 23:36:53,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {19772#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-13 {19774#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} is VALID [2022-02-20 23:36:53,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {19774#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem5#1.base, 8 + main_#t~mem5#1.offset, 4); srcloc: L1006-14 {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} is VALID [2022-02-20 23:36:53,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} is VALID [2022-02-20 23:36:53,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} is VALID [2022-02-20 23:36:53,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} is VALID [2022-02-20 23:36:53,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} assume main_#t~short8#1; {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} is VALID [2022-02-20 23:36:53,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} is VALID [2022-02-20 23:36:53,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} goto; {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} is VALID [2022-02-20 23:36:53,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} is VALID [2022-02-20 23:36:53,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} is VALID [2022-02-20 23:36:53,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} is VALID [2022-02-20 23:36:53,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {19775#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 1)} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {19776#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 1)} is VALID [2022-02-20 23:36:53,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {19776#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 1)} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {19776#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 1)} is VALID [2022-02-20 23:36:53,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {19776#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 1)} goto; {19776#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 1)} is VALID [2022-02-20 23:36:53,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {19776#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 1)} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);main_~len~0#1 := 0; {19776#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 1)} is VALID [2022-02-20 23:36:53,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {19776#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 1)} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1031 {19777#(= (select |#valid| |ULTIMATE.start_main_#t~mem20#1.base|) 1)} is VALID [2022-02-20 23:36:53,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {19777#(= (select |#valid| |ULTIMATE.start_main_#t~mem20#1.base|) 1)} main_~inner~0#1.base, main_~inner~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {19778#(= (select |#valid| |ULTIMATE.start_main_~inner~0#1.base|) 1)} is VALID [2022-02-20 23:36:53,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {19778#(= (select |#valid| |ULTIMATE.start_main_~inner~0#1.base|) 1)} assume !!(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {19778#(= (select |#valid| |ULTIMATE.start_main_~inner~0#1.base|) 1)} is VALID [2022-02-20 23:36:53,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {19778#(= (select |#valid| |ULTIMATE.start_main_~inner~0#1.base|) 1)} assume 0 == main_~len~0#1;main_~len~0#1 := 1; {19778#(= (select |#valid| |ULTIMATE.start_main_~inner~0#1.base|) 1)} is VALID [2022-02-20 23:36:53,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {19778#(= (select |#valid| |ULTIMATE.start_main_~inner~0#1.base|) 1)} assume !!(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {19778#(= (select |#valid| |ULTIMATE.start_main_~inner~0#1.base|) 1)} is VALID [2022-02-20 23:36:53,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {19778#(= (select |#valid| |ULTIMATE.start_main_~inner~0#1.base|) 1)} goto; {19778#(= (select |#valid| |ULTIMATE.start_main_~inner~0#1.base|) 1)} is VALID [2022-02-20 23:36:53,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {19778#(= (select |#valid| |ULTIMATE.start_main_~inner~0#1.base|) 1)} assume !(1 == #valid[main_~inner~0#1.base]); {19769#false} is VALID [2022-02-20 23:36:53,689 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:36:53,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:53,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912140933] [2022-02-20 23:36:53,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912140933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:53,690 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:53,690 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:36:53,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752555090] [2022-02-20 23:36:53,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:53,690 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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 35 [2022-02-20 23:36:53,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:53,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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:36:53,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:53,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:36:53,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:53,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:36:53,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:36:53,720 INFO L87 Difference]: Start difference. First operand 227 states and 274 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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:36:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:55,310 INFO L93 Difference]: Finished difference Result 334 states and 372 transitions. [2022-02-20 23:36:55,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:36:55,310 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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 35 [2022-02-20 23:36:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:55,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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:36:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 287 transitions. [2022-02-20 23:36:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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:36:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 287 transitions. [2022-02-20 23:36:55,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 287 transitions. [2022-02-20 23:36:55,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:55,533 INFO L225 Difference]: With dead ends: 334 [2022-02-20 23:36:55,533 INFO L226 Difference]: Without dead ends: 334 [2022-02-20 23:36:55,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:36:55,534 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 387 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:55,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 919 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:36:55,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-02-20 23:36:55,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 228. [2022-02-20 23:36:55,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:55,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 334 states. Second operand has 228 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 227 states have internal predecessors, (272), 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:36:55,537 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand has 228 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 227 states have internal predecessors, (272), 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:36:55,538 INFO L87 Difference]: Start difference. First operand 334 states. Second operand has 228 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 227 states have internal predecessors, (272), 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:36:55,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:55,541 INFO L93 Difference]: Finished difference Result 334 states and 372 transitions. [2022-02-20 23:36:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 372 transitions. [2022-02-20 23:36:55,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:55,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:55,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 227 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 334 states. [2022-02-20 23:36:55,542 INFO L87 Difference]: Start difference. First operand has 228 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 227 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 334 states. [2022-02-20 23:36:55,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:55,559 INFO L93 Difference]: Finished difference Result 334 states and 372 transitions. [2022-02-20 23:36:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 372 transitions. [2022-02-20 23:36:55,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:55,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:55,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:55,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 227 states have internal predecessors, (272), 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:36:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 272 transitions. [2022-02-20 23:36:55,562 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 272 transitions. Word has length 35 [2022-02-20 23:36:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:55,562 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 272 transitions. [2022-02-20 23:36:55,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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:36:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 272 transitions. [2022-02-20 23:36:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:36:55,563 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:55,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:55,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 23:36:55,563 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:55,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921826, now seen corresponding path program 1 times [2022-02-20 23:36:55,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:55,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14030035] [2022-02-20 23:36:55,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:55,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {21033#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {21033#true} is VALID [2022-02-20 23:36:55,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {21033#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {21035#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} is VALID [2022-02-20 23:36:55,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {21035#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {21036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:55,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {21036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {21036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:55,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {21036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {21036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:55,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {21036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} goto; {21036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:55,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {21036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {21036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:55,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {21036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {21037#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} is VALID [2022-02-20 23:36:55,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {21037#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-8 {21038#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:55,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {21038#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {21038#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:55,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {21038#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-10 {21039#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))))} is VALID [2022-02-20 23:36:55,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {21039#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem4#1.base, main_#t~mem4#1.offset, 4); srcloc: L1006-11 {21038#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:55,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {21038#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {21038#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:55,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {21038#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-13 {21040#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} is VALID [2022-02-20 23:36:55,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {21040#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem5#1.base, 8 + main_#t~mem5#1.offset, 4); srcloc: L1006-14 {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:55,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:55,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:55,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:55,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} assume main_#t~short8#1; {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:55,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:55,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} goto; {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:55,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:55,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:55,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} is VALID [2022-02-20 23:36:55,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {21041#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) 12))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {21042#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 12))} is VALID [2022-02-20 23:36:55,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {21042#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 12))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {21042#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 12))} is VALID [2022-02-20 23:36:55,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {21042#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 12))} goto; {21042#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 12))} is VALID [2022-02-20 23:36:55,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {21042#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 12))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);main_~len~0#1 := 0; {21042#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 12))} is VALID [2022-02-20 23:36:55,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {21042#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 12))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1031 {21043#(and (= 12 (select |#length| |ULTIMATE.start_main_#t~mem20#1.base|)) (= |ULTIMATE.start_main_#t~mem20#1.offset| 0))} is VALID [2022-02-20 23:36:55,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {21043#(and (= 12 (select |#length| |ULTIMATE.start_main_#t~mem20#1.base|)) (= |ULTIMATE.start_main_#t~mem20#1.offset| 0))} main_~inner~0#1.base, main_~inner~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {21044#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~inner~0#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:36:55,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {21044#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~inner~0#1.base|) (- 12)) 0))} assume !!(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {21044#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~inner~0#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:36:55,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {21044#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~inner~0#1.base|) (- 12)) 0))} assume 0 == main_~len~0#1;main_~len~0#1 := 1; {21044#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~inner~0#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:36:55,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {21044#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~inner~0#1.base|) (- 12)) 0))} assume !!(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {21044#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~inner~0#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:36:55,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {21044#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~inner~0#1.base|) (- 12)) 0))} goto; {21044#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~inner~0#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:36:55,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {21044#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~inner~0#1.base|) (- 12)) 0))} assume !(4 + (8 + main_~inner~0#1.offset) <= #length[main_~inner~0#1.base] && 0 <= 8 + main_~inner~0#1.offset); {21034#false} is VALID [2022-02-20 23:36:55,779 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:36:55,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:55,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14030035] [2022-02-20 23:36:55,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14030035] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:55,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:55,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:36:55,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637244172] [2022-02-20 23:36:55,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:55,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 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 35 [2022-02-20 23:36:55,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:55,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 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:36:55,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:55,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:36:55,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:55,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:36:55,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:36:55,804 INFO L87 Difference]: Start difference. First operand 228 states and 272 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 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:36:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:57,748 INFO L93 Difference]: Finished difference Result 400 states and 432 transitions. [2022-02-20 23:36:57,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 23:36:57,748 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 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 35 [2022-02-20 23:36:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 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:36:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 368 transitions. [2022-02-20 23:36:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 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:36:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 368 transitions. [2022-02-20 23:36:57,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 368 transitions. [2022-02-20 23:36:58,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 368 edges. 368 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:58,065 INFO L225 Difference]: With dead ends: 400 [2022-02-20 23:36:58,065 INFO L226 Difference]: Without dead ends: 400 [2022-02-20 23:36:58,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:36:58,065 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 580 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:58,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [580 Valid, 926 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:36:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-02-20 23:36:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 234. [2022-02-20 23:36:58,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:58,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 400 states. Second operand has 234 states, 204 states have (on average 1.3676470588235294) internal successors, (279), 233 states have internal predecessors, (279), 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:36:58,069 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand has 234 states, 204 states have (on average 1.3676470588235294) internal successors, (279), 233 states have internal predecessors, (279), 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:36:58,069 INFO L87 Difference]: Start difference. First operand 400 states. Second operand has 234 states, 204 states have (on average 1.3676470588235294) internal successors, (279), 233 states have internal predecessors, (279), 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:36:58,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:58,075 INFO L93 Difference]: Finished difference Result 400 states and 432 transitions. [2022-02-20 23:36:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 432 transitions. [2022-02-20 23:36:58,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:58,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:58,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 204 states have (on average 1.3676470588235294) internal successors, (279), 233 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 400 states. [2022-02-20 23:36:58,076 INFO L87 Difference]: Start difference. First operand has 234 states, 204 states have (on average 1.3676470588235294) internal successors, (279), 233 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 400 states. [2022-02-20 23:36:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:58,081 INFO L93 Difference]: Finished difference Result 400 states and 432 transitions. [2022-02-20 23:36:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 432 transitions. [2022-02-20 23:36:58,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:58,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:58,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:58,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.3676470588235294) internal successors, (279), 233 states have internal predecessors, (279), 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:36:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2022-02-20 23:36:58,085 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 35 [2022-02-20 23:36:58,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:58,085 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2022-02-20 23:36:58,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 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:36:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2022-02-20 23:36:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 23:36:58,086 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:58,086 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:58,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-20 23:36:58,086 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:36:58,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash -470914463, now seen corresponding path program 1 times [2022-02-20 23:36:58,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:58,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379813623] [2022-02-20 23:36:58,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:58,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:58,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {22505#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {22505#true} is VALID [2022-02-20 23:36:58,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {22505#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {22507#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} is VALID [2022-02-20 23:36:58,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {22507#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {22508#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:58,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {22508#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {22508#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:58,340 INFO L290 TraceCheckUtils]: 4: Hoare triple {22508#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {22508#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:58,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {22508#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} goto; {22508#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:58,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {22508#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {22508#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:58,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {22508#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {22509#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:58,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {22509#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-8 {22510#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:58,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {22510#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {22510#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:58,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {22510#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-10 {22511#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))))} is VALID [2022-02-20 23:36:58,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {22511#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem4#1.base, main_#t~mem4#1.offset, 4); srcloc: L1006-11 {22510#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:58,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {22510#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {22510#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:36:58,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {22510#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-13 {22512#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} is VALID [2022-02-20 23:36:58,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {22512#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem5#1.base, 8 + main_#t~mem5#1.offset, 4); srcloc: L1006-14 {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} is VALID [2022-02-20 23:36:58,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} is VALID [2022-02-20 23:36:58,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} is VALID [2022-02-20 23:36:58,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} is VALID [2022-02-20 23:36:58,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} assume main_#t~short8#1; {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} is VALID [2022-02-20 23:36:58,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} is VALID [2022-02-20 23:36:58,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} goto; {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} is VALID [2022-02-20 23:36:58,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} is VALID [2022-02-20 23:36:58,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} is VALID [2022-02-20 23:36:58,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} is VALID [2022-02-20 23:36:58,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {22513#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {22514#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0))))} is VALID [2022-02-20 23:36:58,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {22514#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0))))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {22514#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0))))} is VALID [2022-02-20 23:36:58,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {22514#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0))))} goto; {22514#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0))))} is VALID [2022-02-20 23:36:58,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {22514#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0))))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);main_~len~0#1 := 0; {22514#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0))))} is VALID [2022-02-20 23:36:58,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {22514#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 8) 0))))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1031 {22515#(and (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem20#1.base|) 8) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem20#1.base|) 8) 0)) (= |ULTIMATE.start_main_#t~mem20#1.base| 0)) (= |ULTIMATE.start_main_#t~mem20#1.offset| 0))} is VALID [2022-02-20 23:36:58,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {22515#(and (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem20#1.base|) 8) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem20#1.base|) 8) 0)) (= |ULTIMATE.start_main_#t~mem20#1.base| 0)) (= |ULTIMATE.start_main_#t~mem20#1.offset| 0))} main_~inner~0#1.base, main_~inner~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {22516#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0)) (= |ULTIMATE.start_main_~inner~0#1.base| 0)))} is VALID [2022-02-20 23:36:58,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {22516#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0)) (= |ULTIMATE.start_main_~inner~0#1.base| 0)))} assume !!(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {22517#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:36:58,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {22517#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0))} assume 0 == main_~len~0#1;main_~len~0#1 := 1; {22517#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:36:58,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {22517#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0))} assume !!(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {22517#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:36:58,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {22517#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0))} goto; {22517#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:36:58,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {22517#(and (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 8)) 0))} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~inner~0#1.base, 8 + main_~inner~0#1.offset, 4); srcloc: L1039-4 {22518#(and (= |ULTIMATE.start_main_#t~mem21#1.base| 0) (= |ULTIMATE.start_main_#t~mem21#1.offset| 0))} is VALID [2022-02-20 23:36:58,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {22518#(and (= |ULTIMATE.start_main_#t~mem21#1.base| 0) (= |ULTIMATE.start_main_#t~mem21#1.offset| 0))} assume !(0 == main_#t~mem21#1.base && 0 == main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset; {22506#false} is VALID [2022-02-20 23:36:58,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {22506#false} assume !false; {22506#false} is VALID [2022-02-20 23:36:58,358 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:36:58,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:58,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379813623] [2022-02-20 23:36:58,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379813623] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:58,359 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:58,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-20 23:36:58,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183766021] [2022-02-20 23:36:58,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:58,359 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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 37 [2022-02-20 23:36:58,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:58,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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:36:58,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:58,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:36:58,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:58,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:36:58,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:36:58,392 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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:37:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:00,868 INFO L93 Difference]: Finished difference Result 331 states and 362 transitions. [2022-02-20 23:37:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 23:37:00,868 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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 37 [2022-02-20 23:37:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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:37:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 315 transitions. [2022-02-20 23:37:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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:37:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 315 transitions. [2022-02-20 23:37:00,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 315 transitions. [2022-02-20 23:37:01,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 315 edges. 315 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:01,125 INFO L225 Difference]: With dead ends: 331 [2022-02-20 23:37:01,125 INFO L226 Difference]: Without dead ends: 331 [2022-02-20 23:37:01,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2022-02-20 23:37:01,126 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 565 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:01,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 1036 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 23:37:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-02-20 23:37:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 234. [2022-02-20 23:37:01,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:01,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 234 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 233 states have internal predecessors, (278), 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:37:01,131 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 234 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 233 states have internal predecessors, (278), 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:37:01,131 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 234 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 233 states have internal predecessors, (278), 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:37:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:01,135 INFO L93 Difference]: Finished difference Result 331 states and 362 transitions. [2022-02-20 23:37:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 362 transitions. [2022-02-20 23:37:01,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:01,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:01,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 233 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 331 states. [2022-02-20 23:37:01,136 INFO L87 Difference]: Start difference. First operand has 234 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 233 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 331 states. [2022-02-20 23:37:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:01,140 INFO L93 Difference]: Finished difference Result 331 states and 362 transitions. [2022-02-20 23:37:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 362 transitions. [2022-02-20 23:37:01,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:01,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:01,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:01,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 233 states have internal predecessors, (278), 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:37:01,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 278 transitions. [2022-02-20 23:37:01,143 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 278 transitions. Word has length 37 [2022-02-20 23:37:01,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:01,143 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 278 transitions. [2022-02-20 23:37:01,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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:37:01,144 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 278 transitions. [2022-02-20 23:37:01,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 23:37:01,144 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:01,144 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:01,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-20 23:37:01,144 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:37:01,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:01,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362969, now seen corresponding path program 1 times [2022-02-20 23:37:01,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:01,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253891085] [2022-02-20 23:37:01,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:01,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:01,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {23792#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {23792#true} is VALID [2022-02-20 23:37:01,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {23792#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {23792#true} is VALID [2022-02-20 23:37:01,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {23792#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {23792#true} is VALID [2022-02-20 23:37:01,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {23792#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {23792#true} is VALID [2022-02-20 23:37:01,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {23792#true} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {23792#true} is VALID [2022-02-20 23:37:01,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {23792#true} goto; {23792#true} is VALID [2022-02-20 23:37:01,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {23792#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {23792#true} is VALID [2022-02-20 23:37:01,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {23792#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {23792#true} is VALID [2022-02-20 23:37:01,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {23792#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {23792#true} is VALID [2022-02-20 23:37:01,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {23792#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {23792#true} is VALID [2022-02-20 23:37:01,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {23792#true} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {23792#true} is VALID [2022-02-20 23:37:01,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {23792#true} assume !main_#t~short8#1; {23792#true} is VALID [2022-02-20 23:37:01,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {23792#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {23792#true} is VALID [2022-02-20 23:37:01,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {23792#true} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {23792#true} is VALID [2022-02-20 23:37:01,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {23792#true} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {23792#true} is VALID [2022-02-20 23:37:01,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {23792#true} goto; {23792#true} is VALID [2022-02-20 23:37:01,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {23792#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {23792#true} is VALID [2022-02-20 23:37:01,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {23792#true} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {23792#true} is VALID [2022-02-20 23:37:01,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {23792#true} assume !!(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(12); {23792#true} is VALID [2022-02-20 23:37:01,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {23792#true} SUMMARY for call write~$Pointer$(main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1014 {23792#true} is VALID [2022-02-20 23:37:01,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {23792#true} havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset; {23792#true} is VALID [2022-02-20 23:37:01,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {23792#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1015 {23792#true} is VALID [2022-02-20 23:37:01,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {23792#true} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); srcloc: L1015-1 {23792#true} is VALID [2022-02-20 23:37:01,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {23792#true} havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {23792#true} is VALID [2022-02-20 23:37:01,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {23792#true} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1016 {23792#true} is VALID [2022-02-20 23:37:01,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {23792#true} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset; {23792#true} is VALID [2022-02-20 23:37:01,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {23792#true} SUMMARY for call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1017 {23792#true} is VALID [2022-02-20 23:37:01,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {23792#true} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {23792#true} is VALID [2022-02-20 23:37:01,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {23792#true} goto; {23792#true} is VALID [2022-02-20 23:37:01,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {23792#true} assume !!(main_~end~0#1.base != 0 || main_~end~0#1.offset != 0); {23792#true} is VALID [2022-02-20 23:37:01,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {23792#true} goto; {23792#true} is VALID [2022-02-20 23:37:01,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {23792#true} assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {23792#true} is VALID [2022-02-20 23:37:01,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {23792#true} assume !(0 != main_#t~nondet13#1);havoc main_#t~nondet13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(12); {23794#(= (select |#valid| |ULTIMATE.start_main_#t~malloc14#1.base|) 1)} is VALID [2022-02-20 23:37:01,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {23794#(= (select |#valid| |ULTIMATE.start_main_#t~malloc14#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1019-8 {23795#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 1)} is VALID [2022-02-20 23:37:01,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {23795#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 1)} havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {23795#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 1)} is VALID [2022-02-20 23:37:01,195 INFO L290 TraceCheckUtils]: 35: Hoare triple {23795#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 1)} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1019-10 {23796#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} is VALID [2022-02-20 23:37:01,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {23796#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} assume !(1 == #valid[main_#t~mem15#1.base]); {23793#false} is VALID [2022-02-20 23:37:01,195 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:37:01,196 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:01,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253891085] [2022-02-20 23:37:01,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253891085] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:01,196 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:01,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:37:01,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613377282] [2022-02-20 23:37:01,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:01,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2022-02-20 23:37:01,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:01,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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:37:01,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:01,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:37:01,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:01,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:37:01,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:37:01,218 INFO L87 Difference]: Start difference. First operand 234 states and 278 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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:37:01,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:01,500 INFO L93 Difference]: Finished difference Result 233 states and 277 transitions. [2022-02-20 23:37:01,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:37:01,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2022-02-20 23:37:01,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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:37:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2022-02-20 23:37:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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:37:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2022-02-20 23:37:01,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 147 transitions. [2022-02-20 23:37:01,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:01,562 INFO L225 Difference]: With dead ends: 233 [2022-02-20 23:37:01,562 INFO L226 Difference]: Without dead ends: 233 [2022-02-20 23:37:01,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:37:01,562 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 4 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:01,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 413 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-02-20 23:37:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2022-02-20 23:37:01,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:01,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 233 states, 204 states have (on average 1.357843137254902) internal successors, (277), 232 states have internal predecessors, (277), 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:37:01,565 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 233 states, 204 states have (on average 1.357843137254902) internal successors, (277), 232 states have internal predecessors, (277), 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:37:01,565 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 233 states, 204 states have (on average 1.357843137254902) internal successors, (277), 232 states have internal predecessors, (277), 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:37:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:01,569 INFO L93 Difference]: Finished difference Result 233 states and 277 transitions. [2022-02-20 23:37:01,569 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2022-02-20 23:37:01,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:01,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:01,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 204 states have (on average 1.357843137254902) internal successors, (277), 232 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 233 states. [2022-02-20 23:37:01,570 INFO L87 Difference]: Start difference. First operand has 233 states, 204 states have (on average 1.357843137254902) internal successors, (277), 232 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 233 states. [2022-02-20 23:37:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:01,572 INFO L93 Difference]: Finished difference Result 233 states and 277 transitions. [2022-02-20 23:37:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2022-02-20 23:37:01,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:01,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:01,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:01,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.357843137254902) internal successors, (277), 232 states have internal predecessors, (277), 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:37:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2022-02-20 23:37:01,575 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 37 [2022-02-20 23:37:01,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:01,575 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2022-02-20 23:37:01,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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:37:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2022-02-20 23:37:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 23:37:01,575 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:01,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:01,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-20 23:37:01,576 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:37:01,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:01,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362968, now seen corresponding path program 1 times [2022-02-20 23:37:01,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:01,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250867208] [2022-02-20 23:37:01,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:01,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:01,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {24735#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {24735#true} is VALID [2022-02-20 23:37:01,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {24735#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {24735#true} is VALID [2022-02-20 23:37:01,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {24735#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {24735#true} is VALID [2022-02-20 23:37:01,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {24735#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {24735#true} is VALID [2022-02-20 23:37:01,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {24735#true} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {24735#true} is VALID [2022-02-20 23:37:01,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {24735#true} goto; {24735#true} is VALID [2022-02-20 23:37:01,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {24735#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {24735#true} is VALID [2022-02-20 23:37:01,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {24735#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {24735#true} is VALID [2022-02-20 23:37:01,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {24735#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {24735#true} is VALID [2022-02-20 23:37:01,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {24735#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {24735#true} is VALID [2022-02-20 23:37:01,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {24735#true} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {24735#true} is VALID [2022-02-20 23:37:01,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {24735#true} assume !main_#t~short8#1; {24735#true} is VALID [2022-02-20 23:37:01,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {24735#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {24735#true} is VALID [2022-02-20 23:37:01,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {24735#true} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {24735#true} is VALID [2022-02-20 23:37:01,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {24735#true} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {24735#true} is VALID [2022-02-20 23:37:01,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {24735#true} goto; {24735#true} is VALID [2022-02-20 23:37:01,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {24735#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {24735#true} is VALID [2022-02-20 23:37:01,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {24735#true} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {24735#true} is VALID [2022-02-20 23:37:01,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {24735#true} assume !!(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(12); {24735#true} is VALID [2022-02-20 23:37:01,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {24735#true} SUMMARY for call write~$Pointer$(main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1014 {24735#true} is VALID [2022-02-20 23:37:01,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {24735#true} havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset; {24735#true} is VALID [2022-02-20 23:37:01,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {24735#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1015 {24735#true} is VALID [2022-02-20 23:37:01,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {24735#true} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); srcloc: L1015-1 {24735#true} is VALID [2022-02-20 23:37:01,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {24735#true} havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {24735#true} is VALID [2022-02-20 23:37:01,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {24735#true} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1016 {24735#true} is VALID [2022-02-20 23:37:01,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {24735#true} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset; {24735#true} is VALID [2022-02-20 23:37:01,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {24735#true} SUMMARY for call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1017 {24735#true} is VALID [2022-02-20 23:37:01,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {24735#true} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {24735#true} is VALID [2022-02-20 23:37:01,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {24735#true} goto; {24735#true} is VALID [2022-02-20 23:37:01,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {24735#true} assume !!(main_~end~0#1.base != 0 || main_~end~0#1.offset != 0); {24735#true} is VALID [2022-02-20 23:37:01,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {24735#true} goto; {24735#true} is VALID [2022-02-20 23:37:01,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {24735#true} assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {24735#true} is VALID [2022-02-20 23:37:01,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {24735#true} assume !(0 != main_#t~nondet13#1);havoc main_#t~nondet13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(12); {24737#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc14#1.base|) 12) (= |ULTIMATE.start_main_#t~malloc14#1.offset| 0))} is VALID [2022-02-20 23:37:01,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {24737#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc14#1.base|) 12) (= |ULTIMATE.start_main_#t~malloc14#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1019-8 {24738#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 12))} is VALID [2022-02-20 23:37:01,643 INFO L290 TraceCheckUtils]: 34: Hoare triple {24738#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 12))} havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {24738#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 12))} is VALID [2022-02-20 23:37:01,643 INFO L290 TraceCheckUtils]: 35: Hoare triple {24738#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))) 12))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1019-10 {24739#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_#t~mem15#1.offset| 0))} is VALID [2022-02-20 23:37:01,643 INFO L290 TraceCheckUtils]: 36: Hoare triple {24739#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_#t~mem15#1.offset| 0))} assume !(4 + main_#t~mem15#1.offset <= #length[main_#t~mem15#1.base] && 0 <= main_#t~mem15#1.offset); {24736#false} is VALID [2022-02-20 23:37:01,644 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:37:01,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:01,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250867208] [2022-02-20 23:37:01,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250867208] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:01,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:01,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:37:01,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435935642] [2022-02-20 23:37:01,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:01,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2022-02-20 23:37:01,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:01,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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:37:01,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:01,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:37:01,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:01,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:37:01,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:37:01,672 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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:37:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:02,193 INFO L93 Difference]: Finished difference Result 232 states and 276 transitions. [2022-02-20 23:37:02,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:37:02,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2022-02-20 23:37:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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:37:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2022-02-20 23:37:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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:37:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2022-02-20 23:37:02,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 146 transitions. [2022-02-20 23:37:02,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:02,289 INFO L225 Difference]: With dead ends: 232 [2022-02-20 23:37:02,289 INFO L226 Difference]: Without dead ends: 232 [2022-02-20 23:37:02,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:37:02,289 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 2 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:02,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 410 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:37:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-02-20 23:37:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-02-20 23:37:02,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:02,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 232 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 231 states have internal predecessors, (276), 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:37:02,292 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 232 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 231 states have internal predecessors, (276), 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:37:02,292 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 232 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 231 states have internal predecessors, (276), 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:37:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:02,307 INFO L93 Difference]: Finished difference Result 232 states and 276 transitions. [2022-02-20 23:37:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 276 transitions. [2022-02-20 23:37:02,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:02,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:02,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 232 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 231 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 232 states. [2022-02-20 23:37:02,308 INFO L87 Difference]: Start difference. First operand has 232 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 231 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 232 states. [2022-02-20 23:37:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:02,310 INFO L93 Difference]: Finished difference Result 232 states and 276 transitions. [2022-02-20 23:37:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 276 transitions. [2022-02-20 23:37:02,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:02,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:02,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:02,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 231 states have internal predecessors, (276), 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:37:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 276 transitions. [2022-02-20 23:37:02,313 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 276 transitions. Word has length 37 [2022-02-20 23:37:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:02,314 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 276 transitions. [2022-02-20 23:37:02,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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:37:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 276 transitions. [2022-02-20 23:37:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 23:37:02,314 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:02,314 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:02,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-20 23:37:02,315 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:37:02,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:02,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1939172976, now seen corresponding path program 1 times [2022-02-20 23:37:02,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:02,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778894] [2022-02-20 23:37:02,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:02,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:02,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {25674#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {25674#true} is VALID [2022-02-20 23:37:02,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {25674#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {25674#true} is VALID [2022-02-20 23:37:02,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {25674#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {25674#true} is VALID [2022-02-20 23:37:02,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {25674#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {25674#true} is VALID [2022-02-20 23:37:02,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {25674#true} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {25674#true} is VALID [2022-02-20 23:37:02,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {25674#true} goto; {25674#true} is VALID [2022-02-20 23:37:02,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {25674#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {25674#true} is VALID [2022-02-20 23:37:02,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {25674#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {25674#true} is VALID [2022-02-20 23:37:02,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {25674#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {25674#true} is VALID [2022-02-20 23:37:02,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {25674#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {25676#(and (= |ULTIMATE.start_main_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) |ULTIMATE.start_main_#t~mem6#1.offset|))} is VALID [2022-02-20 23:37:02,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {25676#(and (= |ULTIMATE.start_main_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) |ULTIMATE.start_main_#t~mem6#1.offset|))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {25677#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) |ULTIMATE.start_main_#t~short8#1|)} is VALID [2022-02-20 23:37:02,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {25677#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) |ULTIMATE.start_main_#t~short8#1|)} assume !main_#t~short8#1; {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} goto; {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} goto; {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);main_~len~0#1 := 0; {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1031 {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} main_~inner~0#1.base, main_~inner~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} assume !(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} assume !!(main_~len~0#1 <= 1); {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} goto; {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1043-4 {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} assume !!(0 != main_~list~0#1.base || 0 != main_~list~0#1.offset); {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} is VALID [2022-02-20 23:37:02,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {25678#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) 0))} SUMMARY for call main_#t~mem25#1.base, main_#t~mem25#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1051 {25679#(and (= |ULTIMATE.start_main_#t~mem25#1.offset| 0) (= |ULTIMATE.start_main_#t~mem25#1.base| 0))} is VALID [2022-02-20 23:37:02,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {25679#(and (= |ULTIMATE.start_main_#t~mem25#1.offset| 0) (= |ULTIMATE.start_main_#t~mem25#1.base| 0))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem25#1.base, main_#t~mem25#1.offset;havoc main_#t~mem25#1.base, main_#t~mem25#1.offset; {25680#(and (= |ULTIMATE.start_main_~end~0#1.base| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:37:02,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {25680#(and (= |ULTIMATE.start_main_~end~0#1.base| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume 0 != main_~end~0#1.base || 0 != main_~end~0#1.offset; {25675#false} is VALID [2022-02-20 23:37:02,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {25675#false} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {25675#false} is VALID [2022-02-20 23:37:02,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {25675#false} assume !false; {25675#false} is VALID [2022-02-20 23:37:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:37:02,402 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:02,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778894] [2022-02-20 23:37:02,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778894] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:02,402 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:02,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:37:02,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289000285] [2022-02-20 23:37:02,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:02,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 37 [2022-02-20 23:37:02,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:02,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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:37:02,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:02,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:37:02,434 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:02,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:37:02,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:37:02,434 INFO L87 Difference]: Start difference. First operand 232 states and 276 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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:37:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:02,934 INFO L93 Difference]: Finished difference Result 248 states and 292 transitions. [2022-02-20 23:37:02,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:37:02,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 37 [2022-02-20 23:37:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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:37:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2022-02-20 23:37:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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:37:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2022-02-20 23:37:02,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 181 transitions. [2022-02-20 23:37:03,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:03,078 INFO L225 Difference]: With dead ends: 248 [2022-02-20 23:37:03,078 INFO L226 Difference]: Without dead ends: 248 [2022-02-20 23:37:03,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:37:03,079 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 58 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:03,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 528 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-02-20 23:37:03,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 241. [2022-02-20 23:37:03,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:03,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 241 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 240 states have internal predecessors, (285), 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:37:03,083 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 241 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 240 states have internal predecessors, (285), 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:37:03,083 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 241 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 240 states have internal predecessors, (285), 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:37:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:03,086 INFO L93 Difference]: Finished difference Result 248 states and 292 transitions. [2022-02-20 23:37:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 292 transitions. [2022-02-20 23:37:03,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:03,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:03,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 241 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 240 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 248 states. [2022-02-20 23:37:03,087 INFO L87 Difference]: Start difference. First operand has 241 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 240 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 248 states. [2022-02-20 23:37:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:03,091 INFO L93 Difference]: Finished difference Result 248 states and 292 transitions. [2022-02-20 23:37:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 292 transitions. [2022-02-20 23:37:03,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:03,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:03,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:03,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:03,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 240 states have internal predecessors, (285), 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:37:03,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 285 transitions. [2022-02-20 23:37:03,095 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 285 transitions. Word has length 37 [2022-02-20 23:37:03,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:03,095 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 285 transitions. [2022-02-20 23:37:03,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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:37:03,095 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 285 transitions. [2022-02-20 23:37:03,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 23:37:03,096 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:03,096 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:03,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-20 23:37:03,096 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:37:03,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:03,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1413983143, now seen corresponding path program 1 times [2022-02-20 23:37:03,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:03,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752654365] [2022-02-20 23:37:03,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:03,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:03,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {26676#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {26676#true} is VALID [2022-02-20 23:37:03,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {26676#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {26676#true} is VALID [2022-02-20 23:37:03,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {26676#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {26676#true} is VALID [2022-02-20 23:37:03,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {26676#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {26676#true} is VALID [2022-02-20 23:37:03,141 INFO L290 TraceCheckUtils]: 4: Hoare triple {26676#true} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {26676#true} is VALID [2022-02-20 23:37:03,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {26676#true} goto; {26676#true} is VALID [2022-02-20 23:37:03,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {26676#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {26676#true} is VALID [2022-02-20 23:37:03,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {26676#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {26676#true} is VALID [2022-02-20 23:37:03,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {26676#true} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {26676#true} is VALID [2022-02-20 23:37:03,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {26676#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {26676#true} is VALID [2022-02-20 23:37:03,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {26676#true} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {26676#true} is VALID [2022-02-20 23:37:03,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {26676#true} assume !main_#t~short8#1; {26676#true} is VALID [2022-02-20 23:37:03,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {26676#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {26676#true} is VALID [2022-02-20 23:37:03,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {26676#true} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {26676#true} is VALID [2022-02-20 23:37:03,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {26676#true} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {26676#true} is VALID [2022-02-20 23:37:03,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {26676#true} goto; {26676#true} is VALID [2022-02-20 23:37:03,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {26676#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {26676#true} is VALID [2022-02-20 23:37:03,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {26676#true} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {26676#true} is VALID [2022-02-20 23:37:03,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {26676#true} assume !!(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(12); {26676#true} is VALID [2022-02-20 23:37:03,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {26676#true} SUMMARY for call write~$Pointer$(main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1014 {26676#true} is VALID [2022-02-20 23:37:03,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {26676#true} havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset; {26676#true} is VALID [2022-02-20 23:37:03,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {26676#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1015 {26676#true} is VALID [2022-02-20 23:37:03,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {26676#true} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); srcloc: L1015-1 {26676#true} is VALID [2022-02-20 23:37:03,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {26676#true} havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {26676#true} is VALID [2022-02-20 23:37:03,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {26676#true} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1016 {26676#true} is VALID [2022-02-20 23:37:03,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {26676#true} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset; {26676#true} is VALID [2022-02-20 23:37:03,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {26676#true} SUMMARY for call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1017 {26676#true} is VALID [2022-02-20 23:37:03,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {26676#true} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {26676#true} is VALID [2022-02-20 23:37:03,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {26676#true} goto; {26676#true} is VALID [2022-02-20 23:37:03,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {26676#true} assume !!(main_~end~0#1.base != 0 || main_~end~0#1.offset != 0); {26676#true} is VALID [2022-02-20 23:37:03,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {26676#true} goto; {26676#true} is VALID [2022-02-20 23:37:03,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {26676#true} assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {26676#true} is VALID [2022-02-20 23:37:03,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {26676#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {26676#true} is VALID [2022-02-20 23:37:03,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {26676#true} SUMMARY for call write~$Pointer$(0, 0, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1019-6 {26676#true} is VALID [2022-02-20 23:37:03,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {26676#true} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1019-26 {26676#true} is VALID [2022-02-20 23:37:03,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {26676#true} main_#t~short19#1 := main_#t~mem17#1.base != 0 || main_#t~mem17#1.offset != 0; {26676#true} is VALID [2022-02-20 23:37:03,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {26676#true} assume main_#t~short19#1; {26678#|ULTIMATE.start_main_#t~short19#1|} is VALID [2022-02-20 23:37:03,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {26678#|ULTIMATE.start_main_#t~short19#1|} assume !main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~short19#1; {26677#false} is VALID [2022-02-20 23:37:03,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {26677#false} assume !false; {26677#false} is VALID [2022-02-20 23:37:03,146 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:37:03,146 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:03,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752654365] [2022-02-20 23:37:03,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752654365] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:03,146 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:03,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:37:03,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061905270] [2022-02-20 23:37:03,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:03,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2022-02-20 23:37:03,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:03,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:37:03,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:03,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:37:03,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:03,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:37:03,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:03,177 INFO L87 Difference]: Start difference. First operand 241 states and 285 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:37:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:03,282 INFO L93 Difference]: Finished difference Result 242 states and 286 transitions. [2022-02-20 23:37:03,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:37:03,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2022-02-20 23:37:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:37:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-20 23:37:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:37:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-20 23:37:03,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2022-02-20 23:37:03,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:03,386 INFO L225 Difference]: With dead ends: 242 [2022-02-20 23:37:03,386 INFO L226 Difference]: Without dead ends: 242 [2022-02-20 23:37:03,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:03,386 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:03,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:37:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-02-20 23:37:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-02-20 23:37:03,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:03,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 242 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 241 states have internal predecessors, (286), 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:37:03,389 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 242 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 241 states have internal predecessors, (286), 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:37:03,389 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 242 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 241 states have internal predecessors, (286), 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:37:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:03,392 INFO L93 Difference]: Finished difference Result 242 states and 286 transitions. [2022-02-20 23:37:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 286 transitions. [2022-02-20 23:37:03,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:03,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:03,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 241 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 242 states. [2022-02-20 23:37:03,393 INFO L87 Difference]: Start difference. First operand has 242 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 241 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 242 states. [2022-02-20 23:37:03,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:03,395 INFO L93 Difference]: Finished difference Result 242 states and 286 transitions. [2022-02-20 23:37:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 286 transitions. [2022-02-20 23:37:03,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:03,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:03,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:03,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 241 states have internal predecessors, (286), 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:37:03,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 286 transitions. [2022-02-20 23:37:03,398 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 286 transitions. Word has length 39 [2022-02-20 23:37:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:03,399 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 286 transitions. [2022-02-20 23:37:03,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:37:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 286 transitions. [2022-02-20 23:37:03,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 23:37:03,399 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:03,399 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:03,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-20 23:37:03,400 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:37:03,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash -407701739, now seen corresponding path program 1 times [2022-02-20 23:37:03,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:03,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445793840] [2022-02-20 23:37:03,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:03,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:03,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {27649#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {27649#true} is VALID [2022-02-20 23:37:03,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {27649#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~short8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~short19#1, main_#t~nondet9#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~inner~0#1.base, main_~inner~0#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1004 {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,430 INFO L290 TraceCheckUtils]: 3: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1004-1 {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,430 INFO L290 TraceCheckUtils]: 4: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !!(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} goto; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-6 {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-26 {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !main_#t~short8#1; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1006-20 {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} main_#t~short8#1 := main_#t~mem7#1.base == 0 && main_#t~mem7#1.offset == 0; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~short8#1; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} goto; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} goto; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);main_~len~0#1 := 0; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1031 {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} main_~inner~0#1.base, main_~inner~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !(0 != main_~inner~0#1.base || 0 != main_~inner~0#1.offset); {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !!(main_~len~0#1 <= 1); {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} goto; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1043-4 {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !!(0 != main_~list~0#1.base || 0 != main_~list~0#1.offset); {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call main_#t~mem25#1.base, main_#t~mem25#1.offset := read~$Pointer$(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1051 {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem25#1.base, main_#t~mem25#1.offset;havoc main_#t~mem25#1.base, main_#t~mem25#1.offset; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call main_#t~mem28#1.base, main_#t~mem28#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1053-2 {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem28#1.base, main_#t~mem28#1.offset;havoc main_#t~mem28#1.base, main_#t~mem28#1.offset; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume 0 == main_~list~0#1.offset; {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:37:03,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {27651#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !(main_~list~0#1.base < #StackHeapBarrier); {27650#false} is VALID [2022-02-20 23:37:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:37:03,440 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:03,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445793840] [2022-02-20 23:37:03,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445793840] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:03,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:03,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:37:03,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609441292] [2022-02-20 23:37:03,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:03,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2022-02-20 23:37:03,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:03,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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:37:03,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:03,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:37:03,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:03,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:37:03,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:03,469 INFO L87 Difference]: Start difference. First operand 242 states and 286 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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:37:03,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:03,588 INFO L93 Difference]: Finished difference Result 255 states and 290 transitions. [2022-02-20 23:37:03,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:37:03,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2022-02-20 23:37:03,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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:37:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2022-02-20 23:37:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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:37:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2022-02-20 23:37:03,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 178 transitions. [2022-02-20 23:37:03,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:03,683 INFO L225 Difference]: With dead ends: 255 [2022-02-20 23:37:03,683 INFO L226 Difference]: Without dead ends: 255 [2022-02-20 23:37:03,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:37:03,684 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 98 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:03,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 151 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:37:03,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-02-20 23:37:03,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 243. [2022-02-20 23:37:03,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:03,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 255 states. Second operand has 243 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 242 states have internal predecessors, (287), 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:37:03,687 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand has 243 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 242 states have internal predecessors, (287), 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:37:03,687 INFO L87 Difference]: Start difference. First operand 255 states. Second operand has 243 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 242 states have internal predecessors, (287), 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:37:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:03,690 INFO L93 Difference]: Finished difference Result 255 states and 290 transitions. [2022-02-20 23:37:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 290 transitions. [2022-02-20 23:37:03,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:03,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:03,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 242 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 255 states. [2022-02-20 23:37:03,691 INFO L87 Difference]: Start difference. First operand has 243 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 242 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 255 states. [2022-02-20 23:37:03,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:03,693 INFO L93 Difference]: Finished difference Result 255 states and 290 transitions. [2022-02-20 23:37:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 290 transitions. [2022-02-20 23:37:03,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:03,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:03,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:03,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 242 states have internal predecessors, (287), 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:37:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 287 transitions. [2022-02-20 23:37:03,697 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 287 transitions. Word has length 39 [2022-02-20 23:37:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:03,697 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 287 transitions. [2022-02-20 23:37:03,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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:37:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 287 transitions. [2022-02-20 23:37:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 23:37:03,698 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:03,698 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:03,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-20 23:37:03,698 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2022-02-20 23:37:03,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:03,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1645380794, now seen corresponding path program 1 times [2022-02-20 23:37:03,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:03,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016539979] [2022-02-20 23:37:03,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:03,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:37:03,730 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:37:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:37:03,773 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:37:03,773 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:37:03,774 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK (83 of 84 remaining) [2022-02-20 23:37:03,775 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (82 of 84 remaining) [2022-02-20 23:37:03,775 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (81 of 84 remaining) [2022-02-20 23:37:03,775 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (80 of 84 remaining) [2022-02-20 23:37:03,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (79 of 84 remaining) [2022-02-20 23:37:03,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (78 of 84 remaining) [2022-02-20 23:37:03,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (77 of 84 remaining) [2022-02-20 23:37:03,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (76 of 84 remaining) [2022-02-20 23:37:03,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (75 of 84 remaining) [2022-02-20 23:37:03,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (74 of 84 remaining) [2022-02-20 23:37:03,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (73 of 84 remaining) [2022-02-20 23:37:03,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (72 of 84 remaining) [2022-02-20 23:37:03,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (71 of 84 remaining) [2022-02-20 23:37:03,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (70 of 84 remaining) [2022-02-20 23:37:03,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (69 of 84 remaining) [2022-02-20 23:37:03,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (68 of 84 remaining) [2022-02-20 23:37:03,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (67 of 84 remaining) [2022-02-20 23:37:03,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (66 of 84 remaining) [2022-02-20 23:37:03,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (65 of 84 remaining) [2022-02-20 23:37:03,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (64 of 84 remaining) [2022-02-20 23:37:03,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (63 of 84 remaining) [2022-02-20 23:37:03,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (62 of 84 remaining) [2022-02-20 23:37:03,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (61 of 84 remaining) [2022-02-20 23:37:03,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (60 of 84 remaining) [2022-02-20 23:37:03,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (59 of 84 remaining) [2022-02-20 23:37:03,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (58 of 84 remaining) [2022-02-20 23:37:03,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (57 of 84 remaining) [2022-02-20 23:37:03,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (56 of 84 remaining) [2022-02-20 23:37:03,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (55 of 84 remaining) [2022-02-20 23:37:03,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (54 of 84 remaining) [2022-02-20 23:37:03,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (53 of 84 remaining) [2022-02-20 23:37:03,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (52 of 84 remaining) [2022-02-20 23:37:03,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (51 of 84 remaining) [2022-02-20 23:37:03,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK (50 of 84 remaining) [2022-02-20 23:37:03,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (49 of 84 remaining) [2022-02-20 23:37:03,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (48 of 84 remaining) [2022-02-20 23:37:03,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (47 of 84 remaining) [2022-02-20 23:37:03,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (46 of 84 remaining) [2022-02-20 23:37:03,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (45 of 84 remaining) [2022-02-20 23:37:03,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (44 of 84 remaining) [2022-02-20 23:37:03,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (43 of 84 remaining) [2022-02-20 23:37:03,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (42 of 84 remaining) [2022-02-20 23:37:03,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (41 of 84 remaining) [2022-02-20 23:37:03,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (40 of 84 remaining) [2022-02-20 23:37:03,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (39 of 84 remaining) [2022-02-20 23:37:03,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (38 of 84 remaining) [2022-02-20 23:37:03,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (37 of 84 remaining) [2022-02-20 23:37:03,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (36 of 84 remaining) [2022-02-20 23:37:03,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (35 of 84 remaining) [2022-02-20 23:37:03,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (34 of 84 remaining) [2022-02-20 23:37:03,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (33 of 84 remaining) [2022-02-20 23:37:03,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK (32 of 84 remaining) [2022-02-20 23:37:03,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (31 of 84 remaining) [2022-02-20 23:37:03,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (30 of 84 remaining) [2022-02-20 23:37:03,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (29 of 84 remaining) [2022-02-20 23:37:03,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (28 of 84 remaining) [2022-02-20 23:37:03,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (27 of 84 remaining) [2022-02-20 23:37:03,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (26 of 84 remaining) [2022-02-20 23:37:03,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK (25 of 84 remaining) [2022-02-20 23:37:03,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (24 of 84 remaining) [2022-02-20 23:37:03,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (23 of 84 remaining) [2022-02-20 23:37:03,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION (22 of 84 remaining) [2022-02-20 23:37:03,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION (21 of 84 remaining) [2022-02-20 23:37:03,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK (20 of 84 remaining) [2022-02-20 23:37:03,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION (19 of 84 remaining) [2022-02-20 23:37:03,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION (18 of 84 remaining) [2022-02-20 23:37:03,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION (17 of 84 remaining) [2022-02-20 23:37:03,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION (16 of 84 remaining) [2022-02-20 23:37:03,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK (15 of 84 remaining) [2022-02-20 23:37:03,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION (14 of 84 remaining) [2022-02-20 23:37:03,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION (13 of 84 remaining) [2022-02-20 23:37:03,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK (12 of 84 remaining) [2022-02-20 23:37:03,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION (11 of 84 remaining) [2022-02-20 23:37:03,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION (10 of 84 remaining) [2022-02-20 23:37:03,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK (9 of 84 remaining) [2022-02-20 23:37:03,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE (8 of 84 remaining) [2022-02-20 23:37:03,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE (7 of 84 remaining) [2022-02-20 23:37:03,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE (6 of 84 remaining) [2022-02-20 23:37:03,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION (5 of 84 remaining) [2022-02-20 23:37:03,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION (4 of 84 remaining) [2022-02-20 23:37:03,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONMEMORY_FREE (3 of 84 remaining) [2022-02-20 23:37:03,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE (2 of 84 remaining) [2022-02-20 23:37:03,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE (1 of 84 remaining) [2022-02-20 23:37:03,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (0 of 84 remaining) [2022-02-20 23:37:03,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-20 23:37:03,790 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:03,792 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:37:03,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:37:03 BoogieIcfgContainer [2022-02-20 23:37:03,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:37:03,838 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:37:03,838 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:37:03,838 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:37:03,839 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:32" (3/4) ... [2022-02-20 23:37:03,840 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:37:03,878 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:37:03,878 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:37:03,881 INFO L158 Benchmark]: Toolchain (without parser) took 32317.48ms. Allocated memory was 98.6MB in the beginning and 232.8MB in the end (delta: 134.2MB). Free memory was 65.2MB in the beginning and 126.7MB in the end (delta: -61.4MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. [2022-02-20 23:37:03,881 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory is still 53.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:37:03,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.89ms. Allocated memory is still 98.6MB. Free memory was 65.0MB in the beginning and 61.9MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:37:03,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.03ms. Allocated memory is still 98.6MB. Free memory was 61.9MB in the beginning and 59.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:37:03,882 INFO L158 Benchmark]: Boogie Preprocessor took 26.99ms. Allocated memory is still 98.6MB. Free memory was 59.0MB in the beginning and 56.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:37:03,882 INFO L158 Benchmark]: RCFGBuilder took 754.08ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 56.3MB in the beginning and 72.6MB in the end (delta: -16.4MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2022-02-20 23:37:03,882 INFO L158 Benchmark]: TraceAbstraction took 31032.48ms. Allocated memory was 121.6MB in the beginning and 232.8MB in the end (delta: 111.1MB). Free memory was 72.0MB in the beginning and 130.8MB in the end (delta: -58.8MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2022-02-20 23:37:03,885 INFO L158 Benchmark]: Witness Printer took 42.03ms. Allocated memory is still 232.8MB. Free memory was 130.8MB in the beginning and 126.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:37:03,885 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.20ms. Allocated memory is still 98.6MB. Free memory is still 53.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.89ms. Allocated memory is still 98.6MB. Free memory was 65.0MB in the beginning and 61.9MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.03ms. Allocated memory is still 98.6MB. Free memory was 61.9MB in the beginning and 59.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.99ms. Allocated memory is still 98.6MB. Free memory was 59.0MB in the beginning and 56.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 754.08ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 56.3MB in the beginning and 72.6MB in the end (delta: -16.4MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 31032.48ms. Allocated memory was 121.6MB in the beginning and 232.8MB in the end (delta: 111.1MB). Free memory was 72.0MB in the beginning and 130.8MB in the end (delta: -58.8MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. * Witness Printer took 42.03ms. Allocated memory is still 232.8MB. Free memory was 130.8MB in the beginning and 126.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* list = malloc(sizeof(SLL)); [L1004] list->next = ((void*)0) VAL [list={-1:0}] [L1005] list->prev = ((void*)0) VAL [list={-1:0}] [L1006] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1006] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1006] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1008] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1022] end = ((void*)0) [L1023] end = list VAL [end={-1:0}, list={-1:0}] [L1026] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1028] COND TRUE ((void*)0) != end [L1030] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1031] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}] [L1031] SLL* inner = end->inner; [L1032] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1034] COND TRUE len == 0 [L1035] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1039] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1039] COND FALSE !(!(((void*)0) == inner->inner)) [L1040] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1040] COND TRUE !(((void*)0) != inner->next) [L1040] reach_error() VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 200 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 30.9s, OverallIterations: 31, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5360 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5360 mSDsluCounter, 13990 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 40 IncrementalHoareTripleChecker+Unchecked, 9949 mSDsCounter, 346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7222 IncrementalHoareTripleChecker+Invalid, 7608 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 346 mSolverCounterUnsat, 4041 mSDtfsCounter, 7222 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=30, InterpolantAutomatonStates: 233, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 919 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 792 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 752 ConstructedInterpolants, 17 QuantifiedInterpolants, 6485 SizeOfPredicates, 9 NumberOfNonLiveVariables, 159 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 32 InterpolantComputations, 29 PerfectInterpolantSequences, 5/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-20 23:37:03,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)