/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:26:51,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:26:51,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:26:51,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:26:51,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:26:51,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:26:51,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:26:51,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:26:51,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:26:51,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:26:51,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:26:51,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:26:51,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:26:51,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:26:51,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:26:51,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:26:51,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:26:51,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:26:51,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:26:51,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:26:51,919 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:26:51,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:26:51,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:26:51,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:26:51,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:26:51,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:26:51,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:26:51,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:26:51,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:26:51,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:26:51,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:26:51,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:26:51,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:26:51,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:26:51,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:26:51,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:26:51,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:26:51,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:26:51,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:26:51,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:26:51,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:26:51,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:26:51,938 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:26:51,948 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:26:51,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:26:51,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:26:51,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:26:51,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:26:51,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:26:51,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:26:51,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:26:51,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:26:51,951 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:26:51,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:26:51,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:26:51,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:26:51,951 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:26:51,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:26:51,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:26:51,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:26:51,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:26:51,952 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:26:51,952 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:26:51,952 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:26:51,952 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:26:51,952 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:26:52,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:26:52,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:26:52,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:26:52,207 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:26:52,208 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:26:52,209 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-04-08 09:26:52,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f6e022e/f4ab9ce05006489dadd0123ce2e76b4e/FLAGe39118c08 [2022-04-08 09:26:52,604 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:26:52,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-04-08 09:26:52,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f6e022e/f4ab9ce05006489dadd0123ce2e76b4e/FLAGe39118c08 [2022-04-08 09:26:53,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f6e022e/f4ab9ce05006489dadd0123ce2e76b4e [2022-04-08 09:26:53,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:26:53,018 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:26:53,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:26:53,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:26:53,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:26:53,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:26:53" (1/1) ... [2022-04-08 09:26:53,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5069e914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:53, skipping insertion in model container [2022-04-08 09:26:53,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:26:53" (1/1) ... [2022-04-08 09:26:53,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:26:53,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:26:53,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-04-08 09:26:53,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-04-08 09:26:53,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-04-08 09:26:53,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-04-08 09:26:53,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-04-08 09:26:53,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-04-08 09:26:53,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-04-08 09:26:53,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-04-08 09:26:53,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-04-08 09:26:53,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-04-08 09:26:53,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-04-08 09:26:53,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-04-08 09:26:53,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-04-08 09:26:53,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-04-08 09:26:53,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-04-08 09:26:53,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-04-08 09:26:53,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-04-08 09:26:53,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-04-08 09:26:53,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:26:53,309 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:26:53,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-04-08 09:26:53,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-04-08 09:26:53,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-04-08 09:26:53,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-04-08 09:26:53,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-04-08 09:26:53,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-04-08 09:26:53,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-04-08 09:26:53,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-04-08 09:26:53,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-04-08 09:26:53,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-04-08 09:26:53,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-04-08 09:26:53,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-04-08 09:26:53,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-04-08 09:26:53,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-04-08 09:26:53,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-04-08 09:26:53,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-04-08 09:26:53,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-04-08 09:26:53,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-04-08 09:26:53,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:26:53,371 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:26:53,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:53 WrapperNode [2022-04-08 09:26:53,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:26:53,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:26:53,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:26:53,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:26:53,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:53" (1/1) ... [2022-04-08 09:26:53,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:53" (1/1) ... [2022-04-08 09:26:53,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:53" (1/1) ... [2022-04-08 09:26:53,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:53" (1/1) ... [2022-04-08 09:26:53,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:53" (1/1) ... [2022-04-08 09:26:53,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:53" (1/1) ... [2022-04-08 09:26:53,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:53" (1/1) ... [2022-04-08 09:26:53,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:26:53,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:26:53,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:26:53,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:26:53,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:53" (1/1) ... [2022-04-08 09:26:53,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:26:53,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:26:53,460 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-04-08 09:26:53,482 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-04-08 09:26:53,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:26:53,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:26:53,505 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:26:53,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:26:53,505 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:26:53,506 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:26:53,506 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:26:53,506 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:26:53,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:26:53,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:26:53,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:26:53,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:26:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:26:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:26:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:26:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:26:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:26:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:26:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:26:53,595 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:26:53,596 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:26:53,882 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:26:53,889 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:26:53,889 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-08 09:26:53,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:26:53 BoogieIcfgContainer [2022-04-08 09:26:53,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:26:53,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:26:53,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:26:53,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:26:53,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:26:53" (1/3) ... [2022-04-08 09:26:53,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794bec38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:26:53, skipping insertion in model container [2022-04-08 09:26:53,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:53" (2/3) ... [2022-04-08 09:26:53,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794bec38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:26:53, skipping insertion in model container [2022-04-08 09:26:53,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:26:53" (3/3) ... [2022-04-08 09:26:53,897 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2022-04-08 09:26:53,902 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:26:53,902 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-04-08 09:26:53,951 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:26:53,957 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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 [2022-04-08 09:26:53,957 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-04-08 09:26:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:26:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 09:26:53,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:26:53,982 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:26:53,982 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:26:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:26:53,993 INFO L85 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 1 times [2022-04-08 09:26:53,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:53,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961815318] [2022-04-08 09:26:54,008 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:26:54,008 INFO L85 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 2 times [2022-04-08 09:26:54,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:26:54,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924713918] [2022-04-08 09:26:54,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:26:54,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:26:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:54,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:26:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:54,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {90#true} is VALID [2022-04-08 09:26:54,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} assume true; {90#true} is VALID [2022-04-08 09:26:54,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} #225#return; {90#true} is VALID [2022-04-08 09:26:54,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {90#true} call ULTIMATE.init(); {96#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:26:54,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {90#true} is VALID [2022-04-08 09:26:54,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2022-04-08 09:26:54,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #225#return; {90#true} is VALID [2022-04-08 09:26:54,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} call #t~ret11 := main(); {90#true} is VALID [2022-04-08 09:26:54,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {90#true} is VALID [2022-04-08 09:26:54,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} assume !!(~main__urilen~0 <= 1000000); {90#true} is VALID [2022-04-08 09:26:54,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {90#true} assume !!(~main__urilen~0 >= -1000000); {90#true} is VALID [2022-04-08 09:26:54,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {90#true} assume !!(~main__tokenlen~0 <= 1000000); {90#true} is VALID [2022-04-08 09:26:54,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {90#true} assume !!(~main__tokenlen~0 >= -1000000); {90#true} is VALID [2022-04-08 09:26:54,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {90#true} assume !!(~main__scheme~0 <= 1000000); {90#true} is VALID [2022-04-08 09:26:54,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {90#true} assume !!(~main__scheme~0 >= -1000000); {90#true} is VALID [2022-04-08 09:26:54,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {90#true} assume ~main__urilen~0 > 0; {90#true} is VALID [2022-04-08 09:26:54,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {90#true} assume ~main__tokenlen~0 > 0; {90#true} is VALID [2022-04-08 09:26:54,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {90#true} assume ~main__scheme~0 >= 0; {90#true} is VALID [2022-04-08 09:26:54,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {90#true} assume !(0 == ~main__scheme~0); {90#true} is VALID [2022-04-08 09:26:54,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {90#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {95#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-08 09:26:54,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {95#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {91#false} is VALID [2022-04-08 09:26:54,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {91#false} assume !false; {91#false} is VALID [2022-04-08 09:26:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:54,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:26:54,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924713918] [2022-04-08 09:26:54,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924713918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:54,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:54,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:26:54,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:26:54,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961815318] [2022-04-08 09:26:54,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961815318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:54,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:54,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:26:54,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302151168] [2022-04-08 09:26:54,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:26:54,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 09:26:54,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:26:54,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:54,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:54,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:26:54,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:26:54,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:26:54,334 INFO L87 Difference]: Start difference. First operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:54,697 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2022-04-08 09:26:54,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:26:54,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 09:26:54,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:26:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-08 09:26:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-08 09:26:54,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2022-04-08 09:26:54,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:54,870 INFO L225 Difference]: With dead ends: 93 [2022-04-08 09:26:54,870 INFO L226 Difference]: Without dead ends: 80 [2022-04-08 09:26:54,873 INFO L912 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-04-08 09:26:54,880 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 170 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:26:54,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 105 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:26:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-08 09:26:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-08 09:26:54,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:26:54,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:54,920 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:54,920 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:54,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:54,927 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-08 09:26:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-08 09:26:54,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:54,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:54,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-08 09:26:54,929 INFO L87 Difference]: Start difference. First operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-08 09:26:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:54,945 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-08 09:26:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-08 09:26:54,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:54,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:54,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:26:54,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:26:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-04-08 09:26:54,958 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2022-04-08 09:26:54,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:26:54,959 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-04-08 09:26:54,961 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:54,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 83 transitions. [2022-04-08 09:26:55,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:55,052 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-08 09:26:55,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:26:55,053 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:26:55,053 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:26:55,053 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:26:55,053 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:26:55,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:26:55,055 INFO L85 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 1 times [2022-04-08 09:26:55,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:55,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1236704682] [2022-04-08 09:26:55,059 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:26:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 2 times [2022-04-08 09:26:55,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:26:55,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122286077] [2022-04-08 09:26:55,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:26:55,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:26:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:55,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:26:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:55,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {607#true} is VALID [2022-04-08 09:26:55,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {607#true} assume true; {607#true} is VALID [2022-04-08 09:26:55,169 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {607#true} {607#true} #225#return; {607#true} is VALID [2022-04-08 09:26:55,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {607#true} call ULTIMATE.init(); {616#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:26:55,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {607#true} is VALID [2022-04-08 09:26:55,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {607#true} assume true; {607#true} is VALID [2022-04-08 09:26:55,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {607#true} {607#true} #225#return; {607#true} is VALID [2022-04-08 09:26:55,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {607#true} call #t~ret11 := main(); {607#true} is VALID [2022-04-08 09:26:55,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {607#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {607#true} is VALID [2022-04-08 09:26:55,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {607#true} assume !!(~main__urilen~0 <= 1000000); {607#true} is VALID [2022-04-08 09:26:55,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {607#true} assume !!(~main__urilen~0 >= -1000000); {607#true} is VALID [2022-04-08 09:26:55,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {607#true} assume !!(~main__tokenlen~0 <= 1000000); {607#true} is VALID [2022-04-08 09:26:55,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {607#true} assume !!(~main__tokenlen~0 >= -1000000); {607#true} is VALID [2022-04-08 09:26:55,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {607#true} assume !!(~main__scheme~0 <= 1000000); {607#true} is VALID [2022-04-08 09:26:55,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {607#true} assume !!(~main__scheme~0 >= -1000000); {607#true} is VALID [2022-04-08 09:26:55,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {607#true} assume ~main__urilen~0 > 0; {607#true} is VALID [2022-04-08 09:26:55,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {607#true} assume ~main__tokenlen~0 > 0; {607#true} is VALID [2022-04-08 09:26:55,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {607#true} assume ~main__scheme~0 >= 0; {612#(< 0 (+ main_~main__scheme~0 1))} is VALID [2022-04-08 09:26:55,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {612#(< 0 (+ main_~main__scheme~0 1))} assume !(0 == ~main__scheme~0); {613#(not (<= main_~main__scheme~0 0))} is VALID [2022-04-08 09:26:55,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {613#(not (<= main_~main__scheme~0 0))} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {614#(<= 1 main_~main__cp~0)} is VALID [2022-04-08 09:26:55,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {615#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-08 09:26:55,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {615#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {608#false} is VALID [2022-04-08 09:26:55,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {608#false} assume !false; {608#false} is VALID [2022-04-08 09:26:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:55,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:26:55,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122286077] [2022-04-08 09:26:55,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122286077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:55,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:55,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:26:55,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:26:55,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1236704682] [2022-04-08 09:26:55,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1236704682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:55,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:55,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:26:55,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673780358] [2022-04-08 09:26:55,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:26:55,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 09:26:55,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:26:55,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:55,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:55,197 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:26:55,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:55,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:26:55,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:26:55,198 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:55,699 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-08 09:26:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:26:55,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 09:26:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:26:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-04-08 09:26:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-04-08 09:26:55,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 83 transitions. [2022-04-08 09:26:55,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:55,796 INFO L225 Difference]: With dead ends: 80 [2022-04-08 09:26:55,796 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 09:26:55,796 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:26:55,802 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 319 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:26:55,803 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 74 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:26:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 09:26:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-08 09:26:55,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:26:55,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:55,885 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:55,886 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:55,893 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-08 09:26:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 09:26:55,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:55,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:55,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-08 09:26:55,904 INFO L87 Difference]: Start difference. First operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-08 09:26:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:55,907 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-08 09:26:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 09:26:55,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:55,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:55,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:26:55,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:26:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-08 09:26:55,911 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2022-04-08 09:26:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:26:55,911 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-08 09:26:55,911 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:55,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-08 09:26:55,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 09:26:55,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 09:26:55,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:26:55,999 INFO L499 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-04-08 09:26:55,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:26:55,999 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:26:56,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:26:56,000 INFO L85 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 1 times [2022-04-08 09:26:56,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:56,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1444247212] [2022-04-08 09:26:56,002 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:26:56,002 INFO L85 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 2 times [2022-04-08 09:26:56,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:26:56,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89299028] [2022-04-08 09:26:56,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:26:56,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:26:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:56,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:26:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:56,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {1106#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1099#true} is VALID [2022-04-08 09:26:56,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-08 09:26:56,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1099#true} {1099#true} #225#return; {1099#true} is VALID [2022-04-08 09:26:56,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {1099#true} call ULTIMATE.init(); {1106#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:26:56,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {1106#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1099#true} is VALID [2022-04-08 09:26:56,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-08 09:26:56,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#true} {1099#true} #225#return; {1099#true} is VALID [2022-04-08 09:26:56,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#true} call #t~ret11 := main(); {1099#true} is VALID [2022-04-08 09:26:56,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {1099#true} is VALID [2022-04-08 09:26:56,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {1099#true} assume !!(~main__urilen~0 <= 1000000); {1099#true} is VALID [2022-04-08 09:26:56,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#true} assume !!(~main__urilen~0 >= -1000000); {1099#true} is VALID [2022-04-08 09:26:56,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#true} assume !!(~main__tokenlen~0 <= 1000000); {1099#true} is VALID [2022-04-08 09:26:56,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {1099#true} assume !!(~main__tokenlen~0 >= -1000000); {1099#true} is VALID [2022-04-08 09:26:56,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {1099#true} assume !!(~main__scheme~0 <= 1000000); {1099#true} is VALID [2022-04-08 09:26:56,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {1099#true} assume !!(~main__scheme~0 >= -1000000); {1099#true} is VALID [2022-04-08 09:26:56,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {1099#true} assume ~main__urilen~0 > 0; {1099#true} is VALID [2022-04-08 09:26:56,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {1099#true} assume ~main__tokenlen~0 > 0; {1099#true} is VALID [2022-04-08 09:26:56,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {1099#true} assume ~main__scheme~0 >= 0; {1099#true} is VALID [2022-04-08 09:26:56,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {1099#true} assume !(0 == ~main__scheme~0); {1099#true} is VALID [2022-04-08 09:26:56,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {1099#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:26:56,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:26:56,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:26:56,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1105#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-08 09:26:56,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {1105#(not (= main_~__VERIFIER_assert__cond~2 0))} assume 0 == ~__VERIFIER_assert__cond~2; {1100#false} is VALID [2022-04-08 09:26:56,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {1100#false} assume !false; {1100#false} is VALID [2022-04-08 09:26:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:56,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:26:56,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89299028] [2022-04-08 09:26:56,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89299028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:56,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:56,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:26:56,105 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:26:56,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1444247212] [2022-04-08 09:26:56,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1444247212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:56,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:56,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:26:56,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573208440] [2022-04-08 09:26:56,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:26:56,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 09:26:56,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:26:56,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:56,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:56,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:26:56,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:56,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:26:56,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:26:56,122 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:56,532 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-04-08 09:26:56,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:26:56,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 09:26:56,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:26:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-04-08 09:26:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-04-08 09:26:56,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 106 transitions. [2022-04-08 09:26:56,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:56,655 INFO L225 Difference]: With dead ends: 101 [2022-04-08 09:26:56,655 INFO L226 Difference]: Without dead ends: 99 [2022-04-08 09:26:56,655 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:26:56,656 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 207 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:26:56,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 78 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:26:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-08 09:26:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2022-04-08 09:26:56,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:26:56,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:56,750 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:56,750 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:56,754 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-08 09:26:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-08 09:26:56,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:56,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:56,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-08 09:26:56,756 INFO L87 Difference]: Start difference. First operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-08 09:26:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:56,763 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-08 09:26:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-08 09:26:56,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:56,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:56,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:26:56,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:26:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-08 09:26:56,767 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2022-04-08 09:26:56,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:26:56,768 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-08 09:26:56,769 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:56,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 79 transitions. [2022-04-08 09:26:56,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:56,855 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-08 09:26:56,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 09:26:56,857 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:26:56,857 INFO L499 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-04-08 09:26:56,857 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 09:26:56,857 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:26:56,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:26:56,857 INFO L85 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 1 times [2022-04-08 09:26:56,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:56,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [18585273] [2022-04-08 09:26:56,858 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:26:56,858 INFO L85 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 2 times [2022-04-08 09:26:56,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:26:56,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652257842] [2022-04-08 09:26:56,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:26:56,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:26:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:56,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:26:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:56,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {1675#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1667#true} is VALID [2022-04-08 09:26:56,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {1667#true} assume true; {1667#true} is VALID [2022-04-08 09:26:56,977 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1667#true} {1667#true} #225#return; {1667#true} is VALID [2022-04-08 09:26:56,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {1667#true} call ULTIMATE.init(); {1675#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:26:56,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {1675#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1667#true} is VALID [2022-04-08 09:26:56,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {1667#true} assume true; {1667#true} is VALID [2022-04-08 09:26:56,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1667#true} {1667#true} #225#return; {1667#true} is VALID [2022-04-08 09:26:56,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {1667#true} call #t~ret11 := main(); {1667#true} is VALID [2022-04-08 09:26:56,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {1667#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {1667#true} is VALID [2022-04-08 09:26:56,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {1667#true} assume !!(~main__urilen~0 <= 1000000); {1667#true} is VALID [2022-04-08 09:26:56,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {1667#true} assume !!(~main__urilen~0 >= -1000000); {1667#true} is VALID [2022-04-08 09:26:56,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {1667#true} assume !!(~main__tokenlen~0 <= 1000000); {1667#true} is VALID [2022-04-08 09:26:56,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {1667#true} assume !!(~main__tokenlen~0 >= -1000000); {1667#true} is VALID [2022-04-08 09:26:56,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {1667#true} assume !!(~main__scheme~0 <= 1000000); {1667#true} is VALID [2022-04-08 09:26:56,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {1667#true} assume !!(~main__scheme~0 >= -1000000); {1667#true} is VALID [2022-04-08 09:26:56,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {1667#true} assume ~main__urilen~0 > 0; {1667#true} is VALID [2022-04-08 09:26:56,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {1667#true} assume ~main__tokenlen~0 > 0; {1667#true} is VALID [2022-04-08 09:26:56,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {1667#true} assume ~main__scheme~0 >= 0; {1672#(<= 0 main_~main__scheme~0)} is VALID [2022-04-08 09:26:56,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {1672#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {1672#(<= 0 main_~main__scheme~0)} is VALID [2022-04-08 09:26:56,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {1672#(<= 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1673#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:26:56,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {1673#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1673#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:26:56,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {1673#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {1673#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:26:56,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {1673#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1673#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:26:56,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {1673#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1674#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-08 09:26:56,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {1674#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {1668#false} is VALID [2022-04-08 09:26:56,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {1668#false} assume !false; {1668#false} is VALID [2022-04-08 09:26:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:56,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:26:56,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652257842] [2022-04-08 09:26:56,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652257842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:56,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:56,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:26:56,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:26:56,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [18585273] [2022-04-08 09:26:56,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [18585273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:56,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:56,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:26:56,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815428227] [2022-04-08 09:26:56,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:26:56,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 09:26:56,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:26:56,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:57,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:57,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:26:57,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:57,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:26:57,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:26:57,003 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:57,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:57,361 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-08 09:26:57,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:26:57,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 09:26:57,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:26:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-08 09:26:57,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-08 09:26:57,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2022-04-08 09:26:57,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:57,438 INFO L225 Difference]: With dead ends: 76 [2022-04-08 09:26:57,438 INFO L226 Difference]: Without dead ends: 74 [2022-04-08 09:26:57,438 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 09:26:57,439 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 234 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:26:57,440 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 70 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:26:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-08 09:26:57,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-08 09:26:57,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:26:57,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:57,573 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:57,573 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:57,576 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-08 09:26:57,576 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-08 09:26:57,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:57,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:57,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-08 09:26:57,577 INFO L87 Difference]: Start difference. First operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-08 09:26:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:57,579 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-08 09:26:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-08 09:26:57,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:57,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:57,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:26:57,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:26:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-04-08 09:26:57,581 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2022-04-08 09:26:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:26:57,582 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-04-08 09:26:57,582 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:57,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 77 transitions. [2022-04-08 09:26:57,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:57,668 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-08 09:26:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 09:26:57,669 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:26:57,669 INFO L499 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] [2022-04-08 09:26:57,669 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 09:26:57,669 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:26:57,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:26:57,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 1 times [2022-04-08 09:26:57,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:57,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [296882020] [2022-04-08 09:26:57,670 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:26:57,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 2 times [2022-04-08 09:26:57,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:26:57,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212256691] [2022-04-08 09:26:57,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:26:57,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:26:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:57,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:26:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:57,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {2140#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2132#true} is VALID [2022-04-08 09:26:57,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {2132#true} assume true; {2132#true} is VALID [2022-04-08 09:26:57,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2132#true} {2132#true} #225#return; {2132#true} is VALID [2022-04-08 09:26:57,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {2132#true} call ULTIMATE.init(); {2140#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:26:57,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {2140#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2132#true} is VALID [2022-04-08 09:26:57,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {2132#true} assume true; {2132#true} is VALID [2022-04-08 09:26:57,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2132#true} {2132#true} #225#return; {2132#true} is VALID [2022-04-08 09:26:57,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {2132#true} call #t~ret11 := main(); {2132#true} is VALID [2022-04-08 09:26:57,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {2132#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {2132#true} is VALID [2022-04-08 09:26:57,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {2132#true} assume !!(~main__urilen~0 <= 1000000); {2132#true} is VALID [2022-04-08 09:26:57,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {2132#true} assume !!(~main__urilen~0 >= -1000000); {2132#true} is VALID [2022-04-08 09:26:57,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {2132#true} assume !!(~main__tokenlen~0 <= 1000000); {2132#true} is VALID [2022-04-08 09:26:57,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {2132#true} assume !!(~main__tokenlen~0 >= -1000000); {2132#true} is VALID [2022-04-08 09:26:57,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {2132#true} assume !!(~main__scheme~0 <= 1000000); {2132#true} is VALID [2022-04-08 09:26:57,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {2132#true} assume !!(~main__scheme~0 >= -1000000); {2132#true} is VALID [2022-04-08 09:26:57,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {2132#true} assume ~main__urilen~0 > 0; {2132#true} is VALID [2022-04-08 09:26:57,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {2132#true} assume ~main__tokenlen~0 > 0; {2132#true} is VALID [2022-04-08 09:26:57,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {2132#true} assume ~main__scheme~0 >= 0; {2132#true} is VALID [2022-04-08 09:26:57,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {2132#true} assume !(0 == ~main__scheme~0); {2132#true} is VALID [2022-04-08 09:26:57,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {2132#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2132#true} is VALID [2022-04-08 09:26:57,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {2132#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2132#true} is VALID [2022-04-08 09:26:57,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {2132#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {2132#true} is VALID [2022-04-08 09:26:57,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {2132#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2137#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-08 09:26:57,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {2137#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:26:57,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~3); {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:26:57,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:26:57,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {2139#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-08 09:26:57,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {2139#(not (= main_~__VERIFIER_assert__cond~16 0))} assume 0 == ~__VERIFIER_assert__cond~16; {2133#false} is VALID [2022-04-08 09:26:57,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {2133#false} assume !false; {2133#false} is VALID [2022-04-08 09:26:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:57,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:26:57,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212256691] [2022-04-08 09:26:57,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212256691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:57,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:57,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:26:57,793 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:26:57,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [296882020] [2022-04-08 09:26:57,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [296882020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:57,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:57,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:26:57,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490900431] [2022-04-08 09:26:57,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:26:57,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 09:26:57,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:26:57,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:57,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:57,813 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:26:57,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:57,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:26:57,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:26:57,815 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:58,818 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-04-08 09:26:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:26:58,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 09:26:58,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:26:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2022-04-08 09:26:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2022-04-08 09:26:58,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 147 transitions. [2022-04-08 09:26:58,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:58,954 INFO L225 Difference]: With dead ends: 141 [2022-04-08 09:26:58,954 INFO L226 Difference]: Without dead ends: 139 [2022-04-08 09:26:58,954 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:26:58,955 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 235 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:26:58,955 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 125 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:26:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-08 09:26:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2022-04-08 09:26:59,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:26:59,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:59,122 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:59,122 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:59,126 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-08 09:26:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-08 09:26:59,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:59,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:59,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-08 09:26:59,127 INFO L87 Difference]: Start difference. First operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-08 09:26:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:59,130 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-08 09:26:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-08 09:26:59,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:59,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:59,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:26:59,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:26:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-08 09:26:59,132 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2022-04-08 09:26:59,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:26:59,132 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-08 09:26:59,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:59,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 82 transitions. [2022-04-08 09:26:59,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-08 09:26:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 09:26:59,243 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:26:59,243 INFO L499 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] [2022-04-08 09:26:59,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 09:26:59,244 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:26:59,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:26:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 1 times [2022-04-08 09:26:59,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:59,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1966188405] [2022-04-08 09:26:59,245 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:26:59,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 2 times [2022-04-08 09:26:59,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:26:59,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578126730] [2022-04-08 09:26:59,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:26:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:26:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:26:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:59,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {2875#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2867#true} is VALID [2022-04-08 09:26:59,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {2867#true} assume true; {2867#true} is VALID [2022-04-08 09:26:59,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2867#true} {2867#true} #225#return; {2867#true} is VALID [2022-04-08 09:26:59,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {2867#true} call ULTIMATE.init(); {2875#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:26:59,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {2875#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2867#true} is VALID [2022-04-08 09:26:59,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {2867#true} assume true; {2867#true} is VALID [2022-04-08 09:26:59,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2867#true} {2867#true} #225#return; {2867#true} is VALID [2022-04-08 09:26:59,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {2867#true} call #t~ret11 := main(); {2867#true} is VALID [2022-04-08 09:26:59,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {2867#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {2867#true} is VALID [2022-04-08 09:26:59,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {2867#true} assume !!(~main__urilen~0 <= 1000000); {2867#true} is VALID [2022-04-08 09:26:59,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {2867#true} assume !!(~main__urilen~0 >= -1000000); {2867#true} is VALID [2022-04-08 09:26:59,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {2867#true} assume !!(~main__tokenlen~0 <= 1000000); {2867#true} is VALID [2022-04-08 09:26:59,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {2867#true} assume !!(~main__tokenlen~0 >= -1000000); {2867#true} is VALID [2022-04-08 09:26:59,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {2867#true} assume !!(~main__scheme~0 <= 1000000); {2867#true} is VALID [2022-04-08 09:26:59,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {2867#true} assume !!(~main__scheme~0 >= -1000000); {2867#true} is VALID [2022-04-08 09:26:59,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {2867#true} assume ~main__urilen~0 > 0; {2867#true} is VALID [2022-04-08 09:26:59,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {2867#true} assume ~main__tokenlen~0 > 0; {2867#true} is VALID [2022-04-08 09:26:59,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {2867#true} assume ~main__scheme~0 >= 0; {2867#true} is VALID [2022-04-08 09:26:59,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {2867#true} assume !(0 == ~main__scheme~0); {2867#true} is VALID [2022-04-08 09:26:59,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {2867#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2867#true} is VALID [2022-04-08 09:26:59,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {2867#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2867#true} is VALID [2022-04-08 09:26:59,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {2867#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {2867#true} is VALID [2022-04-08 09:26:59,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {2867#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2872#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-08 09:26:59,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {2872#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:26:59,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~3); {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:26:59,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(~main__cp~0 != ~main__urilen~0 - 1); {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:26:59,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2874#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-08 09:26:59,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {2874#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {2868#false} is VALID [2022-04-08 09:26:59,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {2868#false} assume !false; {2868#false} is VALID [2022-04-08 09:26:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:59,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:26:59,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578126730] [2022-04-08 09:26:59,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578126730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:59,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:59,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:26:59,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:26:59,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1966188405] [2022-04-08 09:26:59,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1966188405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:59,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:59,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:26:59,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161305930] [2022-04-08 09:26:59,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:26:59,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 09:26:59,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:26:59,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:59,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:59,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:26:59,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:59,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:26:59,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:26:59,342 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:00,117 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2022-04-08 09:27:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:27:00,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 09:27:00,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-04-08 09:27:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-04-08 09:27:00,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 114 transitions. [2022-04-08 09:27:00,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:00,234 INFO L225 Difference]: With dead ends: 108 [2022-04-08 09:27:00,234 INFO L226 Difference]: Without dead ends: 106 [2022-04-08 09:27:00,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:27:00,235 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 220 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:00,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 81 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:27:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-08 09:27:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2022-04-08 09:27:00,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:00,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:00,399 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:00,399 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:00,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:00,402 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-08 09:27:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-08 09:27:00,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:00,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:00,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-08 09:27:00,403 INFO L87 Difference]: Start difference. First operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-08 09:27:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:00,406 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-08 09:27:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-08 09:27:00,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:00,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:00,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:00,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-04-08 09:27:00,408 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2022-04-08 09:27:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:00,409 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-04-08 09:27:00,409 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:00,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 84 transitions. [2022-04-08 09:27:00,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:00,527 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-08 09:27:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 09:27:00,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:00,527 INFO L499 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-04-08 09:27:00,528 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 09:27:00,528 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:00,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:00,528 INFO L85 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 1 times [2022-04-08 09:27:00,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:00,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1543585583] [2022-04-08 09:27:00,529 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 2 times [2022-04-08 09:27:00,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:00,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296562840] [2022-04-08 09:27:00,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:00,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:00,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:00,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {3483#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {3475#true} is VALID [2022-04-08 09:27:00,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {3475#true} assume true; {3475#true} is VALID [2022-04-08 09:27:00,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3475#true} {3475#true} #225#return; {3475#true} is VALID [2022-04-08 09:27:00,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {3475#true} call ULTIMATE.init(); {3483#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:00,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {3483#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {3475#true} is VALID [2022-04-08 09:27:00,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {3475#true} assume true; {3475#true} is VALID [2022-04-08 09:27:00,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3475#true} {3475#true} #225#return; {3475#true} is VALID [2022-04-08 09:27:00,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {3475#true} call #t~ret11 := main(); {3475#true} is VALID [2022-04-08 09:27:00,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {3475#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {3475#true} is VALID [2022-04-08 09:27:00,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {3475#true} assume !!(~main__urilen~0 <= 1000000); {3475#true} is VALID [2022-04-08 09:27:00,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {3475#true} assume !!(~main__urilen~0 >= -1000000); {3475#true} is VALID [2022-04-08 09:27:00,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {3475#true} assume !!(~main__tokenlen~0 <= 1000000); {3475#true} is VALID [2022-04-08 09:27:00,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {3475#true} assume !!(~main__tokenlen~0 >= -1000000); {3475#true} is VALID [2022-04-08 09:27:00,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {3475#true} assume !!(~main__scheme~0 <= 1000000); {3475#true} is VALID [2022-04-08 09:27:00,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {3475#true} assume !!(~main__scheme~0 >= -1000000); {3475#true} is VALID [2022-04-08 09:27:00,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {3475#true} assume ~main__urilen~0 > 0; {3475#true} is VALID [2022-04-08 09:27:00,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {3475#true} assume ~main__tokenlen~0 > 0; {3475#true} is VALID [2022-04-08 09:27:00,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {3475#true} assume ~main__scheme~0 >= 0; {3475#true} is VALID [2022-04-08 09:27:00,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {3475#true} assume !(0 == ~main__scheme~0); {3475#true} is VALID [2022-04-08 09:27:00,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {3475#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3475#true} is VALID [2022-04-08 09:27:00,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {3475#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3475#true} is VALID [2022-04-08 09:27:00,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {3475#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {3475#true} is VALID [2022-04-08 09:27:00,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {3475#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3475#true} is VALID [2022-04-08 09:27:00,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {3475#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3480#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} is VALID [2022-04-08 09:27:00,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {3480#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~3); {3481#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:00,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {3481#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {3481#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:00,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {3481#(<= 0 main_~main__cp~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {3481#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:00,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {3481#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {3482#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-08 09:27:00,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {3482#(not (= main_~__VERIFIER_assert__cond~17 0))} assume 0 == ~__VERIFIER_assert__cond~17; {3476#false} is VALID [2022-04-08 09:27:00,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {3476#false} assume !false; {3476#false} is VALID [2022-04-08 09:27:00,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:00,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:00,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296562840] [2022-04-08 09:27:00,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296562840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:00,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:00,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:00,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:00,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1543585583] [2022-04-08 09:27:00,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1543585583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:00,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:00,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:00,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065452526] [2022-04-08 09:27:00,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:00,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 09:27:00,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:00,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:00,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:00,627 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:00,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:00,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:00,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:00,628 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:01,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:01,244 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2022-04-08 09:27:01,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:27:01,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 09:27:01,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2022-04-08 09:27:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2022-04-08 09:27:01,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 125 transitions. [2022-04-08 09:27:01,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:01,354 INFO L225 Difference]: With dead ends: 121 [2022-04-08 09:27:01,354 INFO L226 Difference]: Without dead ends: 119 [2022-04-08 09:27:01,354 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 09:27:01,355 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 215 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:01,355 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 104 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:01,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-08 09:27:01,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2022-04-08 09:27:01,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:01,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:01,533 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:01,534 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:01,536 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-08 09:27:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-08 09:27:01,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:01,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:01,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states. [2022-04-08 09:27:01,537 INFO L87 Difference]: Start difference. First operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states. [2022-04-08 09:27:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:01,540 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-08 09:27:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-08 09:27:01,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:01,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:01,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:01,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-08 09:27:01,543 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2022-04-08 09:27:01,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:01,543 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-08 09:27:01,544 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:01,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 82 transitions. [2022-04-08 09:27:01,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:01,665 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-08 09:27:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 09:27:01,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:01,666 INFO L499 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-04-08 09:27:01,666 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 09:27:01,666 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:01,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:01,666 INFO L85 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 1 times [2022-04-08 09:27:01,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:01,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [438358488] [2022-04-08 09:27:01,667 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:01,667 INFO L85 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 2 times [2022-04-08 09:27:01,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:01,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985586897] [2022-04-08 09:27:01,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:01,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:01,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:01,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {4134#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4126#true} is VALID [2022-04-08 09:27:01,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {4126#true} assume true; {4126#true} is VALID [2022-04-08 09:27:01,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4126#true} {4126#true} #225#return; {4126#true} is VALID [2022-04-08 09:27:01,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {4126#true} call ULTIMATE.init(); {4134#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:01,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {4134#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4126#true} is VALID [2022-04-08 09:27:01,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {4126#true} assume true; {4126#true} is VALID [2022-04-08 09:27:01,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4126#true} {4126#true} #225#return; {4126#true} is VALID [2022-04-08 09:27:01,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {4126#true} call #t~ret11 := main(); {4126#true} is VALID [2022-04-08 09:27:01,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {4126#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {4126#true} is VALID [2022-04-08 09:27:01,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {4126#true} assume !!(~main__urilen~0 <= 1000000); {4126#true} is VALID [2022-04-08 09:27:01,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {4126#true} assume !!(~main__urilen~0 >= -1000000); {4126#true} is VALID [2022-04-08 09:27:01,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {4126#true} assume !!(~main__tokenlen~0 <= 1000000); {4126#true} is VALID [2022-04-08 09:27:01,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {4126#true} assume !!(~main__tokenlen~0 >= -1000000); {4126#true} is VALID [2022-04-08 09:27:01,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {4126#true} assume !!(~main__scheme~0 <= 1000000); {4126#true} is VALID [2022-04-08 09:27:01,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {4126#true} assume !!(~main__scheme~0 >= -1000000); {4126#true} is VALID [2022-04-08 09:27:01,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {4126#true} assume ~main__urilen~0 > 0; {4126#true} is VALID [2022-04-08 09:27:01,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {4126#true} assume ~main__tokenlen~0 > 0; {4126#true} is VALID [2022-04-08 09:27:01,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {4126#true} assume ~main__scheme~0 >= 0; {4126#true} is VALID [2022-04-08 09:27:01,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {4126#true} assume !(0 == ~main__scheme~0); {4126#true} is VALID [2022-04-08 09:27:01,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {4126#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4126#true} is VALID [2022-04-08 09:27:01,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {4126#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4126#true} is VALID [2022-04-08 09:27:01,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {4126#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {4126#true} is VALID [2022-04-08 09:27:01,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {4126#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4126#true} is VALID [2022-04-08 09:27:01,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {4126#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4131#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} is VALID [2022-04-08 09:27:01,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {4131#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~3); {4132#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:01,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {4132#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 != ~main__urilen~0 - 1); {4132#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:01,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {4132#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4132#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:01,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {4132#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {4133#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-08 09:27:01,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {4133#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {4127#false} is VALID [2022-04-08 09:27:01,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {4127#false} assume !false; {4127#false} is VALID [2022-04-08 09:27:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:01,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:01,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985586897] [2022-04-08 09:27:01,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985586897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:01,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:01,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:01,783 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:01,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [438358488] [2022-04-08 09:27:01,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [438358488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:01,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:01,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:01,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918836577] [2022-04-08 09:27:01,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:01,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 09:27:01,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:01,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:01,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:01,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:01,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:01,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:01,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:01,803 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:02,226 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-04-08 09:27:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:27:02,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 09:27:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-08 09:27:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-08 09:27:02,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-08 09:27:02,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:02,305 INFO L225 Difference]: With dead ends: 77 [2022-04-08 09:27:02,305 INFO L226 Difference]: Without dead ends: 75 [2022-04-08 09:27:02,306 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 09:27:02,306 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 197 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:02,307 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 70 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:02,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-08 09:27:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-08 09:27:02,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:02,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,439 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,439 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:02,441 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-08 09:27:02,441 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-08 09:27:02,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:02,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:02,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-08 09:27:02,442 INFO L87 Difference]: Start difference. First operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-08 09:27:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:02,444 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-08 09:27:02,444 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-08 09:27:02,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:02,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:02,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:02,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-04-08 09:27:02,446 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2022-04-08 09:27:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:02,447 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-04-08 09:27:02,447 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 80 transitions. [2022-04-08 09:27:02,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-08 09:27:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 09:27:02,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:02,554 INFO L499 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-04-08 09:27:02,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 09:27:02,555 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:02,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:02,555 INFO L85 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 1 times [2022-04-08 09:27:02,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:02,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [34067969] [2022-04-08 09:27:02,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 2 times [2022-04-08 09:27:02,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:02,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909541274] [2022-04-08 09:27:02,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:02,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:02,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:02,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {4603#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4597#true} is VALID [2022-04-08 09:27:02,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {4597#true} assume true; {4597#true} is VALID [2022-04-08 09:27:02,604 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4597#true} {4597#true} #225#return; {4597#true} is VALID [2022-04-08 09:27:02,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {4597#true} call ULTIMATE.init(); {4603#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:02,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {4603#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4597#true} is VALID [2022-04-08 09:27:02,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {4597#true} assume true; {4597#true} is VALID [2022-04-08 09:27:02,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4597#true} {4597#true} #225#return; {4597#true} is VALID [2022-04-08 09:27:02,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {4597#true} call #t~ret11 := main(); {4597#true} is VALID [2022-04-08 09:27:02,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {4597#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {4597#true} is VALID [2022-04-08 09:27:02,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {4597#true} assume !!(~main__urilen~0 <= 1000000); {4597#true} is VALID [2022-04-08 09:27:02,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {4597#true} assume !!(~main__urilen~0 >= -1000000); {4597#true} is VALID [2022-04-08 09:27:02,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {4597#true} assume !!(~main__tokenlen~0 <= 1000000); {4597#true} is VALID [2022-04-08 09:27:02,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {4597#true} assume !!(~main__tokenlen~0 >= -1000000); {4597#true} is VALID [2022-04-08 09:27:02,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {4597#true} assume !!(~main__scheme~0 <= 1000000); {4597#true} is VALID [2022-04-08 09:27:02,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {4597#true} assume !!(~main__scheme~0 >= -1000000); {4597#true} is VALID [2022-04-08 09:27:02,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {4597#true} assume ~main__urilen~0 > 0; {4597#true} is VALID [2022-04-08 09:27:02,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {4597#true} assume ~main__tokenlen~0 > 0; {4597#true} is VALID [2022-04-08 09:27:02,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {4597#true} assume ~main__scheme~0 >= 0; {4597#true} is VALID [2022-04-08 09:27:02,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {4597#true} assume !(0 == ~main__scheme~0); {4597#true} is VALID [2022-04-08 09:27:02,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {4597#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4597#true} is VALID [2022-04-08 09:27:02,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {4597#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4597#true} is VALID [2022-04-08 09:27:02,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {4597#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {4597#true} is VALID [2022-04-08 09:27:02,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {4597#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4597#true} is VALID [2022-04-08 09:27:02,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {4597#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4597#true} is VALID [2022-04-08 09:27:02,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {4597#true} assume !(0 == ~__VERIFIER_assert__cond~3); {4597#true} is VALID [2022-04-08 09:27:02,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {4597#true} assume !(~main__cp~0 != ~main__urilen~0 - 1); {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-08 09:27:02,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-08 09:27:02,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-08 09:27:02,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} assume !(0 == ~__VERIFIER_assert__cond~5); {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-08 09:27:02,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4598#false} is VALID [2022-04-08 09:27:02,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {4598#false} assume 0 == ~__VERIFIER_assert__cond~6; {4598#false} is VALID [2022-04-08 09:27:02,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {4598#false} assume !false; {4598#false} is VALID [2022-04-08 09:27:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:02,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:02,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909541274] [2022-04-08 09:27:02,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909541274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:02,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:02,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:27:02,611 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:02,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [34067969] [2022-04-08 09:27:02,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [34067969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:02,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:02,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:27:02,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554031513] [2022-04-08 09:27:02,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:02,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 09:27:02,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:02,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:02,630 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:27:02,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:02,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:27:02,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:27:02,631 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:02,960 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-04-08 09:27:02,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:27:02,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 09:27:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-08 09:27:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-08 09:27:02,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-08 09:27:03,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:03,062 INFO L225 Difference]: With dead ends: 115 [2022-04-08 09:27:03,062 INFO L226 Difference]: Without dead ends: 75 [2022-04-08 09:27:03,062 INFO L912 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-04-08 09:27:03,063 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:03,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 78 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-08 09:27:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-08 09:27:03,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:03,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:03,212 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:03,212 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:03,215 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-08 09:27:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-08 09:27:03,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:03,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:03,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-08 09:27:03,216 INFO L87 Difference]: Start difference. First operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-08 09:27:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:03,217 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-08 09:27:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-08 09:27:03,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:03,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:03,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:03,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-04-08 09:27:03,219 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2022-04-08 09:27:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:03,219 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-04-08 09:27:03,219 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:03,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 78 transitions. [2022-04-08 09:27:03,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-08 09:27:03,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 09:27:03,324 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:03,324 INFO L499 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-04-08 09:27:03,324 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 09:27:03,324 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:03,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:03,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 1 times [2022-04-08 09:27:03,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:03,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1737459155] [2022-04-08 09:27:03,325 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:03,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 2 times [2022-04-08 09:27:03,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:03,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192555436] [2022-04-08 09:27:03,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:03,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:03,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:03,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {5146#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5138#true} is VALID [2022-04-08 09:27:03,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-08 09:27:03,448 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5138#true} {5138#true} #225#return; {5138#true} is VALID [2022-04-08 09:27:03,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5146#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:03,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {5146#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5138#true} is VALID [2022-04-08 09:27:03,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-08 09:27:03,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #225#return; {5138#true} is VALID [2022-04-08 09:27:03,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret11 := main(); {5138#true} is VALID [2022-04-08 09:27:03,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {5138#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {5138#true} is VALID [2022-04-08 09:27:03,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {5138#true} assume !!(~main__urilen~0 <= 1000000); {5138#true} is VALID [2022-04-08 09:27:03,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} assume !!(~main__urilen~0 >= -1000000); {5138#true} is VALID [2022-04-08 09:27:03,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !!(~main__tokenlen~0 <= 1000000); {5138#true} is VALID [2022-04-08 09:27:03,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume !!(~main__tokenlen~0 >= -1000000); {5138#true} is VALID [2022-04-08 09:27:03,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {5138#true} assume !!(~main__scheme~0 <= 1000000); {5138#true} is VALID [2022-04-08 09:27:03,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {5138#true} assume !!(~main__scheme~0 >= -1000000); {5138#true} is VALID [2022-04-08 09:27:03,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {5138#true} assume ~main__urilen~0 > 0; {5138#true} is VALID [2022-04-08 09:27:03,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {5138#true} assume ~main__tokenlen~0 > 0; {5138#true} is VALID [2022-04-08 09:27:03,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} assume ~main__scheme~0 >= 0; {5138#true} is VALID [2022-04-08 09:27:03,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~main__scheme~0); {5138#true} is VALID [2022-04-08 09:27:03,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:03,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:03,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:03,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:03,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:03,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:03,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-08 09:27:03,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(0 == ~main____CPAchecker_TMP_1~0); {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-08 09:27:03,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-08 09:27:03,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-08 09:27:03,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(0 == ~__VERIFIER_assert__cond~5); {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-08 09:27:03,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5145#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-08 09:27:03,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {5145#(not (= main_~__VERIFIER_assert__cond~6 0))} assume 0 == ~__VERIFIER_assert__cond~6; {5139#false} is VALID [2022-04-08 09:27:03,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-08 09:27:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:03,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:03,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192555436] [2022-04-08 09:27:03,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192555436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:03,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:03,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:03,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:03,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1737459155] [2022-04-08 09:27:03,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1737459155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:03,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:03,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:03,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43610813] [2022-04-08 09:27:03,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:03,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 09:27:03,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:03,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:03,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:03,477 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:03,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:03,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:03,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:03,478 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:03,879 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-08 09:27:03,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:27:03,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 09:27:03,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-08 09:27:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-08 09:27:03,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-08 09:27:03,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:03,959 INFO L225 Difference]: With dead ends: 76 [2022-04-08 09:27:03,959 INFO L226 Difference]: Without dead ends: 74 [2022-04-08 09:27:03,960 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:27:03,961 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 183 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:03,962 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 62 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:03,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-08 09:27:04,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-04-08 09:27:04,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:04,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:04,138 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:04,140 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:04,141 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-08 09:27:04,142 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-08 09:27:04,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:04,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:04,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-08 09:27:04,142 INFO L87 Difference]: Start difference. First operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-08 09:27:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:04,144 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-08 09:27:04,144 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-08 09:27:04,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:04,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:04,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:04,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-04-08 09:27:04,146 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2022-04-08 09:27:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:04,146 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-04-08 09:27:04,146 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:04,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 76 transitions. [2022-04-08 09:27:04,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-08 09:27:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 09:27:04,267 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:04,267 INFO L499 BasicCegarLoop]: trace histogram [2, 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] [2022-04-08 09:27:04,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 09:27:04,267 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:04,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:04,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 1 times [2022-04-08 09:27:04,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:04,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1978162480] [2022-04-08 09:27:04,268 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:04,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 2 times [2022-04-08 09:27:04,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:04,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53797362] [2022-04-08 09:27:04,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:04,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:04,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:04,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {5611#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5603#true} is VALID [2022-04-08 09:27:04,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {5603#true} assume true; {5603#true} is VALID [2022-04-08 09:27:04,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5603#true} {5603#true} #225#return; {5603#true} is VALID [2022-04-08 09:27:04,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {5603#true} call ULTIMATE.init(); {5611#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:04,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {5611#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5603#true} is VALID [2022-04-08 09:27:04,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {5603#true} assume true; {5603#true} is VALID [2022-04-08 09:27:04,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5603#true} {5603#true} #225#return; {5603#true} is VALID [2022-04-08 09:27:04,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {5603#true} call #t~ret11 := main(); {5603#true} is VALID [2022-04-08 09:27:04,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {5603#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {5603#true} is VALID [2022-04-08 09:27:04,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {5603#true} assume !!(~main__urilen~0 <= 1000000); {5603#true} is VALID [2022-04-08 09:27:04,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {5603#true} assume !!(~main__urilen~0 >= -1000000); {5603#true} is VALID [2022-04-08 09:27:04,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {5603#true} assume !!(~main__tokenlen~0 <= 1000000); {5603#true} is VALID [2022-04-08 09:27:04,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {5603#true} assume !!(~main__tokenlen~0 >= -1000000); {5603#true} is VALID [2022-04-08 09:27:04,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {5603#true} assume !!(~main__scheme~0 <= 1000000); {5603#true} is VALID [2022-04-08 09:27:04,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {5603#true} assume !!(~main__scheme~0 >= -1000000); {5603#true} is VALID [2022-04-08 09:27:04,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {5603#true} assume ~main__urilen~0 > 0; {5603#true} is VALID [2022-04-08 09:27:04,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {5603#true} assume ~main__tokenlen~0 > 0; {5603#true} is VALID [2022-04-08 09:27:04,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {5603#true} assume ~main__scheme~0 >= 0; {5603#true} is VALID [2022-04-08 09:27:04,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {5603#true} assume !(0 == ~main__scheme~0); {5603#true} is VALID [2022-04-08 09:27:04,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {5603#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5610#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-08 09:27:04,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {5610#(not (= main_~__VERIFIER_assert__cond~16 0))} assume 0 == ~__VERIFIER_assert__cond~16; {5604#false} is VALID [2022-04-08 09:27:04,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {5604#false} assume !false; {5604#false} is VALID [2022-04-08 09:27:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:27:04,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:04,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53797362] [2022-04-08 09:27:04,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53797362] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:27:04,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671896062] [2022-04-08 09:27:04,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:27:04,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:27:04,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:27:04,387 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-04-08 09:27:04,436 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-04-08 09:27:04,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:27:04,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:27:04,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 09:27:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:04,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:27:04,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {5603#true} call ULTIMATE.init(); {5603#true} is VALID [2022-04-08 09:27:04,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {5603#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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5603#true} is VALID [2022-04-08 09:27:04,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {5603#true} assume true; {5603#true} is VALID [2022-04-08 09:27:04,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5603#true} {5603#true} #225#return; {5603#true} is VALID [2022-04-08 09:27:04,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {5603#true} call #t~ret11 := main(); {5603#true} is VALID [2022-04-08 09:27:04,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {5603#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {5603#true} is VALID [2022-04-08 09:27:04,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {5603#true} assume !!(~main__urilen~0 <= 1000000); {5603#true} is VALID [2022-04-08 09:27:04,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {5603#true} assume !!(~main__urilen~0 >= -1000000); {5603#true} is VALID [2022-04-08 09:27:04,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {5603#true} assume !!(~main__tokenlen~0 <= 1000000); {5603#true} is VALID [2022-04-08 09:27:04,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {5603#true} assume !!(~main__tokenlen~0 >= -1000000); {5603#true} is VALID [2022-04-08 09:27:04,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {5603#true} assume !!(~main__scheme~0 <= 1000000); {5603#true} is VALID [2022-04-08 09:27:04,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {5603#true} assume !!(~main__scheme~0 >= -1000000); {5603#true} is VALID [2022-04-08 09:27:04,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {5603#true} assume ~main__urilen~0 > 0; {5603#true} is VALID [2022-04-08 09:27:04,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {5603#true} assume ~main__tokenlen~0 > 0; {5603#true} is VALID [2022-04-08 09:27:04,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {5603#true} assume ~main__scheme~0 >= 0; {5603#true} is VALID [2022-04-08 09:27:04,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {5603#true} assume !(0 == ~main__scheme~0); {5603#true} is VALID [2022-04-08 09:27:04,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {5603#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5696#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID [2022-04-08 09:27:04,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {5696#(<= 1 main_~__VERIFIER_assert__cond~16)} assume 0 == ~__VERIFIER_assert__cond~16; {5604#false} is VALID [2022-04-08 09:27:04,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {5604#false} assume !false; {5604#false} is VALID [2022-04-08 09:27:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:27:04,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:27:04,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {5604#false} assume !false; {5604#false} is VALID [2022-04-08 09:27:04,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {5696#(<= 1 main_~__VERIFIER_assert__cond~16)} assume 0 == ~__VERIFIER_assert__cond~16; {5604#false} is VALID [2022-04-08 09:27:04,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5696#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID [2022-04-08 09:27:04,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {5603#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:04,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {5603#true} assume !(0 == ~main__scheme~0); {5603#true} is VALID [2022-04-08 09:27:04,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {5603#true} assume ~main__scheme~0 >= 0; {5603#true} is VALID [2022-04-08 09:27:04,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {5603#true} assume ~main__tokenlen~0 > 0; {5603#true} is VALID [2022-04-08 09:27:04,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {5603#true} assume ~main__urilen~0 > 0; {5603#true} is VALID [2022-04-08 09:27:04,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {5603#true} assume !!(~main__scheme~0 >= -1000000); {5603#true} is VALID [2022-04-08 09:27:04,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {5603#true} assume !!(~main__scheme~0 <= 1000000); {5603#true} is VALID [2022-04-08 09:27:04,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {5603#true} assume !!(~main__tokenlen~0 >= -1000000); {5603#true} is VALID [2022-04-08 09:27:04,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {5603#true} assume !!(~main__tokenlen~0 <= 1000000); {5603#true} is VALID [2022-04-08 09:27:04,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {5603#true} assume !!(~main__urilen~0 >= -1000000); {5603#true} is VALID [2022-04-08 09:27:04,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {5603#true} assume !!(~main__urilen~0 <= 1000000); {5603#true} is VALID [2022-04-08 09:27:04,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {5603#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {5603#true} is VALID [2022-04-08 09:27:04,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {5603#true} call #t~ret11 := main(); {5603#true} is VALID [2022-04-08 09:27:04,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5603#true} {5603#true} #225#return; {5603#true} is VALID [2022-04-08 09:27:04,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {5603#true} assume true; {5603#true} is VALID [2022-04-08 09:27:04,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {5603#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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5603#true} is VALID [2022-04-08 09:27:04,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {5603#true} call ULTIMATE.init(); {5603#true} is VALID [2022-04-08 09:27:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:27:04,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671896062] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:27:04,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:27:04,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-08 09:27:04,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:04,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1978162480] [2022-04-08 09:27:04,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1978162480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:04,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:04,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:04,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579009081] [2022-04-08 09:27:04,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:04,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 09:27:04,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:04,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:04,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:04,963 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:04,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:04,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:04,964 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:05,771 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-08 09:27:05,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:27:05,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 09:27:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-04-08 09:27:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-04-08 09:27:05,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2022-04-08 09:27:05,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:05,891 INFO L225 Difference]: With dead ends: 111 [2022-04-08 09:27:05,891 INFO L226 Difference]: Without dead ends: 109 [2022-04-08 09:27:05,891 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:27:05,892 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 187 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:05,892 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 87 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:05,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-08 09:27:06,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2022-04-08 09:27:06,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:06,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:06,098 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:06,098 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:06,100 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-08 09:27:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-08 09:27:06,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:06,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:06,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-08 09:27:06,101 INFO L87 Difference]: Start difference. First operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-08 09:27:06,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:06,103 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-08 09:27:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-08 09:27:06,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:06,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:06,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:06,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-08 09:27:06,105 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2022-04-08 09:27:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:06,105 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-08 09:27:06,105 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:06,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-08 09:27:06,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:06,214 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 09:27:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 09:27:06,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:06,214 INFO L499 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] [2022-04-08 09:27:06,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 09:27:06,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 09:27:06,415 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:06,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:06,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 1 times [2022-04-08 09:27:06,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:06,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2002804498] [2022-04-08 09:27:06,416 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:06,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 2 times [2022-04-08 09:27:06,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:06,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873615336] [2022-04-08 09:27:06,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:06,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {6388#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6380#true} is VALID [2022-04-08 09:27:06,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-08 09:27:06,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6380#true} {6380#true} #225#return; {6380#true} is VALID [2022-04-08 09:27:06,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {6380#true} call ULTIMATE.init(); {6388#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:06,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {6388#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6380#true} is VALID [2022-04-08 09:27:06,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-08 09:27:06,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6380#true} {6380#true} #225#return; {6380#true} is VALID [2022-04-08 09:27:06,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {6380#true} call #t~ret11 := main(); {6380#true} is VALID [2022-04-08 09:27:06,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {6380#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {6380#true} is VALID [2022-04-08 09:27:06,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {6380#true} assume !!(~main__urilen~0 <= 1000000); {6380#true} is VALID [2022-04-08 09:27:06,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {6380#true} assume !!(~main__urilen~0 >= -1000000); {6380#true} is VALID [2022-04-08 09:27:06,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {6380#true} assume !!(~main__tokenlen~0 <= 1000000); {6380#true} is VALID [2022-04-08 09:27:06,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {6380#true} assume !!(~main__tokenlen~0 >= -1000000); {6380#true} is VALID [2022-04-08 09:27:06,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {6380#true} assume !!(~main__scheme~0 <= 1000000); {6380#true} is VALID [2022-04-08 09:27:06,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {6380#true} assume !!(~main__scheme~0 >= -1000000); {6380#true} is VALID [2022-04-08 09:27:06,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {6380#true} assume ~main__urilen~0 > 0; {6380#true} is VALID [2022-04-08 09:27:06,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {6380#true} assume ~main__tokenlen~0 > 0; {6380#true} is VALID [2022-04-08 09:27:06,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {6380#true} assume ~main__scheme~0 >= 0; {6385#(<= 0 main_~main__scheme~0)} is VALID [2022-04-08 09:27:06,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {6385#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {6385#(<= 0 main_~main__scheme~0)} is VALID [2022-04-08 09:27:06,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {6385#(<= 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:06,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:06,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:06,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:06,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:06,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:06,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:06,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:06,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {6386#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:06,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:06,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:06,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:06,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6387#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-08 09:27:06,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {6387#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {6381#false} is VALID [2022-04-08 09:27:06,495 INFO L290 TraceCheckUtils]: 30: Hoare triple {6381#false} assume !false; {6381#false} is VALID [2022-04-08 09:27:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:06,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:06,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873615336] [2022-04-08 09:27:06,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873615336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:06,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:06,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:06,495 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:06,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2002804498] [2022-04-08 09:27:06,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2002804498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:06,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:06,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:06,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149981102] [2022-04-08 09:27:06,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:06,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 09:27:06,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:06,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:06,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:06,515 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:06,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:06,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:06,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:06,516 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:06,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:06,922 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-08 09:27:06,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:27:06,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 09:27:06,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-08 09:27:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-08 09:27:06,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-04-08 09:27:06,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:06,990 INFO L225 Difference]: With dead ends: 70 [2022-04-08 09:27:06,990 INFO L226 Difference]: Without dead ends: 68 [2022-04-08 09:27:06,990 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 09:27:06,991 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 170 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:06,991 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 60 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:06,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-08 09:27:07,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-08 09:27:07,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:07,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:07,178 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:07,178 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:07,179 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-08 09:27:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-08 09:27:07,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:07,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:07,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-08 09:27:07,180 INFO L87 Difference]: Start difference. First operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-08 09:27:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:07,181 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-08 09:27:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-08 09:27:07,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:07,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:07,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:07,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-04-08 09:27:07,183 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2022-04-08 09:27:07,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:07,183 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-04-08 09:27:07,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:07,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 71 transitions. [2022-04-08 09:27:07,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:07,298 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-08 09:27:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 09:27:07,298 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:07,299 INFO L499 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] [2022-04-08 09:27:07,299 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 09:27:07,299 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:07,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:07,299 INFO L85 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 1 times [2022-04-08 09:27:07,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:07,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1826792653] [2022-04-08 09:27:07,300 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:07,300 INFO L85 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 2 times [2022-04-08 09:27:07,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:07,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470449702] [2022-04-08 09:27:07,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:07,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:07,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:07,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {6817#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6809#true} is VALID [2022-04-08 09:27:07,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {6809#true} assume true; {6809#true} is VALID [2022-04-08 09:27:07,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6809#true} {6809#true} #225#return; {6809#true} is VALID [2022-04-08 09:27:07,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {6809#true} call ULTIMATE.init(); {6817#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:07,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {6817#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6809#true} is VALID [2022-04-08 09:27:07,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {6809#true} assume true; {6809#true} is VALID [2022-04-08 09:27:07,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6809#true} {6809#true} #225#return; {6809#true} is VALID [2022-04-08 09:27:07,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {6809#true} call #t~ret11 := main(); {6809#true} is VALID [2022-04-08 09:27:07,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {6809#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {6809#true} is VALID [2022-04-08 09:27:07,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {6809#true} assume !!(~main__urilen~0 <= 1000000); {6809#true} is VALID [2022-04-08 09:27:07,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {6809#true} assume !!(~main__urilen~0 >= -1000000); {6809#true} is VALID [2022-04-08 09:27:07,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {6809#true} assume !!(~main__tokenlen~0 <= 1000000); {6809#true} is VALID [2022-04-08 09:27:07,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {6809#true} assume !!(~main__tokenlen~0 >= -1000000); {6809#true} is VALID [2022-04-08 09:27:07,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {6809#true} assume !!(~main__scheme~0 <= 1000000); {6809#true} is VALID [2022-04-08 09:27:07,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {6809#true} assume !!(~main__scheme~0 >= -1000000); {6809#true} is VALID [2022-04-08 09:27:07,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {6809#true} assume ~main__urilen~0 > 0; {6809#true} is VALID [2022-04-08 09:27:07,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {6809#true} assume ~main__tokenlen~0 > 0; {6809#true} is VALID [2022-04-08 09:27:07,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {6809#true} assume ~main__scheme~0 >= 0; {6809#true} is VALID [2022-04-08 09:27:07,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {6809#true} assume !(0 == ~main__scheme~0); {6809#true} is VALID [2022-04-08 09:27:07,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {6809#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6816#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-08 09:27:07,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {6816#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {6810#false} is VALID [2022-04-08 09:27:07,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {6810#false} assume !false; {6810#false} is VALID [2022-04-08 09:27:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:27:07,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:07,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470449702] [2022-04-08 09:27:07,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470449702] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:27:07,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524472678] [2022-04-08 09:27:07,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:27:07,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:27:07,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:27:07,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:27:07,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 09:27:07,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:27:07,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:27:07,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 09:27:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:07,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:27:07,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {6809#true} call ULTIMATE.init(); {6809#true} is VALID [2022-04-08 09:27:07,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {6809#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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6809#true} is VALID [2022-04-08 09:27:07,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {6809#true} assume true; {6809#true} is VALID [2022-04-08 09:27:07,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6809#true} {6809#true} #225#return; {6809#true} is VALID [2022-04-08 09:27:07,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {6809#true} call #t~ret11 := main(); {6809#true} is VALID [2022-04-08 09:27:07,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {6809#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {6809#true} is VALID [2022-04-08 09:27:07,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {6809#true} assume !!(~main__urilen~0 <= 1000000); {6809#true} is VALID [2022-04-08 09:27:07,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {6809#true} assume !!(~main__urilen~0 >= -1000000); {6809#true} is VALID [2022-04-08 09:27:07,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {6809#true} assume !!(~main__tokenlen~0 <= 1000000); {6809#true} is VALID [2022-04-08 09:27:07,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {6809#true} assume !!(~main__tokenlen~0 >= -1000000); {6809#true} is VALID [2022-04-08 09:27:07,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {6809#true} assume !!(~main__scheme~0 <= 1000000); {6809#true} is VALID [2022-04-08 09:27:07,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {6809#true} assume !!(~main__scheme~0 >= -1000000); {6809#true} is VALID [2022-04-08 09:27:07,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {6809#true} assume ~main__urilen~0 > 0; {6809#true} is VALID [2022-04-08 09:27:07,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {6809#true} assume ~main__tokenlen~0 > 0; {6809#true} is VALID [2022-04-08 09:27:07,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {6809#true} assume ~main__scheme~0 >= 0; {6809#true} is VALID [2022-04-08 09:27:07,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {6809#true} assume !(0 == ~main__scheme~0); {6809#true} is VALID [2022-04-08 09:27:07,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {6809#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6905#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID [2022-04-08 09:27:07,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {6905#(<= 1 main_~__VERIFIER_assert__cond~4)} assume 0 == ~__VERIFIER_assert__cond~4; {6810#false} is VALID [2022-04-08 09:27:07,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {6810#false} assume !false; {6810#false} is VALID [2022-04-08 09:27:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:27:07,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:27:07,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {6810#false} assume !false; {6810#false} is VALID [2022-04-08 09:27:07,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {6905#(<= 1 main_~__VERIFIER_assert__cond~4)} assume 0 == ~__VERIFIER_assert__cond~4; {6810#false} is VALID [2022-04-08 09:27:07,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6905#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID [2022-04-08 09:27:07,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {6809#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:07,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {6809#true} assume !(0 == ~main__scheme~0); {6809#true} is VALID [2022-04-08 09:27:07,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {6809#true} assume ~main__scheme~0 >= 0; {6809#true} is VALID [2022-04-08 09:27:07,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {6809#true} assume ~main__tokenlen~0 > 0; {6809#true} is VALID [2022-04-08 09:27:07,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {6809#true} assume ~main__urilen~0 > 0; {6809#true} is VALID [2022-04-08 09:27:07,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {6809#true} assume !!(~main__scheme~0 >= -1000000); {6809#true} is VALID [2022-04-08 09:27:07,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {6809#true} assume !!(~main__scheme~0 <= 1000000); {6809#true} is VALID [2022-04-08 09:27:07,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {6809#true} assume !!(~main__tokenlen~0 >= -1000000); {6809#true} is VALID [2022-04-08 09:27:07,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {6809#true} assume !!(~main__tokenlen~0 <= 1000000); {6809#true} is VALID [2022-04-08 09:27:07,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {6809#true} assume !!(~main__urilen~0 >= -1000000); {6809#true} is VALID [2022-04-08 09:27:07,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {6809#true} assume !!(~main__urilen~0 <= 1000000); {6809#true} is VALID [2022-04-08 09:27:07,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {6809#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {6809#true} is VALID [2022-04-08 09:27:07,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {6809#true} call #t~ret11 := main(); {6809#true} is VALID [2022-04-08 09:27:07,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6809#true} {6809#true} #225#return; {6809#true} is VALID [2022-04-08 09:27:07,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {6809#true} assume true; {6809#true} is VALID [2022-04-08 09:27:07,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {6809#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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6809#true} is VALID [2022-04-08 09:27:07,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {6809#true} call ULTIMATE.init(); {6809#true} is VALID [2022-04-08 09:27:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:27:07,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524472678] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:27:07,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:27:07,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-08 09:27:07,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:07,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1826792653] [2022-04-08 09:27:07,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1826792653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:07,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:07,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:07,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738843263] [2022-04-08 09:27:07,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:07,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 09:27:07,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:07,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:07,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:07,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:07,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:07,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:07,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:07,898 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:08,249 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-08 09:27:08,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:27:08,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 09:27:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:08,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-08 09:27:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-08 09:27:08,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-08 09:27:08,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:08,308 INFO L225 Difference]: With dead ends: 69 [2022-04-08 09:27:08,308 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 09:27:08,308 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:27:08,309 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 130 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:08,309 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 61 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 09:27:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-04-08 09:27:08,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:08,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:08,449 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:08,449 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:08,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:08,450 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-08 09:27:08,450 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-08 09:27:08,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:08,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:08,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-08 09:27:08,451 INFO L87 Difference]: Start difference. First operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-08 09:27:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:08,452 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-08 09:27:08,452 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-08 09:27:08,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:08,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:08,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:08,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:08,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-04-08 09:27:08,454 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2022-04-08 09:27:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:08,454 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-04-08 09:27:08,454 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:08,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 64 transitions. [2022-04-08 09:27:08,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-04-08 09:27:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 09:27:08,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:08,559 INFO L499 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] [2022-04-08 09:27:08,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 09:27:08,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 09:27:08,759 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:08,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 1 times [2022-04-08 09:27:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:08,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1545585007] [2022-04-08 09:27:08,761 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:08,761 INFO L85 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 2 times [2022-04-08 09:27:08,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:08,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518101742] [2022-04-08 09:27:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:08,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:08,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:08,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {7416#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7408#true} is VALID [2022-04-08 09:27:08,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {7408#true} assume true; {7408#true} is VALID [2022-04-08 09:27:08,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7408#true} {7408#true} #225#return; {7408#true} is VALID [2022-04-08 09:27:08,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {7408#true} call ULTIMATE.init(); {7416#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:08,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {7416#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7408#true} is VALID [2022-04-08 09:27:08,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {7408#true} assume true; {7408#true} is VALID [2022-04-08 09:27:08,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7408#true} {7408#true} #225#return; {7408#true} is VALID [2022-04-08 09:27:08,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {7408#true} call #t~ret11 := main(); {7408#true} is VALID [2022-04-08 09:27:08,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {7408#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {7408#true} is VALID [2022-04-08 09:27:08,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {7408#true} assume !!(~main__urilen~0 <= 1000000); {7408#true} is VALID [2022-04-08 09:27:08,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {7408#true} assume !!(~main__urilen~0 >= -1000000); {7408#true} is VALID [2022-04-08 09:27:08,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {7408#true} assume !!(~main__tokenlen~0 <= 1000000); {7408#true} is VALID [2022-04-08 09:27:08,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {7408#true} assume !!(~main__tokenlen~0 >= -1000000); {7408#true} is VALID [2022-04-08 09:27:08,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {7408#true} assume !!(~main__scheme~0 <= 1000000); {7408#true} is VALID [2022-04-08 09:27:08,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {7408#true} assume !!(~main__scheme~0 >= -1000000); {7408#true} is VALID [2022-04-08 09:27:08,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {7408#true} assume ~main__urilen~0 > 0; {7408#true} is VALID [2022-04-08 09:27:08,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {7408#true} assume ~main__tokenlen~0 > 0; {7408#true} is VALID [2022-04-08 09:27:08,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {7408#true} assume ~main__scheme~0 >= 0; {7408#true} is VALID [2022-04-08 09:27:08,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {7408#true} assume !(0 == ~main__scheme~0); {7408#true} is VALID [2022-04-08 09:27:08,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {7408#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:08,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:08,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:08,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:08,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:08,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:08,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:08,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:08,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:08,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:08,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:08,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:08,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:08,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:08,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:08,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7415#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-08 09:27:08,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {7415#(not (= main_~__VERIFIER_assert__cond~8 0))} assume 0 == ~__VERIFIER_assert__cond~8; {7409#false} is VALID [2022-04-08 09:27:08,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {7409#false} assume !false; {7409#false} is VALID [2022-04-08 09:27:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:08,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:08,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518101742] [2022-04-08 09:27:08,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518101742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:08,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:08,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:08,854 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:08,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1545585007] [2022-04-08 09:27:08,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1545585007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:08,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:08,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:08,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068815911] [2022-04-08 09:27:08,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:08,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 09:27:08,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:08,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:08,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:08,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:08,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:08,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:08,885 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:09,253 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-08 09:27:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:27:09,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 09:27:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-08 09:27:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-08 09:27:09,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-08 09:27:09,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:09,314 INFO L225 Difference]: With dead ends: 63 [2022-04-08 09:27:09,314 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 09:27:09,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:27:09,315 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 149 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:09,315 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 54 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:09,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 09:27:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-04-08 09:27:09,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:09,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:09,456 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:09,456 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:09,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:09,457 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-08 09:27:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-08 09:27:09,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:09,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:09,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-08 09:27:09,458 INFO L87 Difference]: Start difference. First operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-08 09:27:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:09,459 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-08 09:27:09,459 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-08 09:27:09,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:09,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:09,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:09,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-08 09:27:09,460 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2022-04-08 09:27:09,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:09,460 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-08 09:27:09,461 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:09,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-08 09:27:09,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 09:27:09,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 09:27:09,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:09,571 INFO L499 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-04-08 09:27:09,571 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 09:27:09,572 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:09,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:09,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 1 times [2022-04-08 09:27:09,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:09,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [324608442] [2022-04-08 09:27:09,573 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:09,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 2 times [2022-04-08 09:27:09,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:09,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248409682] [2022-04-08 09:27:09,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:09,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:09,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:09,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {7804#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7795#true} is VALID [2022-04-08 09:27:09,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {7795#true} assume true; {7795#true} is VALID [2022-04-08 09:27:09,654 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7795#true} {7795#true} #225#return; {7795#true} is VALID [2022-04-08 09:27:09,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {7795#true} call ULTIMATE.init(); {7804#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:09,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {7804#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7795#true} is VALID [2022-04-08 09:27:09,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {7795#true} assume true; {7795#true} is VALID [2022-04-08 09:27:09,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7795#true} {7795#true} #225#return; {7795#true} is VALID [2022-04-08 09:27:09,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {7795#true} call #t~ret11 := main(); {7795#true} is VALID [2022-04-08 09:27:09,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {7795#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {7795#true} is VALID [2022-04-08 09:27:09,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {7795#true} assume !!(~main__urilen~0 <= 1000000); {7795#true} is VALID [2022-04-08 09:27:09,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {7795#true} assume !!(~main__urilen~0 >= -1000000); {7795#true} is VALID [2022-04-08 09:27:09,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {7795#true} assume !!(~main__tokenlen~0 <= 1000000); {7795#true} is VALID [2022-04-08 09:27:09,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {7795#true} assume !!(~main__tokenlen~0 >= -1000000); {7795#true} is VALID [2022-04-08 09:27:09,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {7795#true} assume !!(~main__scheme~0 <= 1000000); {7795#true} is VALID [2022-04-08 09:27:09,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {7795#true} assume !!(~main__scheme~0 >= -1000000); {7795#true} is VALID [2022-04-08 09:27:09,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {7795#true} assume ~main__urilen~0 > 0; {7795#true} is VALID [2022-04-08 09:27:09,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {7795#true} assume ~main__tokenlen~0 > 0; {7795#true} is VALID [2022-04-08 09:27:09,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {7795#true} assume ~main__scheme~0 >= 0; {7800#(<= 0 main_~main__scheme~0)} is VALID [2022-04-08 09:27:09,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {7800#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {7800#(<= 0 main_~main__scheme~0)} is VALID [2022-04-08 09:27:09,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {7800#(<= 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {7801#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {7802#(<= 1 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {7802#(<= 1 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7802#(<= 1 main_~main__cp~0)} is VALID [2022-04-08 09:27:09,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {7802#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7803#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-08 09:27:09,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {7803#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {7796#false} is VALID [2022-04-08 09:27:09,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {7796#false} assume !false; {7796#false} is VALID [2022-04-08 09:27:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:09,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:09,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248409682] [2022-04-08 09:27:09,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248409682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:09,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:09,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:09,664 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:09,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [324608442] [2022-04-08 09:27:09,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [324608442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:09,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:09,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:09,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078929839] [2022-04-08 09:27:09,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:09,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 09:27:09,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:09,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:09,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:09,690 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:27:09,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:09,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:27:09,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:09,690 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:10,143 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-08 09:27:10,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:27:10,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 09:27:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-08 09:27:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-08 09:27:10,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-04-08 09:27:10,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:10,223 INFO L225 Difference]: With dead ends: 71 [2022-04-08 09:27:10,223 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 09:27:10,224 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:27:10,224 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 177 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:10,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 57 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 09:27:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-04-08 09:27:10,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:10,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:10,358 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:10,359 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:10,360 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-08 09:27:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-08 09:27:10,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:10,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:10,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-08 09:27:10,361 INFO L87 Difference]: Start difference. First operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-08 09:27:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:10,362 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-08 09:27:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-08 09:27:10,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:10,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:10,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:10,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-04-08 09:27:10,364 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2022-04-08 09:27:10,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:10,364 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-04-08 09:27:10,364 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:10,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 60 transitions. [2022-04-08 09:27:10,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-04-08 09:27:10,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 09:27:10,456 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:10,456 INFO L499 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] [2022-04-08 09:27:10,456 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 09:27:10,456 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:10,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:10,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 1 times [2022-04-08 09:27:10,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:10,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [804542278] [2022-04-08 09:27:10,457 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:10,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 2 times [2022-04-08 09:27:10,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:10,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940378135] [2022-04-08 09:27:10,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:10,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:10,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:10,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {8219#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8211#true} is VALID [2022-04-08 09:27:10,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {8211#true} assume true; {8211#true} is VALID [2022-04-08 09:27:10,552 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8211#true} {8211#true} #225#return; {8211#true} is VALID [2022-04-08 09:27:10,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {8211#true} call ULTIMATE.init(); {8219#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:10,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {8219#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8211#true} is VALID [2022-04-08 09:27:10,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {8211#true} assume true; {8211#true} is VALID [2022-04-08 09:27:10,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8211#true} {8211#true} #225#return; {8211#true} is VALID [2022-04-08 09:27:10,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {8211#true} call #t~ret11 := main(); {8211#true} is VALID [2022-04-08 09:27:10,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {8211#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {8211#true} is VALID [2022-04-08 09:27:10,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {8211#true} assume !!(~main__urilen~0 <= 1000000); {8211#true} is VALID [2022-04-08 09:27:10,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {8211#true} assume !!(~main__urilen~0 >= -1000000); {8211#true} is VALID [2022-04-08 09:27:10,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {8211#true} assume !!(~main__tokenlen~0 <= 1000000); {8211#true} is VALID [2022-04-08 09:27:10,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {8211#true} assume !!(~main__tokenlen~0 >= -1000000); {8211#true} is VALID [2022-04-08 09:27:10,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {8211#true} assume !!(~main__scheme~0 <= 1000000); {8211#true} is VALID [2022-04-08 09:27:10,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {8211#true} assume !!(~main__scheme~0 >= -1000000); {8211#true} is VALID [2022-04-08 09:27:10,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {8211#true} assume ~main__urilen~0 > 0; {8211#true} is VALID [2022-04-08 09:27:10,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {8211#true} assume ~main__tokenlen~0 > 0; {8211#true} is VALID [2022-04-08 09:27:10,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {8211#true} assume ~main__scheme~0 >= 0; {8211#true} is VALID [2022-04-08 09:27:10,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {8211#true} assume !(0 == ~main__scheme~0); {8211#true} is VALID [2022-04-08 09:27:10,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {8211#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8211#true} is VALID [2022-04-08 09:27:10,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8211#true} is VALID [2022-04-08 09:27:10,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {8211#true} is VALID [2022-04-08 09:27:10,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {8211#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8211#true} is VALID [2022-04-08 09:27:10,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8211#true} is VALID [2022-04-08 09:27:10,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~3); {8211#true} is VALID [2022-04-08 09:27:10,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {8211#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {8211#true} is VALID [2022-04-08 09:27:10,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {8211#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {8211#true} is VALID [2022-04-08 09:27:10,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {8211#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {8211#true} is VALID [2022-04-08 09:27:10,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {8211#true} is VALID [2022-04-08 09:27:10,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~5); {8211#true} is VALID [2022-04-08 09:27:10,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {8211#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {8211#true} is VALID [2022-04-08 09:27:10,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {8211#true} is VALID [2022-04-08 09:27:10,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~7); {8211#true} is VALID [2022-04-08 09:27:10,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {8211#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {8211#true} is VALID [2022-04-08 09:27:10,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {8211#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {8216#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-08 09:27:10,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {8216#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:27:10,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~9); {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:27:10,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__cp~0 != ~main__urilen~0 - 1; {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:27:10,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8218#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-08 09:27:10,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {8218#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {8212#false} is VALID [2022-04-08 09:27:10,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {8212#false} assume !false; {8212#false} is VALID [2022-04-08 09:27:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:10,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:10,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940378135] [2022-04-08 09:27:10,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940378135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:10,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:10,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:10,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:10,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [804542278] [2022-04-08 09:27:10,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [804542278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:10,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:10,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:10,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318218909] [2022-04-08 09:27:10,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:10,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 09:27:10,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:10,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:10,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:10,588 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:10,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:10,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:10,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:10,590 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:11,167 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-04-08 09:27:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:27:11,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 09:27:11,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-04-08 09:27:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-04-08 09:27:11,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 95 transitions. [2022-04-08 09:27:11,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:11,266 INFO L225 Difference]: With dead ends: 91 [2022-04-08 09:27:11,266 INFO L226 Difference]: Without dead ends: 89 [2022-04-08 09:27:11,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:27:11,268 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 178 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:11,268 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 60 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-08 09:27:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-04-08 09:27:11,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:11,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:11,408 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:11,408 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:11,410 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-08 09:27:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-08 09:27:11,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:11,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:11,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-08 09:27:11,410 INFO L87 Difference]: Start difference. First operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-08 09:27:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:11,412 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-08 09:27:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-08 09:27:11,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:11,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:11,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:11,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-04-08 09:27:11,415 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2022-04-08 09:27:11,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:11,415 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-04-08 09:27:11,416 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:11,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 63 transitions. [2022-04-08 09:27:11,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-08 09:27:11,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 09:27:11,531 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:11,531 INFO L499 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-04-08 09:27:11,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 09:27:11,532 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:11,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:11,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 1 times [2022-04-08 09:27:11,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:11,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [372806534] [2022-04-08 09:27:11,532 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 2 times [2022-04-08 09:27:11,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:11,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659266166] [2022-04-08 09:27:11,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:11,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:11,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:11,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {8723#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8715#true} is VALID [2022-04-08 09:27:11,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {8715#true} assume true; {8715#true} is VALID [2022-04-08 09:27:11,613 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8715#true} {8715#true} #225#return; {8715#true} is VALID [2022-04-08 09:27:11,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {8715#true} call ULTIMATE.init(); {8723#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:11,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {8723#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8715#true} is VALID [2022-04-08 09:27:11,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {8715#true} assume true; {8715#true} is VALID [2022-04-08 09:27:11,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8715#true} {8715#true} #225#return; {8715#true} is VALID [2022-04-08 09:27:11,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {8715#true} call #t~ret11 := main(); {8715#true} is VALID [2022-04-08 09:27:11,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {8715#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {8715#true} is VALID [2022-04-08 09:27:11,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {8715#true} assume !!(~main__urilen~0 <= 1000000); {8715#true} is VALID [2022-04-08 09:27:11,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {8715#true} assume !!(~main__urilen~0 >= -1000000); {8715#true} is VALID [2022-04-08 09:27:11,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {8715#true} assume !!(~main__tokenlen~0 <= 1000000); {8715#true} is VALID [2022-04-08 09:27:11,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {8715#true} assume !!(~main__tokenlen~0 >= -1000000); {8715#true} is VALID [2022-04-08 09:27:11,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {8715#true} assume !!(~main__scheme~0 <= 1000000); {8715#true} is VALID [2022-04-08 09:27:11,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {8715#true} assume !!(~main__scheme~0 >= -1000000); {8715#true} is VALID [2022-04-08 09:27:11,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {8715#true} assume ~main__urilen~0 > 0; {8715#true} is VALID [2022-04-08 09:27:11,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {8715#true} assume ~main__tokenlen~0 > 0; {8715#true} is VALID [2022-04-08 09:27:11,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {8715#true} assume ~main__scheme~0 >= 0; {8715#true} is VALID [2022-04-08 09:27:11,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {8715#true} assume !(0 == ~main__scheme~0); {8715#true} is VALID [2022-04-08 09:27:11,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {8715#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8715#true} is VALID [2022-04-08 09:27:11,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8715#true} is VALID [2022-04-08 09:27:11,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {8715#true} is VALID [2022-04-08 09:27:11,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {8715#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8715#true} is VALID [2022-04-08 09:27:11,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8715#true} is VALID [2022-04-08 09:27:11,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~3); {8715#true} is VALID [2022-04-08 09:27:11,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {8715#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {8715#true} is VALID [2022-04-08 09:27:11,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {8715#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {8715#true} is VALID [2022-04-08 09:27:11,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {8715#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {8715#true} is VALID [2022-04-08 09:27:11,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {8715#true} is VALID [2022-04-08 09:27:11,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~5); {8715#true} is VALID [2022-04-08 09:27:11,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {8715#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {8715#true} is VALID [2022-04-08 09:27:11,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {8715#true} is VALID [2022-04-08 09:27:11,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~7); {8715#true} is VALID [2022-04-08 09:27:11,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {8715#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {8715#true} is VALID [2022-04-08 09:27:11,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {8715#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {8715#true} is VALID [2022-04-08 09:27:11,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {8720#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} is VALID [2022-04-08 09:27:11,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {8720#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~9); {8721#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:11,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {8721#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {8721#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:11,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {8721#(<= 0 main_~main__cp~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8721#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:11,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {8721#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8722#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-08 09:27:11,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {8722#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {8716#false} is VALID [2022-04-08 09:27:11,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {8716#false} assume !false; {8716#false} is VALID [2022-04-08 09:27:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:11,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:11,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659266166] [2022-04-08 09:27:11,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659266166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:11,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:11,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:11,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:11,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [372806534] [2022-04-08 09:27:11,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [372806534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:11,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:11,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:11,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598318944] [2022-04-08 09:27:11,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:11,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 09:27:11,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:11,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:11,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:11,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:11,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:11,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:11,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:11,646 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:12,062 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-08 09:27:12,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:27:12,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 09:27:12,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-08 09:27:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-08 09:27:12,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2022-04-08 09:27:12,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:12,121 INFO L225 Difference]: With dead ends: 61 [2022-04-08 09:27:12,121 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 09:27:12,121 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 09:27:12,121 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 110 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:12,122 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 67 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:12,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 09:27:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-08 09:27:12,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:12,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:12,281 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:12,281 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:12,282 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-08 09:27:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-08 09:27:12,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:12,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:12,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-08 09:27:12,283 INFO L87 Difference]: Start difference. First operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-08 09:27:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:12,284 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-08 09:27:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-08 09:27:12,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:12,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:12,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:12,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:12,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:12,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-04-08 09:27:12,286 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2022-04-08 09:27:12,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:12,286 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-04-08 09:27:12,286 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:12,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 61 transitions. [2022-04-08 09:27:12,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-08 09:27:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 09:27:12,377 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:12,377 INFO L499 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, 1] [2022-04-08 09:27:12,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 09:27:12,377 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:12,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 1 times [2022-04-08 09:27:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:12,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1543977454] [2022-04-08 09:27:12,378 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 2 times [2022-04-08 09:27:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:12,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753938281] [2022-04-08 09:27:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:12,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:12,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {9097#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9090#true} is VALID [2022-04-08 09:27:12,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {9090#true} assume true; {9090#true} is VALID [2022-04-08 09:27:12,443 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9090#true} {9090#true} #225#return; {9090#true} is VALID [2022-04-08 09:27:12,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {9090#true} call ULTIMATE.init(); {9097#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:12,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {9097#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9090#true} is VALID [2022-04-08 09:27:12,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {9090#true} assume true; {9090#true} is VALID [2022-04-08 09:27:12,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9090#true} {9090#true} #225#return; {9090#true} is VALID [2022-04-08 09:27:12,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {9090#true} call #t~ret11 := main(); {9090#true} is VALID [2022-04-08 09:27:12,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {9090#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {9090#true} is VALID [2022-04-08 09:27:12,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {9090#true} assume !!(~main__urilen~0 <= 1000000); {9090#true} is VALID [2022-04-08 09:27:12,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {9090#true} assume !!(~main__urilen~0 >= -1000000); {9090#true} is VALID [2022-04-08 09:27:12,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {9090#true} assume !!(~main__tokenlen~0 <= 1000000); {9090#true} is VALID [2022-04-08 09:27:12,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {9090#true} assume !!(~main__tokenlen~0 >= -1000000); {9090#true} is VALID [2022-04-08 09:27:12,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {9090#true} assume !!(~main__scheme~0 <= 1000000); {9090#true} is VALID [2022-04-08 09:27:12,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {9090#true} assume !!(~main__scheme~0 >= -1000000); {9090#true} is VALID [2022-04-08 09:27:12,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {9090#true} assume ~main__urilen~0 > 0; {9090#true} is VALID [2022-04-08 09:27:12,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {9090#true} assume ~main__tokenlen~0 > 0; {9090#true} is VALID [2022-04-08 09:27:12,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {9090#true} assume ~main__scheme~0 >= 0; {9090#true} is VALID [2022-04-08 09:27:12,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {9090#true} assume !(0 == ~main__scheme~0); {9090#true} is VALID [2022-04-08 09:27:12,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {9090#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9090#true} is VALID [2022-04-08 09:27:12,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9090#true} is VALID [2022-04-08 09:27:12,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {9090#true} is VALID [2022-04-08 09:27:12,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {9090#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {9090#true} is VALID [2022-04-08 09:27:12,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {9090#true} is VALID [2022-04-08 09:27:12,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~3); {9090#true} is VALID [2022-04-08 09:27:12,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {9090#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {9090#true} is VALID [2022-04-08 09:27:12,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {9090#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {9090#true} is VALID [2022-04-08 09:27:12,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {9090#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9090#true} is VALID [2022-04-08 09:27:12,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9090#true} is VALID [2022-04-08 09:27:12,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~5); {9090#true} is VALID [2022-04-08 09:27:12,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {9090#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {9090#true} is VALID [2022-04-08 09:27:12,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {9090#true} is VALID [2022-04-08 09:27:12,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~7); {9090#true} is VALID [2022-04-08 09:27:12,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {9090#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {9090#true} is VALID [2022-04-08 09:27:12,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {9090#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {9090#true} is VALID [2022-04-08 09:27:12,449 INFO L290 TraceCheckUtils]: 32: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {9090#true} is VALID [2022-04-08 09:27:12,449 INFO L290 TraceCheckUtils]: 33: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~9); {9090#true} is VALID [2022-04-08 09:27:12,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {9090#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {9090#true} is VALID [2022-04-08 09:27:12,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {9090#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-08 09:27:12,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-08 09:27:12,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-08 09:27:12,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9096#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-08 09:27:12,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {9096#(not (= main_~__VERIFIER_assert__cond~12 0))} assume 0 == ~__VERIFIER_assert__cond~12; {9091#false} is VALID [2022-04-08 09:27:12,452 INFO L290 TraceCheckUtils]: 40: Hoare triple {9091#false} assume !false; {9091#false} is VALID [2022-04-08 09:27:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:12,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:12,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753938281] [2022-04-08 09:27:12,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753938281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:12,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:12,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:12,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:12,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1543977454] [2022-04-08 09:27:12,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1543977454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:12,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:12,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:12,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056136669] [2022-04-08 09:27:12,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:12,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 09:27:12,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:12,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:12,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:12,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:27:12,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:12,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:27:12,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:27:12,478 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:12,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:12,911 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-08 09:27:12,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:27:12,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 09:27:12,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-08 09:27:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-08 09:27:12,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-08 09:27:12,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:12,982 INFO L225 Difference]: With dead ends: 70 [2022-04-08 09:27:12,982 INFO L226 Difference]: Without dead ends: 68 [2022-04-08 09:27:12,982 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:27:12,982 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:12,983 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 77 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-08 09:27:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2022-04-08 09:27:13,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:13,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:13,150 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:13,150 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:13,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:13,151 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-08 09:27:13,151 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-08 09:27:13,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:13,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:13,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-08 09:27:13,152 INFO L87 Difference]: Start difference. First operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-08 09:27:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:13,153 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-08 09:27:13,153 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-08 09:27:13,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:13,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:13,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:13,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:13,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-04-08 09:27:13,154 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2022-04-08 09:27:13,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:13,155 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-04-08 09:27:13,155 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:13,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 59 transitions. [2022-04-08 09:27:13,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-08 09:27:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 09:27:13,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:13,270 INFO L499 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, 1, 1] [2022-04-08 09:27:13,271 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 09:27:13,271 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 1 times [2022-04-08 09:27:13,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:13,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [135894852] [2022-04-08 09:27:13,272 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:13,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 2 times [2022-04-08 09:27:13,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:13,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42005098] [2022-04-08 09:27:13,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:13,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:13,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:13,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {9507#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9499#true} is VALID [2022-04-08 09:27:13,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {9499#true} assume true; {9499#true} is VALID [2022-04-08 09:27:13,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9499#true} {9499#true} #225#return; {9499#true} is VALID [2022-04-08 09:27:13,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {9499#true} call ULTIMATE.init(); {9507#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:13,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {9507#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9499#true} is VALID [2022-04-08 09:27:13,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {9499#true} assume true; {9499#true} is VALID [2022-04-08 09:27:13,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9499#true} {9499#true} #225#return; {9499#true} is VALID [2022-04-08 09:27:13,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {9499#true} call #t~ret11 := main(); {9499#true} is VALID [2022-04-08 09:27:13,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {9499#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {9499#true} is VALID [2022-04-08 09:27:13,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {9499#true} assume !!(~main__urilen~0 <= 1000000); {9499#true} is VALID [2022-04-08 09:27:13,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {9499#true} assume !!(~main__urilen~0 >= -1000000); {9499#true} is VALID [2022-04-08 09:27:13,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {9499#true} assume !!(~main__tokenlen~0 <= 1000000); {9499#true} is VALID [2022-04-08 09:27:13,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {9499#true} assume !!(~main__tokenlen~0 >= -1000000); {9499#true} is VALID [2022-04-08 09:27:13,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {9499#true} assume !!(~main__scheme~0 <= 1000000); {9499#true} is VALID [2022-04-08 09:27:13,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {9499#true} assume !!(~main__scheme~0 >= -1000000); {9499#true} is VALID [2022-04-08 09:27:13,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {9499#true} assume ~main__urilen~0 > 0; {9499#true} is VALID [2022-04-08 09:27:13,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {9499#true} assume ~main__tokenlen~0 > 0; {9499#true} is VALID [2022-04-08 09:27:13,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {9499#true} assume ~main__scheme~0 >= 0; {9499#true} is VALID [2022-04-08 09:27:13,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {9499#true} assume !(0 == ~main__scheme~0); {9499#true} is VALID [2022-04-08 09:27:13,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {9499#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9499#true} is VALID [2022-04-08 09:27:13,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9499#true} is VALID [2022-04-08 09:27:13,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {9499#true} is VALID [2022-04-08 09:27:13,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {9499#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {9499#true} is VALID [2022-04-08 09:27:13,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {9499#true} is VALID [2022-04-08 09:27:13,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~3); {9499#true} is VALID [2022-04-08 09:27:13,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {9499#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {9499#true} is VALID [2022-04-08 09:27:13,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {9499#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {9499#true} is VALID [2022-04-08 09:27:13,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {9499#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9499#true} is VALID [2022-04-08 09:27:13,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9499#true} is VALID [2022-04-08 09:27:13,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~5); {9499#true} is VALID [2022-04-08 09:27:13,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {9499#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {9499#true} is VALID [2022-04-08 09:27:13,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {9499#true} is VALID [2022-04-08 09:27:13,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~7); {9499#true} is VALID [2022-04-08 09:27:13,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {9499#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {9499#true} is VALID [2022-04-08 09:27:13,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {9499#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {9504#(= main_~main__c~0 0)} is VALID [2022-04-08 09:27:13,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {9504#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {9504#(= main_~main__c~0 0)} is VALID [2022-04-08 09:27:13,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {9504#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~9); {9504#(= main_~main__c~0 0)} is VALID [2022-04-08 09:27:13,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {9504#(= main_~main__c~0 0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {9504#(= main_~main__c~0 0)} is VALID [2022-04-08 09:27:13,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {9504#(= main_~main__c~0 0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {9504#(= main_~main__c~0 0)} is VALID [2022-04-08 09:27:13,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {9504#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {9504#(= main_~main__c~0 0)} is VALID [2022-04-08 09:27:13,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {9504#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {9504#(= main_~main__c~0 0)} is VALID [2022-04-08 09:27:13,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {9504#(= main_~main__c~0 0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9505#(<= 1 main_~main__c~0)} is VALID [2022-04-08 09:27:13,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {9505#(<= 1 main_~main__c~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9506#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-08 09:27:13,346 INFO L290 TraceCheckUtils]: 40: Hoare triple {9506#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {9500#false} is VALID [2022-04-08 09:27:13,346 INFO L290 TraceCheckUtils]: 41: Hoare triple {9500#false} assume !false; {9500#false} is VALID [2022-04-08 09:27:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:13,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:13,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42005098] [2022-04-08 09:27:13,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42005098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:13,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:13,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:13,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:13,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [135894852] [2022-04-08 09:27:13,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [135894852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:13,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:13,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:13,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687096353] [2022-04-08 09:27:13,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:13,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 09:27:13,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:13,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:13,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:13,374 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:13,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:13,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:13,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:13,374 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:13,848 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-04-08 09:27:13,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:27:13,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 09:27:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:13,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-04-08 09:27:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-04-08 09:27:13,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2022-04-08 09:27:13,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:13,914 INFO L225 Difference]: With dead ends: 66 [2022-04-08 09:27:13,914 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 09:27:13,914 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-08 09:27:13,915 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 91 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:13,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 74 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:13,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 09:27:14,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-04-08 09:27:14,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:14,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:14,088 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:14,088 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:14,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:14,089 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-08 09:27:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-08 09:27:14,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:14,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:14,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-08 09:27:14,090 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-08 09:27:14,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:14,091 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-08 09:27:14,091 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-08 09:27:14,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:14,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:14,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:14,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-08 09:27:14,092 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2022-04-08 09:27:14,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:14,092 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-08 09:27:14,093 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:14,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2022-04-08 09:27:14,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-08 09:27:14,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 09:27:14,204 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:14,205 INFO L499 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, 1, 1, 1] [2022-04-08 09:27:14,205 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 09:27:14,205 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:14,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:14,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 1 times [2022-04-08 09:27:14,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:14,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022615055] [2022-04-08 09:27:14,206 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:14,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 2 times [2022-04-08 09:27:14,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:14,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215217990] [2022-04-08 09:27:14,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:14,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:14,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:14,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {9894#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9886#true} is VALID [2022-04-08 09:27:14,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {9886#true} assume true; {9886#true} is VALID [2022-04-08 09:27:14,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9886#true} {9886#true} #225#return; {9886#true} is VALID [2022-04-08 09:27:14,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {9886#true} call ULTIMATE.init(); {9894#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:14,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {9894#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9886#true} is VALID [2022-04-08 09:27:14,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {9886#true} assume true; {9886#true} is VALID [2022-04-08 09:27:14,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9886#true} {9886#true} #225#return; {9886#true} is VALID [2022-04-08 09:27:14,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {9886#true} call #t~ret11 := main(); {9886#true} is VALID [2022-04-08 09:27:14,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {9886#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {9886#true} is VALID [2022-04-08 09:27:14,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {9886#true} assume !!(~main__urilen~0 <= 1000000); {9886#true} is VALID [2022-04-08 09:27:14,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {9886#true} assume !!(~main__urilen~0 >= -1000000); {9886#true} is VALID [2022-04-08 09:27:14,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {9886#true} assume !!(~main__tokenlen~0 <= 1000000); {9886#true} is VALID [2022-04-08 09:27:14,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {9886#true} assume !!(~main__tokenlen~0 >= -1000000); {9886#true} is VALID [2022-04-08 09:27:14,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {9886#true} assume !!(~main__scheme~0 <= 1000000); {9886#true} is VALID [2022-04-08 09:27:14,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {9886#true} assume !!(~main__scheme~0 >= -1000000); {9886#true} is VALID [2022-04-08 09:27:14,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {9886#true} assume ~main__urilen~0 > 0; {9886#true} is VALID [2022-04-08 09:27:14,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {9886#true} assume ~main__tokenlen~0 > 0; {9886#true} is VALID [2022-04-08 09:27:14,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {9886#true} assume ~main__scheme~0 >= 0; {9886#true} is VALID [2022-04-08 09:27:14,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {9886#true} assume !(0 == ~main__scheme~0); {9886#true} is VALID [2022-04-08 09:27:14,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {9886#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9886#true} is VALID [2022-04-08 09:27:14,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9886#true} is VALID [2022-04-08 09:27:14,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {9886#true} is VALID [2022-04-08 09:27:14,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {9886#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {9886#true} is VALID [2022-04-08 09:27:14,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {9886#true} is VALID [2022-04-08 09:27:14,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~3); {9886#true} is VALID [2022-04-08 09:27:14,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {9886#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {9886#true} is VALID [2022-04-08 09:27:14,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {9886#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {9886#true} is VALID [2022-04-08 09:27:14,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {9886#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9886#true} is VALID [2022-04-08 09:27:14,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9886#true} is VALID [2022-04-08 09:27:14,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~5); {9886#true} is VALID [2022-04-08 09:27:14,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {9886#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {9886#true} is VALID [2022-04-08 09:27:14,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {9886#true} is VALID [2022-04-08 09:27:14,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~7); {9886#true} is VALID [2022-04-08 09:27:14,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {9886#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {9886#true} is VALID [2022-04-08 09:27:14,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {9886#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {9891#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-08 09:27:14,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {9891#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:27:14,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~9); {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:27:14,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__cp~0 != ~main__urilen~0 - 1; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:27:14,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:27:14,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:27:14,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:27:14,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:27:14,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:27:14,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {9893#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-08 09:27:14,296 INFO L290 TraceCheckUtils]: 41: Hoare triple {9893#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {9887#false} is VALID [2022-04-08 09:27:14,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {9887#false} assume !false; {9887#false} is VALID [2022-04-08 09:27:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:14,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:14,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215217990] [2022-04-08 09:27:14,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215217990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:14,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:14,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:14,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:14,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022615055] [2022-04-08 09:27:14,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022615055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:14,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:14,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:14,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087826192] [2022-04-08 09:27:14,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:14,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 09:27:14,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:14,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:14,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:14,330 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:14,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:14,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:14,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:14,330 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:15,016 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-04-08 09:27:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:27:15,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 09:27:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2022-04-08 09:27:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2022-04-08 09:27:15,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 93 transitions. [2022-04-08 09:27:15,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:15,095 INFO L225 Difference]: With dead ends: 88 [2022-04-08 09:27:15,095 INFO L226 Difference]: Without dead ends: 86 [2022-04-08 09:27:15,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:27:15,095 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 123 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:15,096 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 62 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:15,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-08 09:27:15,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2022-04-08 09:27:15,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:15,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:15,254 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:15,254 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:15,255 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-08 09:27:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-08 09:27:15,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:15,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:15,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-08 09:27:15,256 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-08 09:27:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:15,257 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-08 09:27:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-08 09:27:15,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:15,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:15,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:15,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-04-08 09:27:15,259 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2022-04-08 09:27:15,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:15,259 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-04-08 09:27:15,259 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:15,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 63 transitions. [2022-04-08 09:27:15,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-04-08 09:27:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 09:27:15,380 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:15,380 INFO L499 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:15,380 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 09:27:15,380 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:15,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:15,381 INFO L85 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 1 times [2022-04-08 09:27:15,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:15,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [680587914] [2022-04-08 09:27:15,381 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:15,381 INFO L85 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 2 times [2022-04-08 09:27:15,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:15,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768897401] [2022-04-08 09:27:15,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:15,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:15,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:15,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {10384#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {10376#true} is VALID [2022-04-08 09:27:15,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {10376#true} assume true; {10376#true} is VALID [2022-04-08 09:27:15,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10376#true} {10376#true} #225#return; {10376#true} is VALID [2022-04-08 09:27:15,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {10376#true} call ULTIMATE.init(); {10384#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:15,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {10384#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {10376#true} is VALID [2022-04-08 09:27:15,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {10376#true} assume true; {10376#true} is VALID [2022-04-08 09:27:15,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10376#true} {10376#true} #225#return; {10376#true} is VALID [2022-04-08 09:27:15,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {10376#true} call #t~ret11 := main(); {10376#true} is VALID [2022-04-08 09:27:15,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {10376#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {10376#true} is VALID [2022-04-08 09:27:15,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {10376#true} assume !!(~main__urilen~0 <= 1000000); {10376#true} is VALID [2022-04-08 09:27:15,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {10376#true} assume !!(~main__urilen~0 >= -1000000); {10376#true} is VALID [2022-04-08 09:27:15,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {10376#true} assume !!(~main__tokenlen~0 <= 1000000); {10376#true} is VALID [2022-04-08 09:27:15,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {10376#true} assume !!(~main__tokenlen~0 >= -1000000); {10376#true} is VALID [2022-04-08 09:27:15,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {10376#true} assume !!(~main__scheme~0 <= 1000000); {10376#true} is VALID [2022-04-08 09:27:15,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {10376#true} assume !!(~main__scheme~0 >= -1000000); {10376#true} is VALID [2022-04-08 09:27:15,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {10376#true} assume ~main__urilen~0 > 0; {10376#true} is VALID [2022-04-08 09:27:15,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {10376#true} assume ~main__tokenlen~0 > 0; {10376#true} is VALID [2022-04-08 09:27:15,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {10376#true} assume ~main__scheme~0 >= 0; {10376#true} is VALID [2022-04-08 09:27:15,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {10376#true} assume !(0 == ~main__scheme~0); {10376#true} is VALID [2022-04-08 09:27:15,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {10376#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,477 INFO L290 TraceCheckUtils]: 33: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,477 INFO L290 TraceCheckUtils]: 34: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,478 INFO L290 TraceCheckUtils]: 36: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,478 INFO L290 TraceCheckUtils]: 37: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,479 INFO L290 TraceCheckUtils]: 38: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,479 INFO L290 TraceCheckUtils]: 39: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,479 INFO L290 TraceCheckUtils]: 40: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,480 INFO L290 TraceCheckUtils]: 41: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10383#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-08 09:27:15,480 INFO L290 TraceCheckUtils]: 42: Hoare triple {10383#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {10377#false} is VALID [2022-04-08 09:27:15,480 INFO L290 TraceCheckUtils]: 43: Hoare triple {10377#false} assume !false; {10377#false} is VALID [2022-04-08 09:27:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:15,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:15,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768897401] [2022-04-08 09:27:15,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768897401] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:27:15,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735317505] [2022-04-08 09:27:15,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:27:15,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:27:15,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:27:15,482 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:27:15,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 09:27:15,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:27:15,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:27:15,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 09:27:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:15,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:27:15,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {10376#true} call ULTIMATE.init(); {10376#true} is VALID [2022-04-08 09:27:15,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {10376#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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {10376#true} is VALID [2022-04-08 09:27:15,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {10376#true} assume true; {10376#true} is VALID [2022-04-08 09:27:15,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10376#true} {10376#true} #225#return; {10376#true} is VALID [2022-04-08 09:27:15,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {10376#true} call #t~ret11 := main(); {10376#true} is VALID [2022-04-08 09:27:15,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {10376#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {10376#true} is VALID [2022-04-08 09:27:15,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {10376#true} assume !!(~main__urilen~0 <= 1000000); {10376#true} is VALID [2022-04-08 09:27:15,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {10376#true} assume !!(~main__urilen~0 >= -1000000); {10376#true} is VALID [2022-04-08 09:27:15,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {10376#true} assume !!(~main__tokenlen~0 <= 1000000); {10376#true} is VALID [2022-04-08 09:27:15,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {10376#true} assume !!(~main__tokenlen~0 >= -1000000); {10376#true} is VALID [2022-04-08 09:27:15,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {10376#true} assume !!(~main__scheme~0 <= 1000000); {10376#true} is VALID [2022-04-08 09:27:15,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {10376#true} assume !!(~main__scheme~0 >= -1000000); {10376#true} is VALID [2022-04-08 09:27:15,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {10376#true} assume ~main__urilen~0 > 0; {10376#true} is VALID [2022-04-08 09:27:15,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {10376#true} assume ~main__tokenlen~0 > 0; {10376#true} is VALID [2022-04-08 09:27:15,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {10376#true} assume ~main__scheme~0 >= 0; {10376#true} is VALID [2022-04-08 09:27:15,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {10376#true} assume !(0 == ~main__scheme~0); {10376#true} is VALID [2022-04-08 09:27:15,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {10376#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:15,867 INFO L290 TraceCheckUtils]: 41: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10511#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID [2022-04-08 09:27:15,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {10511#(<= 1 main_~__VERIFIER_assert__cond~10)} assume 0 == ~__VERIFIER_assert__cond~10; {10377#false} is VALID [2022-04-08 09:27:15,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {10377#false} assume !false; {10377#false} is VALID [2022-04-08 09:27:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:15,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:27:16,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {10377#false} assume !false; {10377#false} is VALID [2022-04-08 09:27:16,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {10511#(<= 1 main_~__VERIFIER_assert__cond~10)} assume 0 == ~__VERIFIER_assert__cond~10; {10377#false} is VALID [2022-04-08 09:27:16,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10511#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID [2022-04-08 09:27:16,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,107 INFO L290 TraceCheckUtils]: 38: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {10376#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-08 09:27:16,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {10376#true} assume !(0 == ~main__scheme~0); {10376#true} is VALID [2022-04-08 09:27:16,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {10376#true} assume ~main__scheme~0 >= 0; {10376#true} is VALID [2022-04-08 09:27:16,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {10376#true} assume ~main__tokenlen~0 > 0; {10376#true} is VALID [2022-04-08 09:27:16,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {10376#true} assume ~main__urilen~0 > 0; {10376#true} is VALID [2022-04-08 09:27:16,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {10376#true} assume !!(~main__scheme~0 >= -1000000); {10376#true} is VALID [2022-04-08 09:27:16,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {10376#true} assume !!(~main__scheme~0 <= 1000000); {10376#true} is VALID [2022-04-08 09:27:16,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {10376#true} assume !!(~main__tokenlen~0 >= -1000000); {10376#true} is VALID [2022-04-08 09:27:16,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {10376#true} assume !!(~main__tokenlen~0 <= 1000000); {10376#true} is VALID [2022-04-08 09:27:16,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {10376#true} assume !!(~main__urilen~0 >= -1000000); {10376#true} is VALID [2022-04-08 09:27:16,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {10376#true} assume !!(~main__urilen~0 <= 1000000); {10376#true} is VALID [2022-04-08 09:27:16,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {10376#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {10376#true} is VALID [2022-04-08 09:27:16,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {10376#true} call #t~ret11 := main(); {10376#true} is VALID [2022-04-08 09:27:16,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10376#true} {10376#true} #225#return; {10376#true} is VALID [2022-04-08 09:27:16,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {10376#true} assume true; {10376#true} is VALID [2022-04-08 09:27:16,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {10376#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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {10376#true} is VALID [2022-04-08 09:27:16,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {10376#true} call ULTIMATE.init(); {10376#true} is VALID [2022-04-08 09:27:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:16,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735317505] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:27:16,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:27:16,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-08 09:27:16,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:16,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [680587914] [2022-04-08 09:27:16,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [680587914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:16,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:16,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:16,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321279939] [2022-04-08 09:27:16,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:16,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 09:27:16,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:16,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:16,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:16,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:16,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:16,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:16,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:16,147 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:16,482 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-04-08 09:27:16,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:27:16,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 09:27:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:16,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-04-08 09:27:16,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-04-08 09:27:16,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2022-04-08 09:27:16,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:16,530 INFO L225 Difference]: With dead ends: 60 [2022-04-08 09:27:16,530 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 09:27:16,530 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:27:16,531 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 84 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:16,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 49 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 09:27:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-08 09:27:16,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:16,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:16,701 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:16,701 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:16,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:16,701 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-08 09:27:16,701 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-08 09:27:16,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:16,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:16,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-08 09:27:16,702 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-08 09:27:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:16,703 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-08 09:27:16,703 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-08 09:27:16,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:16,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:16,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:16,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-04-08 09:27:16,704 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2022-04-08 09:27:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:16,704 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-04-08 09:27:16,704 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:16,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 61 transitions. [2022-04-08 09:27:16,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-08 09:27:16,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 09:27:16,820 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:16,820 INFO L499 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, 1, 1, 1, 1] [2022-04-08 09:27:16,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 09:27:17,021 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:27:17,021 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:17,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 1 times [2022-04-08 09:27:17,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:17,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [166375873] [2022-04-08 09:27:17,022 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 2 times [2022-04-08 09:27:17,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:17,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143643740] [2022-04-08 09:27:17,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:17,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:17,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:17,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {11017#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {11009#true} is VALID [2022-04-08 09:27:17,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {11009#true} assume true; {11009#true} is VALID [2022-04-08 09:27:17,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11009#true} {11009#true} #225#return; {11009#true} is VALID [2022-04-08 09:27:17,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {11009#true} call ULTIMATE.init(); {11017#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:17,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {11017#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {11009#true} is VALID [2022-04-08 09:27:17,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {11009#true} assume true; {11009#true} is VALID [2022-04-08 09:27:17,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11009#true} {11009#true} #225#return; {11009#true} is VALID [2022-04-08 09:27:17,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {11009#true} call #t~ret11 := main(); {11009#true} is VALID [2022-04-08 09:27:17,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {11009#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {11009#true} is VALID [2022-04-08 09:27:17,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {11009#true} assume !!(~main__urilen~0 <= 1000000); {11009#true} is VALID [2022-04-08 09:27:17,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {11009#true} assume !!(~main__urilen~0 >= -1000000); {11009#true} is VALID [2022-04-08 09:27:17,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {11009#true} assume !!(~main__tokenlen~0 <= 1000000); {11009#true} is VALID [2022-04-08 09:27:17,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {11009#true} assume !!(~main__tokenlen~0 >= -1000000); {11009#true} is VALID [2022-04-08 09:27:17,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {11009#true} assume !!(~main__scheme~0 <= 1000000); {11009#true} is VALID [2022-04-08 09:27:17,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {11009#true} assume !!(~main__scheme~0 >= -1000000); {11009#true} is VALID [2022-04-08 09:27:17,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {11009#true} assume ~main__urilen~0 > 0; {11009#true} is VALID [2022-04-08 09:27:17,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {11009#true} assume ~main__tokenlen~0 > 0; {11009#true} is VALID [2022-04-08 09:27:17,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {11009#true} assume ~main__scheme~0 >= 0; {11009#true} is VALID [2022-04-08 09:27:17,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {11009#true} assume !(0 == ~main__scheme~0); {11009#true} is VALID [2022-04-08 09:27:17,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {11009#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11009#true} is VALID [2022-04-08 09:27:17,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {11009#true} is VALID [2022-04-08 09:27:17,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {11009#true} is VALID [2022-04-08 09:27:17,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {11009#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {11009#true} is VALID [2022-04-08 09:27:17,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {11009#true} is VALID [2022-04-08 09:27:17,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~3); {11009#true} is VALID [2022-04-08 09:27:17,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {11009#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {11009#true} is VALID [2022-04-08 09:27:17,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {11009#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {11009#true} is VALID [2022-04-08 09:27:17,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {11009#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {11009#true} is VALID [2022-04-08 09:27:17,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {11009#true} is VALID [2022-04-08 09:27:17,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~5); {11009#true} is VALID [2022-04-08 09:27:17,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {11009#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {11009#true} is VALID [2022-04-08 09:27:17,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {11009#true} is VALID [2022-04-08 09:27:17,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~7); {11009#true} is VALID [2022-04-08 09:27:17,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {11009#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {11009#true} is VALID [2022-04-08 09:27:17,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {11009#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {11009#true} is VALID [2022-04-08 09:27:17,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {11014#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} is VALID [2022-04-08 09:27:17,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {11014#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~9); {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:17,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:17,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:17,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:17,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:17,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:17,089 INFO L290 TraceCheckUtils]: 39: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:17,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-08 09:27:17,089 INFO L290 TraceCheckUtils]: 41: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {11016#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-08 09:27:17,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {11016#(not (= main_~__VERIFIER_assert__cond~15 0))} assume 0 == ~__VERIFIER_assert__cond~15; {11010#false} is VALID [2022-04-08 09:27:17,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {11010#false} assume !false; {11010#false} is VALID [2022-04-08 09:27:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:17,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:17,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143643740] [2022-04-08 09:27:17,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143643740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:17,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:17,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:17,091 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:17,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [166375873] [2022-04-08 09:27:17,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [166375873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:17,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:17,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:17,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506569061] [2022-04-08 09:27:17,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:17,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 09:27:17,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:17,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:17,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:17,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:17,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:17,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:17,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:17,120 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:17,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:17,583 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-08 09:27:17,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:27:17,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 09:27:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-08 09:27:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-08 09:27:17,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-04-08 09:27:17,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:17,636 INFO L225 Difference]: With dead ends: 69 [2022-04-08 09:27:17,636 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 09:27:17,636 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 09:27:17,636 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:17,637 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 65 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:17,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 09:27:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2022-04-08 09:27:17,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:17,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:17,784 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:17,784 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:17,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:17,785 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-08 09:27:17,785 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-08 09:27:17,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:17,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:17,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-08 09:27:17,786 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-08 09:27:17,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:17,787 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-08 09:27:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-08 09:27:17,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:17,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:17,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:17,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-04-08 09:27:17,789 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2022-04-08 09:27:17,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:17,789 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-04-08 09:27:17,789 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:17,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 59 transitions. [2022-04-08 09:27:17,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-08 09:27:17,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 09:27:17,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:17,906 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:17,906 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 09:27:17,907 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-08 09:27:17,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:17,907 INFO L85 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 1 times [2022-04-08 09:27:17,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:17,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [701317144] [2022-04-08 09:27:17,907 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:17,908 INFO L85 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 2 times [2022-04-08 09:27:17,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:17,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121144298] [2022-04-08 09:27:17,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:17,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:17,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:17,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {11418#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {11410#true} is VALID [2022-04-08 09:27:17,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {11410#true} assume true; {11410#true} is VALID [2022-04-08 09:27:17,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11410#true} {11410#true} #225#return; {11410#true} is VALID [2022-04-08 09:27:17,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {11410#true} call ULTIMATE.init(); {11418#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:17,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {11418#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {11410#true} is VALID [2022-04-08 09:27:17,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {11410#true} assume true; {11410#true} is VALID [2022-04-08 09:27:17,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11410#true} {11410#true} #225#return; {11410#true} is VALID [2022-04-08 09:27:17,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {11410#true} call #t~ret11 := main(); {11410#true} is VALID [2022-04-08 09:27:17,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {11410#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {11410#true} is VALID [2022-04-08 09:27:17,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {11410#true} assume !!(~main__urilen~0 <= 1000000); {11410#true} is VALID [2022-04-08 09:27:17,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {11410#true} assume !!(~main__urilen~0 >= -1000000); {11410#true} is VALID [2022-04-08 09:27:17,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {11410#true} assume !!(~main__tokenlen~0 <= 1000000); {11410#true} is VALID [2022-04-08 09:27:17,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {11410#true} assume !!(~main__tokenlen~0 >= -1000000); {11410#true} is VALID [2022-04-08 09:27:17,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {11410#true} assume !!(~main__scheme~0 <= 1000000); {11410#true} is VALID [2022-04-08 09:27:17,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {11410#true} assume !!(~main__scheme~0 >= -1000000); {11410#true} is VALID [2022-04-08 09:27:17,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {11410#true} assume ~main__urilen~0 > 0; {11410#true} is VALID [2022-04-08 09:27:17,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {11410#true} assume ~main__tokenlen~0 > 0; {11410#true} is VALID [2022-04-08 09:27:17,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {11410#true} assume ~main__scheme~0 >= 0; {11410#true} is VALID [2022-04-08 09:27:17,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {11410#true} assume !(0 == ~main__scheme~0); {11410#true} is VALID [2022-04-08 09:27:17,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {11410#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11410#true} is VALID [2022-04-08 09:27:17,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {11410#true} is VALID [2022-04-08 09:27:17,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {11410#true} is VALID [2022-04-08 09:27:17,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {11410#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {11410#true} is VALID [2022-04-08 09:27:17,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {11410#true} is VALID [2022-04-08 09:27:17,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~3); {11410#true} is VALID [2022-04-08 09:27:17,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {11410#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {11410#true} is VALID [2022-04-08 09:27:17,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {11410#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {11410#true} is VALID [2022-04-08 09:27:17,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {11410#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {11410#true} is VALID [2022-04-08 09:27:17,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {11410#true} is VALID [2022-04-08 09:27:17,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~5); {11410#true} is VALID [2022-04-08 09:27:17,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {11410#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {11410#true} is VALID [2022-04-08 09:27:17,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {11410#true} is VALID [2022-04-08 09:27:17,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~7); {11410#true} is VALID [2022-04-08 09:27:17,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {11410#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {11410#true} is VALID [2022-04-08 09:27:17,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {11410#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {11410#true} is VALID [2022-04-08 09:27:17,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {11410#true} is VALID [2022-04-08 09:27:17,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~9); {11410#true} is VALID [2022-04-08 09:27:17,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {11410#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {11410#true} is VALID [2022-04-08 09:27:17,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {11410#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {11410#true} is VALID [2022-04-08 09:27:17,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {11410#true} is VALID [2022-04-08 09:27:17,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {11410#true} is VALID [2022-04-08 09:27:17,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {11410#true} assume !!(0 == ~main____CPAchecker_TMP_3~0); {11410#true} is VALID [2022-04-08 09:27:17,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {11410#true} ~main__cp~0 := 1 + ~main__cp~0; {11410#true} is VALID [2022-04-08 09:27:17,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {11410#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {11410#true} is VALID [2022-04-08 09:27:17,982 INFO L290 TraceCheckUtils]: 41: Hoare triple {11410#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {11415#(or (and (= main_~__VERIFIER_assert__cond~10 0) (<= main_~main__urilen~0 main_~main__cp~0)) (and (= main_~__VERIFIER_assert__cond~10 1) (not (<= main_~main__urilen~0 main_~main__cp~0))))} is VALID [2022-04-08 09:27:17,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {11415#(or (and (= main_~__VERIFIER_assert__cond~10 0) (<= main_~main__urilen~0 main_~main__cp~0)) (and (= main_~__VERIFIER_assert__cond~10 1) (not (<= main_~main__urilen~0 main_~main__cp~0))))} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:27:17,983 INFO L290 TraceCheckUtils]: 43: Hoare triple {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:27:17,983 INFO L290 TraceCheckUtils]: 44: Hoare triple {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:27:17,983 INFO L290 TraceCheckUtils]: 45: Hoare triple {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-08 09:27:17,984 INFO L290 TraceCheckUtils]: 46: Hoare triple {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {11417#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-08 09:27:17,984 INFO L290 TraceCheckUtils]: 47: Hoare triple {11417#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {11411#false} is VALID [2022-04-08 09:27:17,984 INFO L290 TraceCheckUtils]: 48: Hoare triple {11411#false} assume !false; {11411#false} is VALID [2022-04-08 09:27:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:27:17,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:17,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121144298] [2022-04-08 09:27:17,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121144298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:17,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:17,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:17,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:17,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [701317144] [2022-04-08 09:27:17,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [701317144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:17,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:17,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:17,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321897943] [2022-04-08 09:27:17,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:17,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 09:27:17,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:17,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:18,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:18,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:18,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:18,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:18,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:18,015 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:18,501 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-08 09:27:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:27:18,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 09:27:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-08 09:27:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-08 09:27:18,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 71 transitions. [2022-04-08 09:27:18,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:18,577 INFO L225 Difference]: With dead ends: 75 [2022-04-08 09:27:18,577 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:27:18,578 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:27:18,578 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 88 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:18,579 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 55 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:18,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:27:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:27:18,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:18,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:27:18,580 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:27:18,580 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:27:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:18,580 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:27:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:27:18,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:18,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:18,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 0 states. [2022-04-08 09:27:18,580 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 0 states. [2022-04-08 09:27:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:18,580 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:27:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:27:18,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:18,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:18,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:18,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:27:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:27:18,581 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-04-08 09:27:18,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:18,581 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:27:18,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:18,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:27:18,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:27:18,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:18,584 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-04-08 09:27:18,584 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-04-08 09:27:18,584 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-04-08 09:27:18,585 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-04-08 09:27:18,585 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-04-08 09:27:18,585 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-04-08 09:27:18,585 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-04-08 09:27:18,585 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-04-08 09:27:18,585 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-04-08 09:27:18,585 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-04-08 09:27:18,585 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-04-08 09:27:18,585 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-04-08 09:27:18,585 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-04-08 09:27:18,586 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-04-08 09:27:18,586 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-04-08 09:27:18,586 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-04-08 09:27:18,586 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-04-08 09:27:18,586 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-04-08 09:27:18,586 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 09:27:18,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:27:38,134 WARN L232 SmtUtils]: Spent 11.25s on a formula simplification. DAG size of input: 124 DAG size of output: 120 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 09:28:35,639 WARN L232 SmtUtils]: Spent 43.86s on a formula simplification. DAG size of input: 130 DAG size of output: 125 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 09:28:48,937 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-08 09:28:48,937 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-08 09:28:48,937 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-08 09:28:48,938 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-08 09:28:48,938 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-08 09:28:48,938 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-08 09:28:48,938 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-08 09:28:48,938 INFO L878 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) the Hoare annotation is: false [2022-04-08 09:28:48,938 INFO L878 garLoopResultBuilder]: At program point mainEXIT(lines 13 439) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-08 09:28:48,938 INFO L878 garLoopResultBuilder]: At program point L374(line 374) the Hoare annotation is: false [2022-04-08 09:28:48,938 INFO L878 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: false [2022-04-08 09:28:48,938 INFO L878 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: false [2022-04-08 09:28:48,938 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 362) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (<= main_~main__urilen~0 main_~main__cp~0)) (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= |old(~__return_375~0)| ~__return_375~0)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4 .cse5)))) [2022-04-08 09:28:48,939 INFO L878 garLoopResultBuilder]: At program point L234(lines 234 338) the Hoare annotation is: (let ((.cse2 (= main_~__VERIFIER_assert__cond~9 1)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse6 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse7 (= main_~__VERIFIER_assert__cond~3 1)) (.cse8 (= |old(~__return_375~0)| ~__return_375~0)) (.cse0 (= main_~main__c~0 0)) (.cse16 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse12 (< 0 main_~main__scheme~0)) (.cse13 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse14 (<= 1 main_~main__cp~0)) (.cse15 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and (let ((.cse1 (let ((.cse9 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and .cse0 .cse1) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse1))) (not (= main_~__VERIFIER_assert__cond~10 0)) .cse16) (and .cse2 .cse3 (= main_~__VERIFIER_assert__cond~8 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse16 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-04-08 09:28:48,939 INFO L878 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) the Hoare annotation is: false [2022-04-08 09:28:48,939 INFO L878 garLoopResultBuilder]: At program point L135(lines 135 397) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5))) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0)) [2022-04-08 09:28:48,939 INFO L878 garLoopResultBuilder]: At program point L226(line 226) the Hoare annotation is: false [2022-04-08 09:28:48,939 INFO L878 garLoopResultBuilder]: At program point L61(lines 61 427) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-08 09:28:48,939 INFO L878 garLoopResultBuilder]: At program point L284(line 284) the Hoare annotation is: false [2022-04-08 09:28:48,939 INFO L878 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) the Hoare annotation is: false [2022-04-08 09:28:48,939 INFO L878 garLoopResultBuilder]: At program point L53(lines 53 433) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-08 09:28:48,940 INFO L878 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: false [2022-04-08 09:28:48,940 INFO L878 garLoopResultBuilder]: At program point L177(line 177) the Hoare annotation is: false [2022-04-08 09:28:48,940 INFO L878 garLoopResultBuilder]: At program point L111(lines 111 405) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~2 1) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-04-08 09:28:48,940 INFO L878 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) the Hoare annotation is: false [2022-04-08 09:28:48,940 INFO L878 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5))) (< main_~main__cp~0 main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-08 09:28:48,940 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 354) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0))) [2022-04-08 09:28:48,940 INFO L878 garLoopResultBuilder]: At program point L384(lines 384 393) the Hoare annotation is: (and (not (<= main_~main__scheme~0 0)) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~17 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~16 0)) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-08 09:28:48,940 INFO L878 garLoopResultBuilder]: At program point L95(lines 95 412) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-04-08 09:28:48,940 INFO L878 garLoopResultBuilder]: At program point L29(lines 29 437) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-08 09:28:48,941 INFO L878 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) the Hoare annotation is: false [2022-04-08 09:28:48,941 INFO L878 garLoopResultBuilder]: At program point L145(line 145) the Hoare annotation is: false [2022-04-08 09:28:48,941 INFO L878 garLoopResultBuilder]: At program point L401(lines 131 402) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (not (<= main_~main__urilen~0 main_~main__cp~0))) [2022-04-08 09:28:48,941 INFO L878 garLoopResultBuilder]: At program point mainFINAL(lines 13 439) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-08 09:28:48,941 INFO L878 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) the Hoare annotation is: false [2022-04-08 09:28:48,941 INFO L878 garLoopResultBuilder]: At program point L104(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-04-08 09:28:48,941 INFO L878 garLoopResultBuilder]: At program point L71(lines 71 416) the Hoare annotation is: (and (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0)) [2022-04-08 09:28:48,941 INFO L878 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (and (let ((.cse0 (let ((.cse1 (= main_~__VERIFIER_assert__cond~9 1)) (.cse2 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse6 (= main_~__VERIFIER_assert__cond~3 1)) (.cse7 (not (= main_~__VERIFIER_assert__cond~9 0))) (.cse8 (= |old(~__return_375~0)| ~__return_375~0)) (.cse9 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse11 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse13 (< 0 main_~main__scheme~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse15 (<= 1 main_~main__cp~0)) (.cse16 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and (= main_~main__c~0 0) .cse0) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse0))) (= main_~__VERIFIER_assert__cond~10 1)) [2022-04-08 09:28:48,941 INFO L878 garLoopResultBuilder]: At program point L294(lines 294 318) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~14 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-08 09:28:48,941 INFO L878 garLoopResultBuilder]: At program point L162(lines 162 359) the Hoare annotation is: (let ((.cse0 (let ((.cse6 (not (<= main_~main__scheme~0 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse9 (<= 1 main_~main__cp~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse6 .cse7 .cse8 (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0)) .cse9 .cse10) (and .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse9 .cse10)))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (= |old(~__return_375~0)| ~__return_375~0)) (.cse1 (+ main_~main__cp~0 1)) (.cse5 (not (= main_~__VERIFIER_assert__cond~5 0)))) (or (and .cse0 (= main_~main__urilen~0 .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (< .cse1 main_~main__urilen~0) .cse5))) [2022-04-08 09:28:48,941 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) the Hoare annotation is: false [2022-04-08 09:28:48,941 INFO L878 garLoopResultBuilder]: At program point L63(lines 63 422) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-08 09:28:48,942 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-08 09:28:48,942 INFO L878 garLoopResultBuilder]: At program point L253(lines 253 329) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~main__c~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= main_~main__c~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2022-04-08 09:28:48,942 INFO L878 garLoopResultBuilder]: At program point L187(lines 187 355) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0))) [2022-04-08 09:28:48,942 INFO L878 garLoopResultBuilder]: At program point L410(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-08 09:28:48,942 INFO L878 garLoopResultBuilder]: At program point L212(lines 212 346) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (= main_~__VERIFIER_assert__cond~8 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (= main_~main__c~0 0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-08 09:28:48,942 INFO L878 garLoopResultBuilder]: At program point L113(line 113) the Hoare annotation is: false [2022-04-08 09:28:48,942 INFO L878 garLoopResultBuilder]: At program point L47(lines 47 434) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-08 09:28:48,942 INFO L878 garLoopResultBuilder]: At program point L270(lines 270 322) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-08 09:28:48,943 INFO L878 garLoopResultBuilder]: At program point L204(lines 204 353) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-08 09:28:48,943 INFO L878 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) the Hoare annotation is: false [2022-04-08 09:28:48,943 INFO L878 garLoopResultBuilder]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) the Hoare annotation is: false [2022-04-08 09:28:48,943 INFO L878 garLoopResultBuilder]: At program point L262(lines 262 328) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~main__c~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= main_~main__c~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2022-04-08 09:28:48,943 INFO L878 garLoopResultBuilder]: At program point L386(line 386) the Hoare annotation is: false [2022-04-08 09:28:48,943 INFO L878 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: false [2022-04-08 09:28:48,943 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 360) the Hoare annotation is: (let ((.cse0 (let ((.cse6 (not (<= main_~main__scheme~0 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse9 (<= 1 main_~main__cp~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse6 .cse7 .cse8 (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0)) .cse9 .cse10) (and .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse9 .cse10)))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (= |old(~__return_375~0)| ~__return_375~0)) (.cse1 (+ main_~main__cp~0 1)) (.cse5 (not (= main_~__VERIFIER_assert__cond~5 0)))) (or (and .cse0 (= main_~main__urilen~0 .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (< .cse1 main_~main__urilen~0) .cse5))) [2022-04-08 09:28:48,943 INFO L878 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) the Hoare annotation is: false [2022-04-08 09:28:48,943 INFO L878 garLoopResultBuilder]: At program point L23(lines 23 438) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-08 09:28:48,944 INFO L878 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) the Hoare annotation is: false [2022-04-08 09:28:48,944 INFO L878 garLoopResultBuilder]: At program point L296(line 296) the Hoare annotation is: false [2022-04-08 09:28:48,944 INFO L878 garLoopResultBuilder]: At program point L65(lines 65 417) the Hoare annotation is: (and (<= 0 main_~main__scheme~0) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-08 09:28:48,944 INFO L878 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) the Hoare annotation is: false [2022-04-08 09:28:48,944 INFO L878 garLoopResultBuilder]: At program point L255(line 255) the Hoare annotation is: false [2022-04-08 09:28:48,944 INFO L878 garLoopResultBuilder]: At program point L189(line 189) the Hoare annotation is: false [2022-04-08 09:28:48,944 INFO L878 garLoopResultBuilder]: At program point L123(lines 123 403) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~2 1) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-04-08 09:28:48,944 INFO L878 garLoopResultBuilder]: At program point L214(line 214) the Hoare annotation is: false [2022-04-08 09:28:48,944 INFO L878 garLoopResultBuilder]: At program point L272(line 272) the Hoare annotation is: false [2022-04-08 09:28:48,944 INFO L878 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) the Hoare annotation is: false [2022-04-08 09:28:48,944 INFO L878 garLoopResultBuilder]: At program point L41(lines 41 435) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-08 09:28:48,944 INFO L878 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) the Hoare annotation is: false [2022-04-08 09:28:48,945 INFO L878 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: false [2022-04-08 09:28:48,945 INFO L878 garLoopResultBuilder]: At program point L372(lines 372 395) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (not (= main_~__VERIFIER_assert__cond~16 0))) (.cse5 (<= 1 main_~main__cp~0)) (.cse6 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~__VERIFIER_assert__cond~2 1) .cse5 .cse6))) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0)) [2022-04-08 09:28:48,945 INFO L878 garLoopResultBuilder]: At program point L83(lines 83 414) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-04-08 09:28:48,945 INFO L878 garLoopResultBuilder]: At program point L306(lines 306 316) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~14 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~15 0))) [2022-04-08 09:28:48,945 INFO L878 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) the Hoare annotation is: false [2022-04-08 09:28:48,945 INFO L878 garLoopResultBuilder]: At program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) the Hoare annotation is: false [2022-04-08 09:28:48,945 INFO L878 garLoopResultBuilder]: At program point L224(lines 224 344) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (= main_~__VERIFIER_assert__cond~8 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (= main_~main__c~0 0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-08 09:28:48,945 INFO L878 garLoopResultBuilder]: At program point L125(line 125) the Hoare annotation is: false [2022-04-08 09:28:48,945 INFO L878 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) the Hoare annotation is: false [2022-04-08 09:28:48,945 INFO L878 garLoopResultBuilder]: At program point L59(lines 59 432) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-08 09:28:48,946 INFO L878 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse9 (= main_~main__c~0 0)) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (< main_~main__cp~0 main_~main__urilen~0)) (.cse6 (= main_~__VERIFIER_assert__cond~3 1)) (.cse7 (= |old(~__return_375~0)| ~__return_375~0)) (.cse8 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~8 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0) .cse10 .cse11 .cse12 .cse13 .cse14) (and (let ((.cse15 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse15) (and .cse9 .cse15))) (not (= main_~__VERIFIER_assert__cond~10 0))))) [2022-04-08 09:28:48,946 INFO L878 garLoopResultBuilder]: At program point L282(lines 282 320) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-08 09:28:48,946 INFO L878 garLoopResultBuilder]: At program point L241(lines 241 331) the Hoare annotation is: (let ((.cse14 (let ((.cse18 (<= main_~main__urilen~0 main_~main__cp~0))) (or (and (= main_~__VERIFIER_assert__cond~10 0) .cse18) (and (= main_~__VERIFIER_assert__cond~10 1) (not .cse18))))) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (= main_~main__c~0 0)) (.cse8 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse9 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse10 (< 0 main_~main__scheme~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse12 (<= 1 main_~main__cp~0)) (.cse13 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0))) (or (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~8 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse14 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse17 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~main__c~0) .cse16 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15)))))) [2022-04-08 09:28:48,946 INFO L878 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) the Hoare annotation is: false [2022-04-08 09:28:48,946 INFO L878 garLoopResultBuilder]: At program point L175(lines 175 357) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (not (= main_~__VERIFIER_assert__cond~4 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0))) [2022-04-08 09:28:48,946 INFO L878 garLoopResultBuilder]: At program point L35(lines 35 436) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-08 09:28:48,946 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:28:48,946 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 09:28:48,947 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:28:48,947 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:28:48,947 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:28:48,947 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:28:48,947 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:28:48,950 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 09:28:48,951 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:28:48,954 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:28:48,955 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 09:28:48,955 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 09:28:48,956 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 09:28:48,956 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 09:28:48,956 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-08 09:28:49,049 INFO L163 areAnnotationChecker]: CFG has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:28:49,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:28:49 BoogieIcfgContainer [2022-04-08 09:28:49,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:28:49,083 INFO L158 Benchmark]: Toolchain (without parser) took 116064.86ms. Allocated memory was 199.2MB in the beginning and 404.8MB in the end (delta: 205.5MB). Free memory was 144.2MB in the beginning and 348.2MB in the end (delta: -204.0MB). Peak memory consumption was 216.5MB. Max. memory is 8.0GB. [2022-04-08 09:28:49,083 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 199.2MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:28:49,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.29ms. Allocated memory is still 199.2MB. Free memory was 144.0MB in the beginning and 163.7MB in the end (delta: -19.7MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-08 09:28:49,083 INFO L158 Benchmark]: Boogie Preprocessor took 47.75ms. Allocated memory is still 199.2MB. Free memory was 163.7MB in the beginning and 161.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:28:49,084 INFO L158 Benchmark]: RCFGBuilder took 469.24ms. Allocated memory is still 199.2MB. Free memory was 161.6MB in the beginning and 142.2MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-04-08 09:28:49,084 INFO L158 Benchmark]: TraceAbstraction took 115189.86ms. Allocated memory was 199.2MB in the beginning and 404.8MB in the end (delta: 205.5MB). Free memory was 141.7MB in the beginning and 348.2MB in the end (delta: -206.5MB). Peak memory consumption was 214.5MB. Max. memory is 8.0GB. [2022-04-08 09:28:49,085 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.16ms. Allocated memory is still 199.2MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 353.29ms. Allocated memory is still 199.2MB. Free memory was 144.0MB in the beginning and 163.7MB in the end (delta: -19.7MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.75ms. Allocated memory is still 199.2MB. Free memory was 163.7MB in the beginning and 161.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 469.24ms. Allocated memory is still 199.2MB. Free memory was 161.6MB in the beginning and 142.2MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 115189.86ms. Allocated memory was 199.2MB in the beginning and 404.8MB in the end (delta: 205.5MB). Free memory was 141.7MB in the beginning and 348.2MB in the end (delta: -206.5MB). Peak memory consumption was 214.5MB. Max. memory is 8.0GB. * 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 - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 94 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 115.0s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 90.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3685 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3685 mSDsluCounter, 1675 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 350 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2505 IncrementalHoareTripleChecker+Invalid, 2695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 1325 mSDtfsCounter, 2505 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 269 SyntacticMatches, 18 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 296 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 87 LocationsWithAnnotation, 87 PreInvPairs, 140 NumberOfFragments, 2985 HoareAnnotationTreeSize, 87 FomulaSimplifications, 286041 FormulaSimplificationTreeSizeReduction, 86.9s HoareSimplificationTime, 87 FomulaSimplificationsInter, 619907 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((main__c == 0 && (((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen))) || ((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && (((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)))) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && main__cp < main__urilen) && \old(__return_375) == __return_375 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(main__urilen <= main__cp) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) && \old(__return_375) == __return_375 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen))) || (main__c == 0 && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)))) && !(__VERIFIER_assert__cond == 0)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: !(__VERIFIER_assert__cond == 0) || \old(__return_375) == __return_375 RESULT: Ultimate proved your program to be correct! [2022-04-08 09:28:49,140 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...