/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.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-07 11:25:59,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 11:25:59,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 11:25:59,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 11:25:59,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 11:25:59,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 11:25:59,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 11:25:59,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 11:25:59,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 11:25:59,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 11:25:59,643 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 11:25:59,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 11:25:59,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 11:25:59,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 11:25:59,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 11:25:59,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 11:25:59,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 11:25:59,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 11:25:59,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 11:25:59,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 11:25:59,658 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 11:25:59,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 11:25:59,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 11:25:59,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 11:25:59,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 11:25:59,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 11:25:59,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 11:25:59,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 11:25:59,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 11:25:59,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 11:25:59,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 11:25:59,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 11:25:59,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 11:25:59,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 11:25:59,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 11:25:59,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 11:25:59,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 11:25:59,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 11:25:59,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 11:25:59,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 11:25:59,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 11:25:59,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 11:25:59,672 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 11:25:59,698 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 11:25:59,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 11:25:59,698 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 11:25:59,698 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 11:25:59,699 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 11:25:59,699 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 11:25:59,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 11:25:59,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 11:25:59,700 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 11:25:59,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 11:25:59,700 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 11:25:59,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 11:25:59,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 11:25:59,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 11:25:59,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 11:25:59,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 11:25:59,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 11:25:59,701 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 11:25:59,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 11:25:59,701 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 11:25:59,701 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 11:25:59,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 11:25:59,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 11:25:59,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 11:25:59,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 11:25:59,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 11:25:59,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 11:25:59,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 11:25:59,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 11:25:59,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 11:25:59,703 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 11:25:59,703 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 11:25:59,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 11:25:59,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 11:25:59,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 11:25:59,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 11:25:59,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 11:25:59,895 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 11:25:59,896 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 11:25:59,897 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-07 11:25:59,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b51c02ca/a1bac39056044bd1b419277f0f31a674/FLAG4c83eb60b [2022-04-07 11:26:00,255 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 11:26:00,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-04-07 11:26:00,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b51c02ca/a1bac39056044bd1b419277f0f31a674/FLAG4c83eb60b [2022-04-07 11:26:00,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b51c02ca/a1bac39056044bd1b419277f0f31a674 [2022-04-07 11:26:00,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 11:26:00,694 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 11:26:00,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 11:26:00,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 11:26:00,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 11:26:00,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:26:00" (1/1) ... [2022-04-07 11:26:00,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31be990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:26:00, skipping insertion in model container [2022-04-07 11:26:00,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:26:00" (1/1) ... [2022-04-07 11:26:00,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 11:26:00,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 11:26:00,856 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-07 11:26:00,859 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-07 11:26:00,860 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-07 11:26:00,861 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-07 11:26:00,863 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-07 11:26:00,864 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-07 11:26:00,866 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-07 11:26:00,867 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-07 11:26:00,869 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-07 11:26:00,870 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-07 11:26:00,872 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-07 11:26:00,873 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-07 11:26:00,875 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-07 11:26:00,876 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-07 11:26:00,877 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-07 11:26:00,878 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-07 11:26:00,880 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-07 11:26:00,881 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-07 11:26:00,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 11:26:00,889 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 11:26:00,899 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-07 11:26:00,900 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-07 11:26:00,901 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-07 11:26:00,902 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-07 11:26:00,915 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-07 11:26:00,916 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-07 11:26:00,917 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-07 11:26:00,918 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-07 11:26:00,920 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-07 11:26:00,921 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-07 11:26:00,922 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-07 11:26:00,931 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-07 11:26:00,936 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-07 11:26:00,937 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-07 11:26:00,938 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-07 11:26:00,939 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-07 11:26:00,940 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-07 11:26:00,941 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-07 11:26:00,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 11:26:00,964 INFO L208 MainTranslator]: Completed translation [2022-04-07 11:26:00,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:26:00 WrapperNode [2022-04-07 11:26:00,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 11:26:00,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 11:26:00,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 11:26:00,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 11:26:00,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:26:00" (1/1) ... [2022-04-07 11:26:00,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:26:00" (1/1) ... [2022-04-07 11:26:00,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:26:00" (1/1) ... [2022-04-07 11:26:00,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:26:00" (1/1) ... [2022-04-07 11:26:00,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:26:00" (1/1) ... [2022-04-07 11:26:01,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:26:00" (1/1) ... [2022-04-07 11:26:01,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:26:00" (1/1) ... [2022-04-07 11:26:01,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 11:26:01,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 11:26:01,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 11:26:01,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 11:26:01,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:26:00" (1/1) ... [2022-04-07 11:26:01,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 11:26:01,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:26:01,026 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-07 11:26:01,027 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-07 11:26:01,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 11:26:01,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 11:26:01,049 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 11:26:01,049 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 11:26:01,049 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 11:26:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 11:26:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 11:26:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 11:26:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 11:26:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 11:26:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 11:26:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 11:26:01,050 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 11:26:01,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 11:26:01,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 11:26:01,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 11:26:01,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 11:26:01,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 11:26:01,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 11:26:01,116 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 11:26:01,117 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 11:26:01,365 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 11:26:01,370 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 11:26:01,370 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-07 11:26:01,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:26:01 BoogieIcfgContainer [2022-04-07 11:26:01,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 11:26:01,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 11:26:01,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 11:26:01,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 11:26:01,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:26:00" (1/3) ... [2022-04-07 11:26:01,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1147644b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:26:01, skipping insertion in model container [2022-04-07 11:26:01,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:26:00" (2/3) ... [2022-04-07 11:26:01,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1147644b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:26:01, skipping insertion in model container [2022-04-07 11:26:01,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:26:01" (3/3) ... [2022-04-07 11:26:01,385 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2022-04-07 11:26:01,388 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 11:26:01,388 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-04-07 11:26:01,417 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 11:26:01,421 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-07 11:26:01,421 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-04-07 11:26:01,443 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-07 11:26:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 11:26:01,447 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:01,447 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-07 11:26:01,447 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-07 11:26:01,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 1 times [2022-04-07 11:26:01,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:01,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568677660] [2022-04-07 11:26:01,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:01,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:01,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:01,632 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-07 11:26:01,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} assume true; {90#true} is VALID [2022-04-07 11:26:01,632 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} #225#return; {90#true} is VALID [2022-04-07 11:26:01,634 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-07 11:26:01,635 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-07 11:26:01,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2022-04-07 11:26:01,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #225#return; {90#true} is VALID [2022-04-07 11:26:01,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} call #t~ret11 := main(); {90#true} is VALID [2022-04-07 11:26:01,636 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-07 11:26:01,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} assume !!(~main__urilen~0 <= 1000000); {90#true} is VALID [2022-04-07 11:26:01,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {90#true} assume !!(~main__urilen~0 >= -1000000); {90#true} is VALID [2022-04-07 11:26:01,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {90#true} assume !!(~main__tokenlen~0 <= 1000000); {90#true} is VALID [2022-04-07 11:26:01,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {90#true} assume !!(~main__tokenlen~0 >= -1000000); {90#true} is VALID [2022-04-07 11:26:01,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {90#true} assume !!(~main__scheme~0 <= 1000000); {90#true} is VALID [2022-04-07 11:26:01,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {90#true} assume !!(~main__scheme~0 >= -1000000); {90#true} is VALID [2022-04-07 11:26:01,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {90#true} assume ~main__urilen~0 > 0; {90#true} is VALID [2022-04-07 11:26:01,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {90#true} assume ~main__tokenlen~0 > 0; {90#true} is VALID [2022-04-07 11:26:01,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {90#true} assume ~main__scheme~0 >= 0; {90#true} is VALID [2022-04-07 11:26:01,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {90#true} assume !(0 == ~main__scheme~0); {90#true} is VALID [2022-04-07 11:26:01,639 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-07 11:26:01,639 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-07 11:26:01,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {91#false} assume !false; {91#false} is VALID [2022-04-07 11:26:01,640 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-07 11:26:01,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:01,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568677660] [2022-04-07 11:26:01,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568677660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:01,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:01,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 11:26:01,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101355590] [2022-04-07 11:26:01,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:01,646 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-07 11:26:01,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:01,649 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-07 11:26:01,671 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-07 11:26:01,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 11:26:01,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:01,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 11:26:01,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 11:26:01,694 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-07 11:26:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:01,959 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2022-04-07 11:26:01,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 11:26:01,959 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-07 11:26:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:01,960 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-07 11:26:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-07 11:26:01,972 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-07 11:26:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-07 11:26:01,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2022-04-07 11:26:02,082 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-07 11:26:02,092 INFO L225 Difference]: With dead ends: 93 [2022-04-07 11:26:02,092 INFO L226 Difference]: Without dead ends: 80 [2022-04-07 11:26:02,094 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-07 11:26:02,097 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-07 11:26:02,100 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-07 11:26:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-07 11:26:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-07 11:26:02,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:02,138 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-07 11:26:02,139 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-07 11:26:02,140 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-07 11:26:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:02,145 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-07 11:26:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-07 11:26:02,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:02,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:02,146 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-07 11:26:02,147 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-07 11:26:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:02,159 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-07 11:26:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-07 11:26:02,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:02,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:02,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:02,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:02,162 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-07 11:26:02,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-04-07 11:26:02,170 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2022-04-07 11:26:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:02,170 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-04-07 11:26:02,170 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-07 11:26:02,170 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-07 11:26:02,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 11:26:02,171 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:02,171 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-07 11:26:02,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 11:26:02,172 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-07 11:26:02,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 1 times [2022-04-07 11:26:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:02,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367633835] [2022-04-07 11:26:02,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:02,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:02,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#(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; {451#true} is VALID [2022-04-07 11:26:02,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {451#true} assume true; {451#true} is VALID [2022-04-07 11:26:02,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {451#true} {451#true} #225#return; {451#true} is VALID [2022-04-07 11:26:02,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {451#true} call ULTIMATE.init(); {460#(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-07 11:26:02,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#(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; {451#true} is VALID [2022-04-07 11:26:02,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {451#true} assume true; {451#true} is VALID [2022-04-07 11:26:02,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {451#true} {451#true} #225#return; {451#true} is VALID [2022-04-07 11:26:02,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {451#true} call #t~ret11 := main(); {451#true} is VALID [2022-04-07 11:26:02,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {451#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; {451#true} is VALID [2022-04-07 11:26:02,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {451#true} assume !!(~main__urilen~0 <= 1000000); {451#true} is VALID [2022-04-07 11:26:02,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {451#true} assume !!(~main__urilen~0 >= -1000000); {451#true} is VALID [2022-04-07 11:26:02,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {451#true} assume !!(~main__tokenlen~0 <= 1000000); {451#true} is VALID [2022-04-07 11:26:02,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {451#true} assume !!(~main__tokenlen~0 >= -1000000); {451#true} is VALID [2022-04-07 11:26:02,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {451#true} assume !!(~main__scheme~0 <= 1000000); {451#true} is VALID [2022-04-07 11:26:02,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {451#true} assume !!(~main__scheme~0 >= -1000000); {451#true} is VALID [2022-04-07 11:26:02,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {451#true} assume ~main__urilen~0 > 0; {451#true} is VALID [2022-04-07 11:26:02,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {451#true} assume ~main__tokenlen~0 > 0; {451#true} is VALID [2022-04-07 11:26:02,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {451#true} assume ~main__scheme~0 >= 0; {456#(< 0 (+ main_~main__scheme~0 1))} is VALID [2022-04-07 11:26:02,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {456#(< 0 (+ main_~main__scheme~0 1))} assume !(0 == ~main__scheme~0); {457#(not (<= main_~main__scheme~0 0))} is VALID [2022-04-07 11:26:02,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {457#(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; {458#(<= 1 main_~main__cp~0)} is VALID [2022-04-07 11:26:02,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {458#(<= 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; {459#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-07 11:26:02,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {459#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {452#false} is VALID [2022-04-07 11:26:02,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {452#false} assume !false; {452#false} is VALID [2022-04-07 11:26:02,300 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-07 11:26:02,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:02,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367633835] [2022-04-07 11:26:02,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367633835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:02,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:02,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 11:26:02,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792002506] [2022-04-07 11:26:02,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:02,301 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-07 11:26:02,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:02,302 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-07 11:26:02,318 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-07 11:26:02,319 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 11:26:02,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:02,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 11:26:02,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-07 11:26:02,320 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-07 11:26:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:02,609 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-07 11:26:02,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 11:26:02,609 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-07 11:26:02,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:02,610 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-07 11:26:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-04-07 11:26:02,611 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-07 11:26:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-04-07 11:26:02,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 83 transitions. [2022-04-07 11:26:02,676 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-07 11:26:02,677 INFO L225 Difference]: With dead ends: 80 [2022-04-07 11:26:02,678 INFO L226 Difference]: Without dead ends: 78 [2022-04-07 11:26:02,678 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-07 11:26:02,679 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-07 11:26:02,679 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-07 11:26:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-07 11:26:02,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-07 11:26:02,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:02,686 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-07 11:26:02,687 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-07 11:26:02,687 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-07 11:26:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:02,691 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-07 11:26:02,691 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-07 11:26:02,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:02,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:02,691 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-07 11:26:02,692 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-07 11:26:02,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:02,694 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-07 11:26:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-07 11:26:02,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:02,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:02,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:02,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:02,699 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-07 11:26:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-07 11:26:02,701 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2022-04-07 11:26:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:02,701 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-07 11:26:02,701 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-07 11:26:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-07 11:26:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 11:26:02,702 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:02,702 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-07 11:26:02,702 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 11:26:02,702 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-07 11:26:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:02,703 INFO L85 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 1 times [2022-04-07 11:26:02,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:02,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550077722] [2022-04-07 11:26:02,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:02,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:02,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:02,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {808#(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; {801#true} is VALID [2022-04-07 11:26:02,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {801#true} assume true; {801#true} is VALID [2022-04-07 11:26:02,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {801#true} {801#true} #225#return; {801#true} is VALID [2022-04-07 11:26:02,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {801#true} call ULTIMATE.init(); {808#(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-07 11:26:02,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#(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; {801#true} is VALID [2022-04-07 11:26:02,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {801#true} assume true; {801#true} is VALID [2022-04-07 11:26:02,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {801#true} {801#true} #225#return; {801#true} is VALID [2022-04-07 11:26:02,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {801#true} call #t~ret11 := main(); {801#true} is VALID [2022-04-07 11:26:02,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {801#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; {801#true} is VALID [2022-04-07 11:26:02,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {801#true} assume !!(~main__urilen~0 <= 1000000); {801#true} is VALID [2022-04-07 11:26:02,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {801#true} assume !!(~main__urilen~0 >= -1000000); {801#true} is VALID [2022-04-07 11:26:02,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {801#true} assume !!(~main__tokenlen~0 <= 1000000); {801#true} is VALID [2022-04-07 11:26:02,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {801#true} assume !!(~main__tokenlen~0 >= -1000000); {801#true} is VALID [2022-04-07 11:26:02,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {801#true} assume !!(~main__scheme~0 <= 1000000); {801#true} is VALID [2022-04-07 11:26:02,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {801#true} assume !!(~main__scheme~0 >= -1000000); {801#true} is VALID [2022-04-07 11:26:02,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {801#true} assume ~main__urilen~0 > 0; {801#true} is VALID [2022-04-07 11:26:02,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {801#true} assume ~main__tokenlen~0 > 0; {801#true} is VALID [2022-04-07 11:26:02,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {801#true} assume ~main__scheme~0 >= 0; {801#true} is VALID [2022-04-07 11:26:02,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {801#true} assume !(0 == ~main__scheme~0); {801#true} is VALID [2022-04-07 11:26:02,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {801#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; {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:02,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {806#(<= (+ 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; {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:02,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {806#(<= (+ 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; {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:02,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {806#(<= (+ 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; {807#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-07 11:26:02,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {807#(not (= main_~__VERIFIER_assert__cond~2 0))} assume 0 == ~__VERIFIER_assert__cond~2; {802#false} is VALID [2022-04-07 11:26:02,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {802#false} assume !false; {802#false} is VALID [2022-04-07 11:26:02,766 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-07 11:26:02,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:02,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550077722] [2022-04-07 11:26:02,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550077722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:02,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:02,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 11:26:02,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613177346] [2022-04-07 11:26:02,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:02,767 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-07 11:26:02,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:02,767 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-07 11:26:02,779 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-07 11:26:02,779 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 11:26:02,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:02,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 11:26:02,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 11:26:02,780 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-07 11:26:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:03,018 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-04-07 11:26:03,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 11:26:03,018 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-07 11:26:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:03,018 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-07 11:26:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-04-07 11:26:03,020 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-07 11:26:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-04-07 11:26:03,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 106 transitions. [2022-04-07 11:26:03,110 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-07 11:26:03,112 INFO L225 Difference]: With dead ends: 101 [2022-04-07 11:26:03,112 INFO L226 Difference]: Without dead ends: 99 [2022-04-07 11:26:03,112 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-07 11:26:03,113 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-07 11:26:03,113 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-07 11:26:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-07 11:26:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2022-04-07 11:26:03,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:03,128 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-07 11:26:03,128 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-07 11:26:03,129 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-07 11:26:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:03,131 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-07 11:26:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-07 11:26:03,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:03,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:03,134 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-07 11:26:03,134 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-07 11:26:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:03,137 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-07 11:26:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-07 11:26:03,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:03,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:03,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:03,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:03,141 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-07 11:26:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-07 11:26:03,143 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2022-04-07 11:26:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:03,143 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-07 11:26:03,143 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-07 11:26:03,144 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-07 11:26:03,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 11:26:03,144 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:03,144 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-07 11:26:03,144 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 11:26:03,146 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-07 11:26:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:03,147 INFO L85 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 1 times [2022-04-07 11:26:03,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:03,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601281842] [2022-04-07 11:26:03,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:03,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:03,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:03,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {1218#(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; {1210#true} is VALID [2022-04-07 11:26:03,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-07 11:26:03,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1210#true} {1210#true} #225#return; {1210#true} is VALID [2022-04-07 11:26:03,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1218#(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-07 11:26:03,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {1218#(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; {1210#true} is VALID [2022-04-07 11:26:03,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-07 11:26:03,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #225#return; {1210#true} is VALID [2022-04-07 11:26:03,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret11 := main(); {1210#true} is VALID [2022-04-07 11:26:03,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#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; {1210#true} is VALID [2022-04-07 11:26:03,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {1210#true} assume !!(~main__urilen~0 <= 1000000); {1210#true} is VALID [2022-04-07 11:26:03,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {1210#true} assume !!(~main__urilen~0 >= -1000000); {1210#true} is VALID [2022-04-07 11:26:03,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {1210#true} assume !!(~main__tokenlen~0 <= 1000000); {1210#true} is VALID [2022-04-07 11:26:03,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {1210#true} assume !!(~main__tokenlen~0 >= -1000000); {1210#true} is VALID [2022-04-07 11:26:03,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {1210#true} assume !!(~main__scheme~0 <= 1000000); {1210#true} is VALID [2022-04-07 11:26:03,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {1210#true} assume !!(~main__scheme~0 >= -1000000); {1210#true} is VALID [2022-04-07 11:26:03,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {1210#true} assume ~main__urilen~0 > 0; {1210#true} is VALID [2022-04-07 11:26:03,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {1210#true} assume ~main__tokenlen~0 > 0; {1210#true} is VALID [2022-04-07 11:26:03,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {1210#true} assume ~main__scheme~0 >= 0; {1215#(<= 0 main_~main__scheme~0)} is VALID [2022-04-07 11:26:03,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {1215#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {1215#(<= 0 main_~main__scheme~0)} is VALID [2022-04-07 11:26:03,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {1215#(<= 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; {1216#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:03,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {1216#(<= 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; {1216#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:03,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {1216#(<= 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; {1216#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:03,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {1216#(<= 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; {1216#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:03,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {1216#(<= 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; {1217#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-07 11:26:03,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {1217#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {1211#false} is VALID [2022-04-07 11:26:03,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2022-04-07 11:26:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:26:03,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:03,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601281842] [2022-04-07 11:26:03,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601281842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:03,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:03,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 11:26:03,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237388738] [2022-04-07 11:26:03,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:03,247 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-07 11:26:03,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:03,247 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-07 11:26:03,264 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-07 11:26:03,264 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 11:26:03,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:03,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 11:26:03,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 11:26:03,265 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-07 11:26:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:03,499 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-07 11:26:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 11:26:03,499 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-07 11:26:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:03,499 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-07 11:26:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-07 11:26:03,500 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-07 11:26:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-07 11:26:03,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2022-04-07 11:26:03,568 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-07 11:26:03,569 INFO L225 Difference]: With dead ends: 76 [2022-04-07 11:26:03,569 INFO L226 Difference]: Without dead ends: 74 [2022-04-07 11:26:03,569 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-07 11:26:03,570 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 234 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-07 11:26:03,570 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.0s Time] [2022-04-07 11:26:03,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-07 11:26:03,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-07 11:26:03,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:03,584 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-07 11:26:03,584 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-07 11:26:03,584 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-07 11:26:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:03,586 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-07 11:26:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-07 11:26:03,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:03,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:03,587 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-07 11:26:03,587 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-07 11:26:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:03,589 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-07 11:26:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-07 11:26:03,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:03,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:03,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:03,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:03,590 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-07 11:26:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-04-07 11:26:03,591 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2022-04-07 11:26:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:03,592 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-04-07 11:26:03,592 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-07 11:26:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-07 11:26:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 11:26:03,592 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:03,592 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-07 11:26:03,593 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 11:26:03,593 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-07 11:26:03,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:03,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 1 times [2022-04-07 11:26:03,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:03,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088600231] [2022-04-07 11:26:03,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:03,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:03,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:03,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {1549#(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; {1541#true} is VALID [2022-04-07 11:26:03,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {1541#true} assume true; {1541#true} is VALID [2022-04-07 11:26:03,691 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1541#true} {1541#true} #225#return; {1541#true} is VALID [2022-04-07 11:26:03,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {1541#true} call ULTIMATE.init(); {1549#(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-07 11:26:03,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {1549#(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; {1541#true} is VALID [2022-04-07 11:26:03,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {1541#true} assume true; {1541#true} is VALID [2022-04-07 11:26:03,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1541#true} {1541#true} #225#return; {1541#true} is VALID [2022-04-07 11:26:03,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {1541#true} call #t~ret11 := main(); {1541#true} is VALID [2022-04-07 11:26:03,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {1541#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; {1541#true} is VALID [2022-04-07 11:26:03,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {1541#true} assume !!(~main__urilen~0 <= 1000000); {1541#true} is VALID [2022-04-07 11:26:03,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {1541#true} assume !!(~main__urilen~0 >= -1000000); {1541#true} is VALID [2022-04-07 11:26:03,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {1541#true} assume !!(~main__tokenlen~0 <= 1000000); {1541#true} is VALID [2022-04-07 11:26:03,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {1541#true} assume !!(~main__tokenlen~0 >= -1000000); {1541#true} is VALID [2022-04-07 11:26:03,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {1541#true} assume !!(~main__scheme~0 <= 1000000); {1541#true} is VALID [2022-04-07 11:26:03,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {1541#true} assume !!(~main__scheme~0 >= -1000000); {1541#true} is VALID [2022-04-07 11:26:03,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {1541#true} assume ~main__urilen~0 > 0; {1541#true} is VALID [2022-04-07 11:26:03,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {1541#true} assume ~main__tokenlen~0 > 0; {1541#true} is VALID [2022-04-07 11:26:03,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {1541#true} assume ~main__scheme~0 >= 0; {1541#true} is VALID [2022-04-07 11:26:03,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {1541#true} assume !(0 == ~main__scheme~0); {1541#true} is VALID [2022-04-07 11:26:03,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {1541#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; {1541#true} is VALID [2022-04-07 11:26:03,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {1541#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; {1541#true} is VALID [2022-04-07 11:26:03,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {1541#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; {1541#true} is VALID [2022-04-07 11:26:03,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {1541#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; {1546#(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-07 11:26:03,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {1546#(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; {1547#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:03,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {1547#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~3); {1547#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:03,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {1547#(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; {1547#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:03,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {1547#(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; {1548#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-07 11:26:03,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {1548#(not (= main_~__VERIFIER_assert__cond~16 0))} assume 0 == ~__VERIFIER_assert__cond~16; {1542#false} is VALID [2022-04-07 11:26:03,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {1542#false} assume !false; {1542#false} is VALID [2022-04-07 11:26:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:26:03,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:03,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088600231] [2022-04-07 11:26:03,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088600231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:03,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:03,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 11:26:03,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774701133] [2022-04-07 11:26:03,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:03,710 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-07 11:26:03,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:03,710 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-07 11:26:03,724 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-07 11:26:03,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 11:26:03,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:03,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 11:26:03,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 11:26:03,725 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-07 11:26:04,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:04,286 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-04-07 11:26:04,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 11:26:04,286 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-07 11:26:04,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:04,287 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-07 11:26:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2022-04-07 11:26:04,288 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-07 11:26:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2022-04-07 11:26:04,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 147 transitions. [2022-04-07 11:26:04,397 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-07 11:26:04,399 INFO L225 Difference]: With dead ends: 141 [2022-04-07 11:26:04,399 INFO L226 Difference]: Without dead ends: 139 [2022-04-07 11:26:04,400 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-07 11:26:04,400 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-07 11:26:04,401 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-07 11:26:04,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-07 11:26:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2022-04-07 11:26:04,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:04,415 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-07 11:26:04,415 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-07 11:26:04,415 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-07 11:26:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:04,418 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-07 11:26:04,419 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-07 11:26:04,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:04,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:04,419 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-07 11:26:04,419 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-07 11:26:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:04,422 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-07 11:26:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-07 11:26:04,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:04,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:04,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:04,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:04,422 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-07 11:26:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-07 11:26:04,424 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2022-04-07 11:26:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:04,424 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-07 11:26:04,424 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-07 11:26:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-07 11:26:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 11:26:04,424 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:04,425 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-07 11:26:04,425 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 11:26:04,425 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-07 11:26:04,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:04,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 1 times [2022-04-07 11:26:04,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:04,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068010179] [2022-04-07 11:26:04,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:04,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:04,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:04,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {2088#(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; {2080#true} is VALID [2022-04-07 11:26:04,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {2080#true} assume true; {2080#true} is VALID [2022-04-07 11:26:04,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2080#true} {2080#true} #225#return; {2080#true} is VALID [2022-04-07 11:26:04,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {2080#true} call ULTIMATE.init(); {2088#(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-07 11:26:04,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {2088#(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; {2080#true} is VALID [2022-04-07 11:26:04,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {2080#true} assume true; {2080#true} is VALID [2022-04-07 11:26:04,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2080#true} {2080#true} #225#return; {2080#true} is VALID [2022-04-07 11:26:04,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {2080#true} call #t~ret11 := main(); {2080#true} is VALID [2022-04-07 11:26:04,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {2080#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; {2080#true} is VALID [2022-04-07 11:26:04,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {2080#true} assume !!(~main__urilen~0 <= 1000000); {2080#true} is VALID [2022-04-07 11:26:04,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {2080#true} assume !!(~main__urilen~0 >= -1000000); {2080#true} is VALID [2022-04-07 11:26:04,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {2080#true} assume !!(~main__tokenlen~0 <= 1000000); {2080#true} is VALID [2022-04-07 11:26:04,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {2080#true} assume !!(~main__tokenlen~0 >= -1000000); {2080#true} is VALID [2022-04-07 11:26:04,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {2080#true} assume !!(~main__scheme~0 <= 1000000); {2080#true} is VALID [2022-04-07 11:26:04,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {2080#true} assume !!(~main__scheme~0 >= -1000000); {2080#true} is VALID [2022-04-07 11:26:04,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {2080#true} assume ~main__urilen~0 > 0; {2080#true} is VALID [2022-04-07 11:26:04,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {2080#true} assume ~main__tokenlen~0 > 0; {2080#true} is VALID [2022-04-07 11:26:04,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {2080#true} assume ~main__scheme~0 >= 0; {2080#true} is VALID [2022-04-07 11:26:04,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {2080#true} assume !(0 == ~main__scheme~0); {2080#true} is VALID [2022-04-07 11:26:04,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {2080#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; {2080#true} is VALID [2022-04-07 11:26:04,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {2080#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; {2080#true} is VALID [2022-04-07 11:26:04,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {2080#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; {2080#true} is VALID [2022-04-07 11:26:04,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {2080#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; {2085#(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-07 11:26:04,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {2085#(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; {2086#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:04,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {2086#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~3); {2086#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:04,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {2086#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(~main__cp~0 != ~main__urilen~0 - 1); {2086#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:04,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {2086#(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; {2087#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-07 11:26:04,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {2087#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {2081#false} is VALID [2022-04-07 11:26:04,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {2081#false} assume !false; {2081#false} is VALID [2022-04-07 11:26:04,486 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-07 11:26:04,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:04,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068010179] [2022-04-07 11:26:04,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068010179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:04,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:04,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 11:26:04,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821592712] [2022-04-07 11:26:04,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:04,487 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-07 11:26:04,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:04,487 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-07 11:26:04,500 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-07 11:26:04,500 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 11:26:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:04,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 11:26:04,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 11:26:04,501 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-07 11:26:04,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:04,877 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2022-04-07 11:26:04,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 11:26:04,878 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-07 11:26:04,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:04,878 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-07 11:26:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-04-07 11:26:04,879 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-07 11:26:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-04-07 11:26:04,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 114 transitions. [2022-04-07 11:26:04,959 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-07 11:26:04,961 INFO L225 Difference]: With dead ends: 108 [2022-04-07 11:26:04,961 INFO L226 Difference]: Without dead ends: 106 [2022-04-07 11:26:04,961 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-07 11:26:04,961 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 220 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:26:04,962 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.1s Time] [2022-04-07 11:26:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-07 11:26:04,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2022-04-07 11:26:04,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:04,979 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-07 11:26:04,980 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-07 11:26:04,980 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-07 11:26:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:04,982 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-07 11:26:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-07 11:26:04,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:04,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:04,982 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-07 11:26:04,982 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-07 11:26:04,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:04,984 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-07 11:26:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-07 11:26:04,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:04,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:04,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:04,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:04,985 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-07 11:26:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-04-07 11:26:04,986 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2022-04-07 11:26:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:04,986 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-04-07 11:26:04,986 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-07 11:26:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-07 11:26:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 11:26:04,987 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:04,987 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-07 11:26:04,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 11:26:04,987 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-07 11:26:04,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:04,987 INFO L85 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 1 times [2022-04-07 11:26:04,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:04,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365965012] [2022-04-07 11:26:04,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:04,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:05,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:05,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {2530#(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; {2522#true} is VALID [2022-04-07 11:26:05,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {2522#true} assume true; {2522#true} is VALID [2022-04-07 11:26:05,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2522#true} {2522#true} #225#return; {2522#true} is VALID [2022-04-07 11:26:05,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {2522#true} call ULTIMATE.init(); {2530#(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-07 11:26:05,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {2530#(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; {2522#true} is VALID [2022-04-07 11:26:05,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {2522#true} assume true; {2522#true} is VALID [2022-04-07 11:26:05,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2522#true} {2522#true} #225#return; {2522#true} is VALID [2022-04-07 11:26:05,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {2522#true} call #t~ret11 := main(); {2522#true} is VALID [2022-04-07 11:26:05,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {2522#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; {2522#true} is VALID [2022-04-07 11:26:05,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {2522#true} assume !!(~main__urilen~0 <= 1000000); {2522#true} is VALID [2022-04-07 11:26:05,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {2522#true} assume !!(~main__urilen~0 >= -1000000); {2522#true} is VALID [2022-04-07 11:26:05,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {2522#true} assume !!(~main__tokenlen~0 <= 1000000); {2522#true} is VALID [2022-04-07 11:26:05,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {2522#true} assume !!(~main__tokenlen~0 >= -1000000); {2522#true} is VALID [2022-04-07 11:26:05,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {2522#true} assume !!(~main__scheme~0 <= 1000000); {2522#true} is VALID [2022-04-07 11:26:05,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {2522#true} assume !!(~main__scheme~0 >= -1000000); {2522#true} is VALID [2022-04-07 11:26:05,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {2522#true} assume ~main__urilen~0 > 0; {2522#true} is VALID [2022-04-07 11:26:05,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {2522#true} assume ~main__tokenlen~0 > 0; {2522#true} is VALID [2022-04-07 11:26:05,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {2522#true} assume ~main__scheme~0 >= 0; {2522#true} is VALID [2022-04-07 11:26:05,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {2522#true} assume !(0 == ~main__scheme~0); {2522#true} is VALID [2022-04-07 11:26:05,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {2522#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; {2522#true} is VALID [2022-04-07 11:26:05,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {2522#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; {2522#true} is VALID [2022-04-07 11:26:05,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {2522#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; {2522#true} is VALID [2022-04-07 11:26:05,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {2522#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; {2522#true} is VALID [2022-04-07 11:26:05,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {2522#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; {2527#(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-07 11:26:05,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {2527#(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); {2528#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:05,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {2528#(<= 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; {2528#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:05,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {2528#(<= 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; {2528#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:05,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {2528#(<= 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; {2529#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-07 11:26:05,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {2529#(not (= main_~__VERIFIER_assert__cond~17 0))} assume 0 == ~__VERIFIER_assert__cond~17; {2523#false} is VALID [2022-04-07 11:26:05,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {2523#false} assume !false; {2523#false} is VALID [2022-04-07 11:26:05,042 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-07 11:26:05,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:05,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365965012] [2022-04-07 11:26:05,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365965012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:05,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:05,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 11:26:05,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088232558] [2022-04-07 11:26:05,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:05,043 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-07 11:26:05,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:05,043 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-07 11:26:05,057 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-07 11:26:05,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 11:26:05,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:05,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 11:26:05,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 11:26:05,057 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-07 11:26:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:05,395 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2022-04-07 11:26:05,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 11:26:05,395 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-07 11:26:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:05,395 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-07 11:26:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2022-04-07 11:26:05,396 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-07 11:26:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2022-04-07 11:26:05,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 125 transitions. [2022-04-07 11:26:05,488 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-07 11:26:05,490 INFO L225 Difference]: With dead ends: 121 [2022-04-07 11:26:05,490 INFO L226 Difference]: Without dead ends: 119 [2022-04-07 11:26:05,490 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-07 11:26:05,490 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-07 11:26:05,491 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-07 11:26:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-07 11:26:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2022-04-07 11:26:05,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:05,511 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-07 11:26:05,511 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-07 11:26:05,512 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-07 11:26:05,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:05,513 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-07 11:26:05,514 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-07 11:26:05,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:05,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:05,514 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-07 11:26:05,514 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-07 11:26:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:05,516 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-07 11:26:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-07 11:26:05,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:05,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:05,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:05,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:05,517 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-07 11:26:05,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-07 11:26:05,518 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2022-04-07 11:26:05,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:05,518 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-07 11:26:05,518 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-07 11:26:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-07 11:26:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 11:26:05,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:05,518 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-07 11:26:05,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 11:26:05,519 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-07 11:26:05,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:05,519 INFO L85 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 1 times [2022-04-07 11:26:05,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:05,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863011270] [2022-04-07 11:26:05,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:05,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:05,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:05,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {3006#(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; {2998#true} is VALID [2022-04-07 11:26:05,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {2998#true} assume true; {2998#true} is VALID [2022-04-07 11:26:05,583 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2998#true} {2998#true} #225#return; {2998#true} is VALID [2022-04-07 11:26:05,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {2998#true} call ULTIMATE.init(); {3006#(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-07 11:26:05,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {3006#(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; {2998#true} is VALID [2022-04-07 11:26:05,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {2998#true} assume true; {2998#true} is VALID [2022-04-07 11:26:05,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2998#true} {2998#true} #225#return; {2998#true} is VALID [2022-04-07 11:26:05,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {2998#true} call #t~ret11 := main(); {2998#true} is VALID [2022-04-07 11:26:05,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {2998#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; {2998#true} is VALID [2022-04-07 11:26:05,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {2998#true} assume !!(~main__urilen~0 <= 1000000); {2998#true} is VALID [2022-04-07 11:26:05,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {2998#true} assume !!(~main__urilen~0 >= -1000000); {2998#true} is VALID [2022-04-07 11:26:05,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {2998#true} assume !!(~main__tokenlen~0 <= 1000000); {2998#true} is VALID [2022-04-07 11:26:05,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {2998#true} assume !!(~main__tokenlen~0 >= -1000000); {2998#true} is VALID [2022-04-07 11:26:05,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {2998#true} assume !!(~main__scheme~0 <= 1000000); {2998#true} is VALID [2022-04-07 11:26:05,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {2998#true} assume !!(~main__scheme~0 >= -1000000); {2998#true} is VALID [2022-04-07 11:26:05,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {2998#true} assume ~main__urilen~0 > 0; {2998#true} is VALID [2022-04-07 11:26:05,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {2998#true} assume ~main__tokenlen~0 > 0; {2998#true} is VALID [2022-04-07 11:26:05,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {2998#true} assume ~main__scheme~0 >= 0; {2998#true} is VALID [2022-04-07 11:26:05,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {2998#true} assume !(0 == ~main__scheme~0); {2998#true} is VALID [2022-04-07 11:26:05,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {2998#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; {2998#true} is VALID [2022-04-07 11:26:05,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {2998#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; {2998#true} is VALID [2022-04-07 11:26:05,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {2998#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; {2998#true} is VALID [2022-04-07 11:26:05,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {2998#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; {2998#true} is VALID [2022-04-07 11:26:05,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {2998#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; {3003#(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-07 11:26:05,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {3003#(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); {3004#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:05,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {3004#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 != ~main__urilen~0 - 1); {3004#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:05,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {3004#(<= 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; {3004#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:05,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {3004#(<= 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; {3005#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-07 11:26:05,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {3005#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {2999#false} is VALID [2022-04-07 11:26:05,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {2999#false} assume !false; {2999#false} is VALID [2022-04-07 11:26:05,591 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-07 11:26:05,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:05,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863011270] [2022-04-07 11:26:05,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863011270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:05,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:05,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 11:26:05,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673473746] [2022-04-07 11:26:05,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:05,591 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-07 11:26:05,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:05,592 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-07 11:26:05,605 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-07 11:26:05,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 11:26:05,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:05,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 11:26:05,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 11:26:05,606 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-07 11:26:05,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:05,855 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-04-07 11:26:05,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 11:26:05,855 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-07 11:26:05,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:05,855 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-07 11:26:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-07 11:26:05,856 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-07 11:26:05,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-07 11:26:05,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-07 11:26:05,924 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-07 11:26:05,925 INFO L225 Difference]: With dead ends: 77 [2022-04-07 11:26:05,925 INFO L226 Difference]: Without dead ends: 75 [2022-04-07 11:26:05,925 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-07 11:26:05,926 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-07 11:26:05,926 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-07 11:26:05,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-07 11:26:05,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-07 11:26:05,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:05,943 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-07 11:26:05,943 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-07 11:26:05,943 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-07 11:26:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:05,944 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-07 11:26:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-07 11:26:05,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:05,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:05,945 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-07 11:26:05,945 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-07 11:26:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:05,946 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-07 11:26:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-07 11:26:05,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:05,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:05,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:05,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:05,947 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-07 11:26:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-04-07 11:26:05,948 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2022-04-07 11:26:05,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:05,948 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-04-07 11:26:05,949 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-07 11:26:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-07 11:26:05,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 11:26:05,949 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:05,949 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-07 11:26:05,949 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 11:26:05,950 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-07 11:26:05,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:05,950 INFO L85 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 1 times [2022-04-07 11:26:05,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:05,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394807771] [2022-04-07 11:26:05,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:05,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:05,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:05,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {3343#(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; {3337#true} is VALID [2022-04-07 11:26:05,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {3337#true} assume true; {3337#true} is VALID [2022-04-07 11:26:05,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3337#true} {3337#true} #225#return; {3337#true} is VALID [2022-04-07 11:26:05,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {3337#true} call ULTIMATE.init(); {3343#(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-07 11:26:05,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {3343#(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; {3337#true} is VALID [2022-04-07 11:26:05,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {3337#true} assume true; {3337#true} is VALID [2022-04-07 11:26:05,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3337#true} {3337#true} #225#return; {3337#true} is VALID [2022-04-07 11:26:05,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {3337#true} call #t~ret11 := main(); {3337#true} is VALID [2022-04-07 11:26:05,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {3337#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; {3337#true} is VALID [2022-04-07 11:26:05,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {3337#true} assume !!(~main__urilen~0 <= 1000000); {3337#true} is VALID [2022-04-07 11:26:05,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {3337#true} assume !!(~main__urilen~0 >= -1000000); {3337#true} is VALID [2022-04-07 11:26:05,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {3337#true} assume !!(~main__tokenlen~0 <= 1000000); {3337#true} is VALID [2022-04-07 11:26:05,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {3337#true} assume !!(~main__tokenlen~0 >= -1000000); {3337#true} is VALID [2022-04-07 11:26:05,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {3337#true} assume !!(~main__scheme~0 <= 1000000); {3337#true} is VALID [2022-04-07 11:26:05,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {3337#true} assume !!(~main__scheme~0 >= -1000000); {3337#true} is VALID [2022-04-07 11:26:05,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {3337#true} assume ~main__urilen~0 > 0; {3337#true} is VALID [2022-04-07 11:26:05,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {3337#true} assume ~main__tokenlen~0 > 0; {3337#true} is VALID [2022-04-07 11:26:05,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {3337#true} assume ~main__scheme~0 >= 0; {3337#true} is VALID [2022-04-07 11:26:05,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {3337#true} assume !(0 == ~main__scheme~0); {3337#true} is VALID [2022-04-07 11:26:05,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {3337#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; {3337#true} is VALID [2022-04-07 11:26:05,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {3337#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; {3337#true} is VALID [2022-04-07 11:26:05,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {3337#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; {3337#true} is VALID [2022-04-07 11:26:05,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {3337#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; {3337#true} is VALID [2022-04-07 11:26:05,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {3337#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; {3337#true} is VALID [2022-04-07 11:26:05,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {3337#true} assume !(0 == ~__VERIFIER_assert__cond~3); {3337#true} is VALID [2022-04-07 11:26:05,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {3337#true} assume !(~main__cp~0 != ~main__urilen~0 - 1); {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-07 11:26:05,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {3342#(= (+ (- 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; {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-07 11:26:05,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {3342#(= (+ (- 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; {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-07 11:26:05,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} assume !(0 == ~__VERIFIER_assert__cond~5); {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-07 11:26:05,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {3342#(= (+ (- 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; {3338#false} is VALID [2022-04-07 11:26:05,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {3338#false} assume 0 == ~__VERIFIER_assert__cond~6; {3338#false} is VALID [2022-04-07 11:26:05,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {3338#false} assume !false; {3338#false} is VALID [2022-04-07 11:26:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:26:05,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:05,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394807771] [2022-04-07 11:26:05,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394807771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:05,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:05,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 11:26:05,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042199852] [2022-04-07 11:26:05,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:05,996 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-07 11:26:05,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:05,996 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-07 11:26:06,009 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-07 11:26:06,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 11:26:06,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:06,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 11:26:06,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 11:26:06,010 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-07 11:26:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:06,151 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-04-07 11:26:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 11:26:06,152 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-07 11:26:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:06,152 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-07 11:26:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-07 11:26:06,153 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-07 11:26:06,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-07 11:26:06,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-07 11:26:06,233 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-07 11:26:06,234 INFO L225 Difference]: With dead ends: 115 [2022-04-07 11:26:06,235 INFO L226 Difference]: Without dead ends: 75 [2022-04-07 11:26:06,235 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-07 11:26:06,235 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-07 11:26:06,236 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.0s Time] [2022-04-07 11:26:06,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-07 11:26:06,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-07 11:26:06,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:06,253 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-07 11:26:06,253 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-07 11:26:06,253 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-07 11:26:06,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:06,255 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-07 11:26:06,255 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-07 11:26:06,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:06,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:06,255 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-07 11:26:06,255 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-07 11:26:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:06,256 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-07 11:26:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-07 11:26:06,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:06,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:06,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:06,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:06,256 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-07 11:26:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-04-07 11:26:06,257 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2022-04-07 11:26:06,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:06,257 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-04-07 11:26:06,257 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-07 11:26:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-07 11:26:06,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 11:26:06,258 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:06,258 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-07 11:26:06,258 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 11:26:06,258 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-07 11:26:06,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:06,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 1 times [2022-04-07 11:26:06,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:06,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038254888] [2022-04-07 11:26:06,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:06,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:06,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:06,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {3719#(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; {3711#true} is VALID [2022-04-07 11:26:06,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {3711#true} assume true; {3711#true} is VALID [2022-04-07 11:26:06,323 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3711#true} {3711#true} #225#return; {3711#true} is VALID [2022-04-07 11:26:06,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {3711#true} call ULTIMATE.init(); {3719#(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-07 11:26:06,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {3719#(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; {3711#true} is VALID [2022-04-07 11:26:06,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {3711#true} assume true; {3711#true} is VALID [2022-04-07 11:26:06,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3711#true} {3711#true} #225#return; {3711#true} is VALID [2022-04-07 11:26:06,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {3711#true} call #t~ret11 := main(); {3711#true} is VALID [2022-04-07 11:26:06,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {3711#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; {3711#true} is VALID [2022-04-07 11:26:06,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {3711#true} assume !!(~main__urilen~0 <= 1000000); {3711#true} is VALID [2022-04-07 11:26:06,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {3711#true} assume !!(~main__urilen~0 >= -1000000); {3711#true} is VALID [2022-04-07 11:26:06,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {3711#true} assume !!(~main__tokenlen~0 <= 1000000); {3711#true} is VALID [2022-04-07 11:26:06,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {3711#true} assume !!(~main__tokenlen~0 >= -1000000); {3711#true} is VALID [2022-04-07 11:26:06,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {3711#true} assume !!(~main__scheme~0 <= 1000000); {3711#true} is VALID [2022-04-07 11:26:06,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {3711#true} assume !!(~main__scheme~0 >= -1000000); {3711#true} is VALID [2022-04-07 11:26:06,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {3711#true} assume ~main__urilen~0 > 0; {3711#true} is VALID [2022-04-07 11:26:06,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {3711#true} assume ~main__tokenlen~0 > 0; {3711#true} is VALID [2022-04-07 11:26:06,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {3711#true} assume ~main__scheme~0 >= 0; {3711#true} is VALID [2022-04-07 11:26:06,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {3711#true} assume !(0 == ~main__scheme~0); {3711#true} is VALID [2022-04-07 11:26:06,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {3711#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; {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {3716#(< 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; {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {3716#(< 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; {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {3716#(< 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; {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {3716#(< 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; {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {3716#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {3716#(< 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; {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-07 11:26:06,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {3717#(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); {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-07 11:26:06,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {3717#(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; {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-07 11:26:06,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {3717#(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; {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-07 11:26:06,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {3717#(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); {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-07 11:26:06,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {3717#(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; {3718#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-07 11:26:06,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {3718#(not (= main_~__VERIFIER_assert__cond~6 0))} assume 0 == ~__VERIFIER_assert__cond~6; {3712#false} is VALID [2022-04-07 11:26:06,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {3712#false} assume !false; {3712#false} is VALID [2022-04-07 11:26:06,329 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-07 11:26:06,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:06,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038254888] [2022-04-07 11:26:06,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038254888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:06,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:06,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 11:26:06,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799485672] [2022-04-07 11:26:06,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:06,330 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-07 11:26:06,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:06,330 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-07 11:26:06,344 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-07 11:26:06,344 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 11:26:06,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:06,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 11:26:06,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-07 11:26:06,345 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-07 11:26:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:06,587 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-07 11:26:06,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 11:26:06,587 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-07 11:26:06,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:06,587 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-07 11:26:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-07 11:26:06,588 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-07 11:26:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-07 11:26:06,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-07 11:26:06,640 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-07 11:26:06,641 INFO L225 Difference]: With dead ends: 76 [2022-04-07 11:26:06,641 INFO L226 Difference]: Without dead ends: 74 [2022-04-07 11:26:06,641 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-07 11:26:06,641 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 142 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:26:06,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 67 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 11:26:06,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-07 11:26:06,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-04-07 11:26:06,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:06,673 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-07 11:26:06,674 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-07 11:26:06,674 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-07 11:26:06,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:06,675 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-07 11:26:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-07 11:26:06,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:06,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:06,675 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-07 11:26:06,675 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-07 11:26:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:06,676 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-07 11:26:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-07 11:26:06,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:06,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:06,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:06,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:06,677 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-07 11:26:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-04-07 11:26:06,677 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2022-04-07 11:26:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:06,678 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-04-07 11:26:06,678 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-07 11:26:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-07 11:26:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 11:26:06,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:06,678 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-07 11:26:06,678 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 11:26:06,678 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-07 11:26:06,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:06,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 1 times [2022-04-07 11:26:06,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:06,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827501226] [2022-04-07 11:26:06,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:06,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:06,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:06,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {4056#(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; {4048#true} is VALID [2022-04-07 11:26:06,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {4048#true} assume true; {4048#true} is VALID [2022-04-07 11:26:06,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4048#true} {4048#true} #225#return; {4048#true} is VALID [2022-04-07 11:26:06,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {4048#true} call ULTIMATE.init(); {4056#(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-07 11:26:06,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {4056#(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; {4048#true} is VALID [2022-04-07 11:26:06,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {4048#true} assume true; {4048#true} is VALID [2022-04-07 11:26:06,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4048#true} {4048#true} #225#return; {4048#true} is VALID [2022-04-07 11:26:06,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {4048#true} call #t~ret11 := main(); {4048#true} is VALID [2022-04-07 11:26:06,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {4048#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; {4048#true} is VALID [2022-04-07 11:26:06,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {4048#true} assume !!(~main__urilen~0 <= 1000000); {4048#true} is VALID [2022-04-07 11:26:06,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {4048#true} assume !!(~main__urilen~0 >= -1000000); {4048#true} is VALID [2022-04-07 11:26:06,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {4048#true} assume !!(~main__tokenlen~0 <= 1000000); {4048#true} is VALID [2022-04-07 11:26:06,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {4048#true} assume !!(~main__tokenlen~0 >= -1000000); {4048#true} is VALID [2022-04-07 11:26:06,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {4048#true} assume !!(~main__scheme~0 <= 1000000); {4048#true} is VALID [2022-04-07 11:26:06,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {4048#true} assume !!(~main__scheme~0 >= -1000000); {4048#true} is VALID [2022-04-07 11:26:06,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {4048#true} assume ~main__urilen~0 > 0; {4048#true} is VALID [2022-04-07 11:26:06,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {4048#true} assume ~main__tokenlen~0 > 0; {4048#true} is VALID [2022-04-07 11:26:06,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {4048#true} assume ~main__scheme~0 >= 0; {4048#true} is VALID [2022-04-07 11:26:06,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {4048#true} assume !(0 == ~main__scheme~0); {4048#true} is VALID [2022-04-07 11:26:06,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {4048#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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {4053#(< 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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {4053#(< 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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {4053#(< 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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {4053#(< 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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {4053#(< 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; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {4054#(< (+ 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; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {4054#(< (+ 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; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {4053#(< 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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {4053#(< 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; {4055#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-07 11:26:06,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {4055#(not (= main_~__VERIFIER_assert__cond~16 0))} assume 0 == ~__VERIFIER_assert__cond~16; {4049#false} is VALID [2022-04-07 11:26:06,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {4049#false} assume !false; {4049#false} is VALID [2022-04-07 11:26:06,742 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-07 11:26:06,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:06,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827501226] [2022-04-07 11:26:06,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827501226] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:26:06,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52723449] [2022-04-07 11:26:06,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:06,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:26:06,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:26:06,744 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-07 11:26:06,775 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-07 11:26:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:06,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 11:26:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:06,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:26:06,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {4048#true} call ULTIMATE.init(); {4048#true} is VALID [2022-04-07 11:26:06,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {4048#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; {4048#true} is VALID [2022-04-07 11:26:06,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {4048#true} assume true; {4048#true} is VALID [2022-04-07 11:26:06,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4048#true} {4048#true} #225#return; {4048#true} is VALID [2022-04-07 11:26:06,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {4048#true} call #t~ret11 := main(); {4048#true} is VALID [2022-04-07 11:26:06,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {4048#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; {4048#true} is VALID [2022-04-07 11:26:06,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {4048#true} assume !!(~main__urilen~0 <= 1000000); {4048#true} is VALID [2022-04-07 11:26:06,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {4048#true} assume !!(~main__urilen~0 >= -1000000); {4048#true} is VALID [2022-04-07 11:26:06,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {4048#true} assume !!(~main__tokenlen~0 <= 1000000); {4048#true} is VALID [2022-04-07 11:26:06,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {4048#true} assume !!(~main__tokenlen~0 >= -1000000); {4048#true} is VALID [2022-04-07 11:26:06,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {4048#true} assume !!(~main__scheme~0 <= 1000000); {4048#true} is VALID [2022-04-07 11:26:06,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {4048#true} assume !!(~main__scheme~0 >= -1000000); {4048#true} is VALID [2022-04-07 11:26:06,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {4048#true} assume ~main__urilen~0 > 0; {4048#true} is VALID [2022-04-07 11:26:06,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {4048#true} assume ~main__tokenlen~0 > 0; {4048#true} is VALID [2022-04-07 11:26:06,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {4048#true} assume ~main__scheme~0 >= 0; {4048#true} is VALID [2022-04-07 11:26:06,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {4048#true} assume !(0 == ~main__scheme~0); {4048#true} is VALID [2022-04-07 11:26:06,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {4048#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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {4053#(< 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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {4053#(< 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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {4053#(< 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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {4053#(< 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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {4053#(< 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; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {4054#(< (+ 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; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {4054#(< (+ 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; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {4053#(< 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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:06,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {4053#(< 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; {4141#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID [2022-04-07 11:26:06,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {4141#(<= 1 main_~__VERIFIER_assert__cond~16)} assume 0 == ~__VERIFIER_assert__cond~16; {4049#false} is VALID [2022-04-07 11:26:06,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {4049#false} assume !false; {4049#false} is VALID [2022-04-07 11:26:06,974 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-07 11:26:06,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:26:07,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {4049#false} assume !false; {4049#false} is VALID [2022-04-07 11:26:07,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {4141#(<= 1 main_~__VERIFIER_assert__cond~16)} assume 0 == ~__VERIFIER_assert__cond~16; {4049#false} is VALID [2022-04-07 11:26:07,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {4053#(< 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; {4141#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID [2022-04-07 11:26:07,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {4053#(< 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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:07,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:07,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {4054#(< (+ 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; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:07,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {4054#(< (+ 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; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:07,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {4053#(< 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; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:07,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:07,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {4053#(< 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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:07,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {4053#(< 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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:07,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {4053#(< 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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:07,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {4053#(< 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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:07,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {4048#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; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:07,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {4048#true} assume !(0 == ~main__scheme~0); {4048#true} is VALID [2022-04-07 11:26:07,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {4048#true} assume ~main__scheme~0 >= 0; {4048#true} is VALID [2022-04-07 11:26:07,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {4048#true} assume ~main__tokenlen~0 > 0; {4048#true} is VALID [2022-04-07 11:26:07,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {4048#true} assume ~main__urilen~0 > 0; {4048#true} is VALID [2022-04-07 11:26:07,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {4048#true} assume !!(~main__scheme~0 >= -1000000); {4048#true} is VALID [2022-04-07 11:26:07,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {4048#true} assume !!(~main__scheme~0 <= 1000000); {4048#true} is VALID [2022-04-07 11:26:07,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {4048#true} assume !!(~main__tokenlen~0 >= -1000000); {4048#true} is VALID [2022-04-07 11:26:07,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {4048#true} assume !!(~main__tokenlen~0 <= 1000000); {4048#true} is VALID [2022-04-07 11:26:07,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {4048#true} assume !!(~main__urilen~0 >= -1000000); {4048#true} is VALID [2022-04-07 11:26:07,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {4048#true} assume !!(~main__urilen~0 <= 1000000); {4048#true} is VALID [2022-04-07 11:26:07,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {4048#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; {4048#true} is VALID [2022-04-07 11:26:07,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {4048#true} call #t~ret11 := main(); {4048#true} is VALID [2022-04-07 11:26:07,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4048#true} {4048#true} #225#return; {4048#true} is VALID [2022-04-07 11:26:07,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {4048#true} assume true; {4048#true} is VALID [2022-04-07 11:26:07,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {4048#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; {4048#true} is VALID [2022-04-07 11:26:07,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {4048#true} call ULTIMATE.init(); {4048#true} is VALID [2022-04-07 11:26:07,111 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-07 11:26:07,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52723449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:26:07,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:26:07,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-07 11:26:07,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811122226] [2022-04-07 11:26:07,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:26:07,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-07 11:26:07,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:07,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:26:07,129 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-07 11:26:07,129 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 11:26:07,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:07,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 11:26:07,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 11:26:07,130 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:26:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:07,457 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-07 11:26:07,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 11:26:07,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-07 11:26:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:26:07,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-04-07 11:26:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:26:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-04-07 11:26:07,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2022-04-07 11:26:07,547 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-07 11:26:07,548 INFO L225 Difference]: With dead ends: 111 [2022-04-07 11:26:07,549 INFO L226 Difference]: Without dead ends: 109 [2022-04-07 11:26:07,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-07 11:26:07,550 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 230 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:26:07,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 87 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 11:26:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-07 11:26:07,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2022-04-07 11:26:07,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:07,577 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-07 11:26:07,578 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-07 11:26:07,578 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-07 11:26:07,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:07,581 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-07 11:26:07,581 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-07 11:26:07,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:07,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:07,582 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-07 11:26:07,582 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-07 11:26:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:07,584 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-07 11:26:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-07 11:26:07,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:07,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:07,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:07,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:07,584 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-07 11:26:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-07 11:26:07,585 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2022-04-07 11:26:07,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:07,585 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-07 11:26:07,585 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:26:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-07 11:26:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 11:26:07,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:07,586 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-07 11:26:07,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 11:26:07,799 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-07 11:26:07,799 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-07 11:26:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 1 times [2022-04-07 11:26:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:07,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965005314] [2022-04-07 11:26:07,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:07,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:07,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:07,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {4676#(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; {4668#true} is VALID [2022-04-07 11:26:07,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {4668#true} assume true; {4668#true} is VALID [2022-04-07 11:26:07,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4668#true} {4668#true} #225#return; {4668#true} is VALID [2022-04-07 11:26:07,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {4668#true} call ULTIMATE.init(); {4676#(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-07 11:26:07,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {4676#(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; {4668#true} is VALID [2022-04-07 11:26:07,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {4668#true} assume true; {4668#true} is VALID [2022-04-07 11:26:07,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4668#true} {4668#true} #225#return; {4668#true} is VALID [2022-04-07 11:26:07,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {4668#true} call #t~ret11 := main(); {4668#true} is VALID [2022-04-07 11:26:07,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {4668#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; {4668#true} is VALID [2022-04-07 11:26:07,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {4668#true} assume !!(~main__urilen~0 <= 1000000); {4668#true} is VALID [2022-04-07 11:26:07,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {4668#true} assume !!(~main__urilen~0 >= -1000000); {4668#true} is VALID [2022-04-07 11:26:07,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {4668#true} assume !!(~main__tokenlen~0 <= 1000000); {4668#true} is VALID [2022-04-07 11:26:07,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {4668#true} assume !!(~main__tokenlen~0 >= -1000000); {4668#true} is VALID [2022-04-07 11:26:07,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {4668#true} assume !!(~main__scheme~0 <= 1000000); {4668#true} is VALID [2022-04-07 11:26:07,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {4668#true} assume !!(~main__scheme~0 >= -1000000); {4668#true} is VALID [2022-04-07 11:26:07,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {4668#true} assume ~main__urilen~0 > 0; {4668#true} is VALID [2022-04-07 11:26:07,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {4668#true} assume ~main__tokenlen~0 > 0; {4668#true} is VALID [2022-04-07 11:26:07,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {4668#true} assume ~main__scheme~0 >= 0; {4673#(<= 0 main_~main__scheme~0)} is VALID [2022-04-07 11:26:07,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {4673#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {4673#(<= 0 main_~main__scheme~0)} is VALID [2022-04-07 11:26:07,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {4673#(<= 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; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:07,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {4674#(<= 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; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:07,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {4674#(<= 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; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:07,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {4674#(<= 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; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:07,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {4674#(<= 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; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:07,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {4674#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:07,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {4674#(<= 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; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:07,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {4674#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:07,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {4674#(<= 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; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:07,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {4674#(<= 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; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:07,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {4674#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:07,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {4674#(<= 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; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:07,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {4674#(<= 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; {4675#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-07 11:26:07,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {4675#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {4669#false} is VALID [2022-04-07 11:26:07,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {4669#false} assume !false; {4669#false} is VALID [2022-04-07 11:26:07,856 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-07 11:26:07,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:07,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965005314] [2022-04-07 11:26:07,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965005314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:07,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:07,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 11:26:07,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886068717] [2022-04-07 11:26:07,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:07,857 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-07 11:26:07,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:07,857 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-07 11:26:07,873 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-07 11:26:07,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 11:26:07,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:07,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 11:26:07,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 11:26:07,873 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-07 11:26:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:08,072 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-07 11:26:08,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 11:26:08,075 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-07 11:26:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:08,075 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-07 11:26:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-07 11:26:08,076 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-07 11:26:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-07 11:26:08,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-04-07 11:26:08,124 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-07 11:26:08,125 INFO L225 Difference]: With dead ends: 70 [2022-04-07 11:26:08,125 INFO L226 Difference]: Without dead ends: 68 [2022-04-07 11:26:08,126 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-07 11:26:08,126 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 170 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-07 11:26:08,126 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.0s Time] [2022-04-07 11:26:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-07 11:26:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-07 11:26:08,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:08,147 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-07 11:26:08,147 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-07 11:26:08,147 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-07 11:26:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:08,148 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-07 11:26:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-07 11:26:08,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:08,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:08,148 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-07 11:26:08,148 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-07 11:26:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:08,149 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-07 11:26:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-07 11:26:08,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:08,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:08,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:08,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:08,150 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-07 11:26:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-04-07 11:26:08,150 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2022-04-07 11:26:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:08,150 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-04-07 11:26:08,151 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-07 11:26:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-07 11:26:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 11:26:08,151 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:08,151 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-07 11:26:08,151 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 11:26:08,151 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-07 11:26:08,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:08,152 INFO L85 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 1 times [2022-04-07 11:26:08,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:08,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314164092] [2022-04-07 11:26:08,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:08,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:08,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:08,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {4987#(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; {4979#true} is VALID [2022-04-07 11:26:08,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {4979#true} assume true; {4979#true} is VALID [2022-04-07 11:26:08,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4979#true} {4979#true} #225#return; {4979#true} is VALID [2022-04-07 11:26:08,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {4979#true} call ULTIMATE.init(); {4987#(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-07 11:26:08,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {4987#(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; {4979#true} is VALID [2022-04-07 11:26:08,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {4979#true} assume true; {4979#true} is VALID [2022-04-07 11:26:08,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4979#true} {4979#true} #225#return; {4979#true} is VALID [2022-04-07 11:26:08,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {4979#true} call #t~ret11 := main(); {4979#true} is VALID [2022-04-07 11:26:08,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {4979#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; {4979#true} is VALID [2022-04-07 11:26:08,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {4979#true} assume !!(~main__urilen~0 <= 1000000); {4979#true} is VALID [2022-04-07 11:26:08,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {4979#true} assume !!(~main__urilen~0 >= -1000000); {4979#true} is VALID [2022-04-07 11:26:08,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {4979#true} assume !!(~main__tokenlen~0 <= 1000000); {4979#true} is VALID [2022-04-07 11:26:08,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {4979#true} assume !!(~main__tokenlen~0 >= -1000000); {4979#true} is VALID [2022-04-07 11:26:08,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {4979#true} assume !!(~main__scheme~0 <= 1000000); {4979#true} is VALID [2022-04-07 11:26:08,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {4979#true} assume !!(~main__scheme~0 >= -1000000); {4979#true} is VALID [2022-04-07 11:26:08,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {4979#true} assume ~main__urilen~0 > 0; {4979#true} is VALID [2022-04-07 11:26:08,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {4979#true} assume ~main__tokenlen~0 > 0; {4979#true} is VALID [2022-04-07 11:26:08,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {4979#true} assume ~main__scheme~0 >= 0; {4979#true} is VALID [2022-04-07 11:26:08,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {4979#true} assume !(0 == ~main__scheme~0); {4979#true} is VALID [2022-04-07 11:26:08,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {4979#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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {4984#(< 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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {4984#(< 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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {4984#(< 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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {4984#(< 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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {4984#(< 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; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {4985#(< (+ 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; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {4985#(< (+ 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; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {4984#(< 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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {4984#(< 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; {4986#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-07 11:26:08,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {4986#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {4980#false} is VALID [2022-04-07 11:26:08,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {4980#false} assume !false; {4980#false} is VALID [2022-04-07 11:26:08,206 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-07 11:26:08,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:08,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314164092] [2022-04-07 11:26:08,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314164092] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:26:08,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676093906] [2022-04-07 11:26:08,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:08,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:26:08,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:26:08,207 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-07 11:26:08,208 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-07 11:26:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:08,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 11:26:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:08,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:26:08,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {4979#true} call ULTIMATE.init(); {4979#true} is VALID [2022-04-07 11:26:08,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {4979#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; {4979#true} is VALID [2022-04-07 11:26:08,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {4979#true} assume true; {4979#true} is VALID [2022-04-07 11:26:08,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4979#true} {4979#true} #225#return; {4979#true} is VALID [2022-04-07 11:26:08,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {4979#true} call #t~ret11 := main(); {4979#true} is VALID [2022-04-07 11:26:08,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {4979#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; {4979#true} is VALID [2022-04-07 11:26:08,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {4979#true} assume !!(~main__urilen~0 <= 1000000); {4979#true} is VALID [2022-04-07 11:26:08,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {4979#true} assume !!(~main__urilen~0 >= -1000000); {4979#true} is VALID [2022-04-07 11:26:08,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {4979#true} assume !!(~main__tokenlen~0 <= 1000000); {4979#true} is VALID [2022-04-07 11:26:08,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {4979#true} assume !!(~main__tokenlen~0 >= -1000000); {4979#true} is VALID [2022-04-07 11:26:08,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {4979#true} assume !!(~main__scheme~0 <= 1000000); {4979#true} is VALID [2022-04-07 11:26:08,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {4979#true} assume !!(~main__scheme~0 >= -1000000); {4979#true} is VALID [2022-04-07 11:26:08,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {4979#true} assume ~main__urilen~0 > 0; {4979#true} is VALID [2022-04-07 11:26:08,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {4979#true} assume ~main__tokenlen~0 > 0; {4979#true} is VALID [2022-04-07 11:26:08,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {4979#true} assume ~main__scheme~0 >= 0; {4979#true} is VALID [2022-04-07 11:26:08,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {4979#true} assume !(0 == ~main__scheme~0); {4979#true} is VALID [2022-04-07 11:26:08,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {4979#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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {4984#(< 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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {4984#(< 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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {4984#(< 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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {4984#(< 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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {4984#(< 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; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {4985#(< (+ 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; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {4985#(< (+ 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; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {4984#(< 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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {4984#(< 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; {5075#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID [2022-04-07 11:26:08,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {5075#(<= 1 main_~__VERIFIER_assert__cond~4)} assume 0 == ~__VERIFIER_assert__cond~4; {4980#false} is VALID [2022-04-07 11:26:08,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {4980#false} assume !false; {4980#false} is VALID [2022-04-07 11:26:08,361 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-07 11:26:08,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:26:08,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {4980#false} assume !false; {4980#false} is VALID [2022-04-07 11:26:08,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {5075#(<= 1 main_~__VERIFIER_assert__cond~4)} assume 0 == ~__VERIFIER_assert__cond~4; {4980#false} is VALID [2022-04-07 11:26:08,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {4984#(< 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; {5075#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID [2022-04-07 11:26:08,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {4984#(< 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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {4985#(< (+ 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; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {4985#(< (+ 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; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {4984#(< 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; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {4984#(< 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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {4984#(< 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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {4984#(< 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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {4984#(< 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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {4979#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; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:08,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {4979#true} assume !(0 == ~main__scheme~0); {4979#true} is VALID [2022-04-07 11:26:08,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {4979#true} assume ~main__scheme~0 >= 0; {4979#true} is VALID [2022-04-07 11:26:08,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {4979#true} assume ~main__tokenlen~0 > 0; {4979#true} is VALID [2022-04-07 11:26:08,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {4979#true} assume ~main__urilen~0 > 0; {4979#true} is VALID [2022-04-07 11:26:08,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {4979#true} assume !!(~main__scheme~0 >= -1000000); {4979#true} is VALID [2022-04-07 11:26:08,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {4979#true} assume !!(~main__scheme~0 <= 1000000); {4979#true} is VALID [2022-04-07 11:26:08,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {4979#true} assume !!(~main__tokenlen~0 >= -1000000); {4979#true} is VALID [2022-04-07 11:26:08,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {4979#true} assume !!(~main__tokenlen~0 <= 1000000); {4979#true} is VALID [2022-04-07 11:26:08,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {4979#true} assume !!(~main__urilen~0 >= -1000000); {4979#true} is VALID [2022-04-07 11:26:08,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {4979#true} assume !!(~main__urilen~0 <= 1000000); {4979#true} is VALID [2022-04-07 11:26:08,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {4979#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; {4979#true} is VALID [2022-04-07 11:26:08,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {4979#true} call #t~ret11 := main(); {4979#true} is VALID [2022-04-07 11:26:08,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4979#true} {4979#true} #225#return; {4979#true} is VALID [2022-04-07 11:26:08,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {4979#true} assume true; {4979#true} is VALID [2022-04-07 11:26:08,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {4979#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; {4979#true} is VALID [2022-04-07 11:26:08,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {4979#true} call ULTIMATE.init(); {4979#true} is VALID [2022-04-07 11:26:08,493 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-07 11:26:08,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676093906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:26:08,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:26:08,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-07 11:26:08,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583618482] [2022-04-07 11:26:08,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:26:08,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-07 11:26:08,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:08,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:26:08,511 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-07 11:26:08,511 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 11:26:08,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:08,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 11:26:08,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 11:26:08,515 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:26:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:08,753 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-07 11:26:08,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 11:26:08,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-07 11:26:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:26:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-07 11:26:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:26:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-07 11:26:08,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-07 11:26:08,795 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-07 11:26:08,795 INFO L225 Difference]: With dead ends: 69 [2022-04-07 11:26:08,795 INFO L226 Difference]: Without dead ends: 67 [2022-04-07 11:26:08,796 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-07 11:26:08,796 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 130 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:26:08,796 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 66 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 11:26:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-07 11:26:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-04-07 11:26:08,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:08,809 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-07 11:26:08,809 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-07 11:26:08,809 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-07 11:26:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:08,810 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-07 11:26:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-07 11:26:08,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:08,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:08,811 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-07 11:26:08,811 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-07 11:26:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:08,811 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-07 11:26:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-07 11:26:08,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:08,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:08,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:08,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:08,812 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-07 11:26:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-04-07 11:26:08,813 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2022-04-07 11:26:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:08,813 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-04-07 11:26:08,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:26:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-04-07 11:26:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 11:26:08,813 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:08,813 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-07 11:26:08,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 11:26:09,019 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-07 11:26:09,020 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-07 11:26:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:09,020 INFO L85 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 1 times [2022-04-07 11:26:09,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:09,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422087870] [2022-04-07 11:26:09,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:09,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:09,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:09,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {5474#(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; {5466#true} is VALID [2022-04-07 11:26:09,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-07 11:26:09,086 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5466#true} {5466#true} #225#return; {5466#true} is VALID [2022-04-07 11:26:09,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {5466#true} call ULTIMATE.init(); {5474#(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-07 11:26:09,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {5474#(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; {5466#true} is VALID [2022-04-07 11:26:09,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-07 11:26:09,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5466#true} {5466#true} #225#return; {5466#true} is VALID [2022-04-07 11:26:09,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {5466#true} call #t~ret11 := main(); {5466#true} is VALID [2022-04-07 11:26:09,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {5466#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; {5466#true} is VALID [2022-04-07 11:26:09,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {5466#true} assume !!(~main__urilen~0 <= 1000000); {5466#true} is VALID [2022-04-07 11:26:09,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {5466#true} assume !!(~main__urilen~0 >= -1000000); {5466#true} is VALID [2022-04-07 11:26:09,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {5466#true} assume !!(~main__tokenlen~0 <= 1000000); {5466#true} is VALID [2022-04-07 11:26:09,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {5466#true} assume !!(~main__tokenlen~0 >= -1000000); {5466#true} is VALID [2022-04-07 11:26:09,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {5466#true} assume !!(~main__scheme~0 <= 1000000); {5466#true} is VALID [2022-04-07 11:26:09,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {5466#true} assume !!(~main__scheme~0 >= -1000000); {5466#true} is VALID [2022-04-07 11:26:09,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {5466#true} assume ~main__urilen~0 > 0; {5466#true} is VALID [2022-04-07 11:26:09,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {5466#true} assume ~main__tokenlen~0 > 0; {5466#true} is VALID [2022-04-07 11:26:09,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {5466#true} assume ~main__scheme~0 >= 0; {5466#true} is VALID [2022-04-07 11:26:09,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {5466#true} assume !(0 == ~main__scheme~0); {5466#true} is VALID [2022-04-07 11:26:09,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {5466#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; {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:09,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {5471#(< 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; {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:09,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {5471#(< 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; {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:09,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {5471#(< 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; {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:09,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {5471#(< 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; {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:09,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {5471#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:09,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {5471#(< 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; {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:09,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:09,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {5472#(< (+ 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; {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:09,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {5472#(< (+ 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; {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:09,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:09,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {5472#(< (+ 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; {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:09,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {5472#(< (+ 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; {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:09,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:09,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {5472#(< (+ 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; {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:09,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {5471#(< 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; {5473#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-07 11:26:09,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {5473#(not (= main_~__VERIFIER_assert__cond~8 0))} assume 0 == ~__VERIFIER_assert__cond~8; {5467#false} is VALID [2022-04-07 11:26:09,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {5467#false} assume !false; {5467#false} is VALID [2022-04-07 11:26:09,093 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-07 11:26:09,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:09,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422087870] [2022-04-07 11:26:09,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422087870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:09,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:09,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 11:26:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366130669] [2022-04-07 11:26:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:09,094 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-07 11:26:09,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:09,094 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-07 11:26:09,118 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-07 11:26:09,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 11:26:09,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:09,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 11:26:09,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-07 11:26:09,119 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-07 11:26:09,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:09,307 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-07 11:26:09,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 11:26:09,307 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-07 11:26:09,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:09,307 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-07 11:26:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-07 11:26:09,308 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-07 11:26:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-07 11:26:09,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-07 11:26:09,354 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-07 11:26:09,355 INFO L225 Difference]: With dead ends: 63 [2022-04-07 11:26:09,355 INFO L226 Difference]: Without dead ends: 61 [2022-04-07 11:26:09,355 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-07 11:26:09,356 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 149 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-07 11:26:09,356 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.0s Time] [2022-04-07 11:26:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-07 11:26:09,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-04-07 11:26:09,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:09,371 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-07 11:26:09,372 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-07 11:26:09,372 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-07 11:26:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:09,372 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-07 11:26:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-07 11:26:09,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:09,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:09,373 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-07 11:26:09,373 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-07 11:26:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:09,374 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-07 11:26:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-07 11:26:09,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:09,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:09,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:09,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:09,374 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-07 11:26:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-07 11:26:09,375 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2022-04-07 11:26:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:09,375 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-07 11:26:09,375 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-07 11:26:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-07 11:26:09,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 11:26:09,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:09,375 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-07 11:26:09,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 11:26:09,376 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-07 11:26:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:09,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 1 times [2022-04-07 11:26:09,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:09,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036172916] [2022-04-07 11:26:09,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:09,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:09,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:09,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {5756#(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; {5747#true} is VALID [2022-04-07 11:26:09,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {5747#true} assume true; {5747#true} is VALID [2022-04-07 11:26:09,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5747#true} {5747#true} #225#return; {5747#true} is VALID [2022-04-07 11:26:09,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {5747#true} call ULTIMATE.init(); {5756#(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-07 11:26:09,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {5756#(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; {5747#true} is VALID [2022-04-07 11:26:09,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {5747#true} assume true; {5747#true} is VALID [2022-04-07 11:26:09,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5747#true} {5747#true} #225#return; {5747#true} is VALID [2022-04-07 11:26:09,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {5747#true} call #t~ret11 := main(); {5747#true} is VALID [2022-04-07 11:26:09,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {5747#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; {5747#true} is VALID [2022-04-07 11:26:09,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {5747#true} assume !!(~main__urilen~0 <= 1000000); {5747#true} is VALID [2022-04-07 11:26:09,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {5747#true} assume !!(~main__urilen~0 >= -1000000); {5747#true} is VALID [2022-04-07 11:26:09,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {5747#true} assume !!(~main__tokenlen~0 <= 1000000); {5747#true} is VALID [2022-04-07 11:26:09,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {5747#true} assume !!(~main__tokenlen~0 >= -1000000); {5747#true} is VALID [2022-04-07 11:26:09,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {5747#true} assume !!(~main__scheme~0 <= 1000000); {5747#true} is VALID [2022-04-07 11:26:09,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {5747#true} assume !!(~main__scheme~0 >= -1000000); {5747#true} is VALID [2022-04-07 11:26:09,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {5747#true} assume ~main__urilen~0 > 0; {5747#true} is VALID [2022-04-07 11:26:09,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {5747#true} assume ~main__tokenlen~0 > 0; {5747#true} is VALID [2022-04-07 11:26:09,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {5747#true} assume ~main__scheme~0 >= 0; {5752#(<= 0 main_~main__scheme~0)} is VALID [2022-04-07 11:26:09,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {5752#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {5752#(<= 0 main_~main__scheme~0)} is VALID [2022-04-07 11:26:09,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {5752#(<= 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; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {5753#(<= 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; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {5753#(<= 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; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {5753#(<= 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; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {5753#(<= 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; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {5753#(<= 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; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {5753#(<= 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; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {5753#(<= 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; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {5753#(<= 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; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {5753#(<= 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; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {5753#(<= 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; {5754#(<= 1 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {5754#(<= 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; {5754#(<= 1 main_~main__cp~0)} is VALID [2022-04-07 11:26:09,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {5754#(<= 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; {5755#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-07 11:26:09,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {5755#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {5748#false} is VALID [2022-04-07 11:26:09,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {5748#false} assume !false; {5748#false} is VALID [2022-04-07 11:26:09,428 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-07 11:26:09,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:09,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036172916] [2022-04-07 11:26:09,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036172916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:09,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:09,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 11:26:09,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970837971] [2022-04-07 11:26:09,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:09,428 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-07 11:26:09,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:09,429 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-07 11:26:09,446 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-07 11:26:09,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 11:26:09,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:09,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 11:26:09,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-07 11:26:09,447 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-07 11:26:09,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:09,697 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-07 11:26:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 11:26:09,698 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-07 11:26:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:09,698 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-07 11:26:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-07 11:26:09,699 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-07 11:26:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-07 11:26:09,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-04-07 11:26:09,748 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-07 11:26:09,749 INFO L225 Difference]: With dead ends: 71 [2022-04-07 11:26:09,749 INFO L226 Difference]: Without dead ends: 69 [2022-04-07 11:26:09,749 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-07 11:26:09,750 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-07 11:26:09,750 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-07 11:26:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-07 11:26:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-04-07 11:26:09,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:09,769 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-07 11:26:09,769 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-07 11:26:09,769 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-07 11:26:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:09,770 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-07 11:26:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-07 11:26:09,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:09,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:09,771 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-07 11:26:09,771 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-07 11:26:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:09,771 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-07 11:26:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-07 11:26:09,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:09,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:09,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:09,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:09,772 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-07 11:26:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-04-07 11:26:09,773 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2022-04-07 11:26:09,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:09,773 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-04-07 11:26:09,773 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-07 11:26:09,773 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-04-07 11:26:09,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-07 11:26:09,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:09,773 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-07 11:26:09,773 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 11:26:09,773 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-07 11:26:09,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:09,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 1 times [2022-04-07 11:26:09,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:09,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681170574] [2022-04-07 11:26:09,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:09,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:09,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:09,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {6060#(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; {6052#true} is VALID [2022-04-07 11:26:09,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {6052#true} assume true; {6052#true} is VALID [2022-04-07 11:26:09,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6052#true} {6052#true} #225#return; {6052#true} is VALID [2022-04-07 11:26:09,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {6052#true} call ULTIMATE.init(); {6060#(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-07 11:26:09,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {6060#(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; {6052#true} is VALID [2022-04-07 11:26:09,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {6052#true} assume true; {6052#true} is VALID [2022-04-07 11:26:09,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6052#true} {6052#true} #225#return; {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {6052#true} call #t~ret11 := main(); {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {6052#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; {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {6052#true} assume !!(~main__urilen~0 <= 1000000); {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {6052#true} assume !!(~main__urilen~0 >= -1000000); {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {6052#true} assume !!(~main__tokenlen~0 <= 1000000); {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {6052#true} assume !!(~main__tokenlen~0 >= -1000000); {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {6052#true} assume !!(~main__scheme~0 <= 1000000); {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {6052#true} assume !!(~main__scheme~0 >= -1000000); {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {6052#true} assume ~main__urilen~0 > 0; {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {6052#true} assume ~main__tokenlen~0 > 0; {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {6052#true} assume ~main__scheme~0 >= 0; {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {6052#true} assume !(0 == ~main__scheme~0); {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {6052#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; {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {6052#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; {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {6052#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; {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {6052#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; {6052#true} is VALID [2022-04-07 11:26:09,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {6052#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; {6052#true} is VALID [2022-04-07 11:26:09,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {6052#true} assume !(0 == ~__VERIFIER_assert__cond~3); {6052#true} is VALID [2022-04-07 11:26:09,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {6052#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; {6052#true} is VALID [2022-04-07 11:26:09,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {6052#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {6052#true} is VALID [2022-04-07 11:26:09,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {6052#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; {6052#true} is VALID [2022-04-07 11:26:09,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {6052#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; {6052#true} is VALID [2022-04-07 11:26:09,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {6052#true} assume !(0 == ~__VERIFIER_assert__cond~5); {6052#true} is VALID [2022-04-07 11:26:09,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {6052#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; {6052#true} is VALID [2022-04-07 11:26:09,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {6052#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; {6052#true} is VALID [2022-04-07 11:26:09,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {6052#true} assume !(0 == ~__VERIFIER_assert__cond~7); {6052#true} is VALID [2022-04-07 11:26:09,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {6052#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; {6052#true} is VALID [2022-04-07 11:26:09,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {6052#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; {6057#(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-07 11:26:09,851 INFO L290 TraceCheckUtils]: 32: Hoare triple {6057#(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; {6058#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:09,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {6058#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~9); {6058#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:09,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {6058#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__cp~0 != ~main__urilen~0 - 1; {6058#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:09,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {6058#(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; {6059#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-07 11:26:09,852 INFO L290 TraceCheckUtils]: 36: Hoare triple {6059#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {6053#false} is VALID [2022-04-07 11:26:09,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {6053#false} assume !false; {6053#false} is VALID [2022-04-07 11:26:09,852 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-07 11:26:09,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:09,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681170574] [2022-04-07 11:26:09,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681170574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:09,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:09,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 11:26:09,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89419360] [2022-04-07 11:26:09,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:09,853 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-07 11:26:09,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:09,854 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-07 11:26:09,870 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-07 11:26:09,870 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 11:26:09,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:09,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 11:26:09,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 11:26:09,871 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-07 11:26:10,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:10,221 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-04-07 11:26:10,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 11:26:10,221 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-07 11:26:10,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:10,221 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-07 11:26:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-04-07 11:26:10,222 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-07 11:26:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-04-07 11:26:10,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 95 transitions. [2022-04-07 11:26:10,302 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-07 11:26:10,303 INFO L225 Difference]: With dead ends: 91 [2022-04-07 11:26:10,303 INFO L226 Difference]: Without dead ends: 89 [2022-04-07 11:26:10,303 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-07 11:26:10,303 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-07 11:26:10,304 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-07 11:26:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-07 11:26:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-04-07 11:26:10,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:10,322 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-07 11:26:10,322 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-07 11:26:10,322 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-07 11:26:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:10,323 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-07 11:26:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-07 11:26:10,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:10,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:10,324 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-07 11:26:10,324 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-07 11:26:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:10,325 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-07 11:26:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-07 11:26:10,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:10,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:10,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:10,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:10,325 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-07 11:26:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-04-07 11:26:10,326 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2022-04-07 11:26:10,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:10,326 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-04-07 11:26:10,326 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-07 11:26:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-07 11:26:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-07 11:26:10,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:10,326 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-07 11:26:10,327 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 11:26:10,327 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-07 11:26:10,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:10,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 1 times [2022-04-07 11:26:10,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:10,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819777362] [2022-04-07 11:26:10,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:10,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:10,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:10,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {6433#(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; {6425#true} is VALID [2022-04-07 11:26:10,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-07 11:26:10,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6425#true} {6425#true} #225#return; {6425#true} is VALID [2022-04-07 11:26:10,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {6425#true} call ULTIMATE.init(); {6433#(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-07 11:26:10,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {6433#(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; {6425#true} is VALID [2022-04-07 11:26:10,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-07 11:26:10,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6425#true} {6425#true} #225#return; {6425#true} is VALID [2022-04-07 11:26:10,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {6425#true} call #t~ret11 := main(); {6425#true} is VALID [2022-04-07 11:26:10,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {6425#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; {6425#true} is VALID [2022-04-07 11:26:10,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {6425#true} assume !!(~main__urilen~0 <= 1000000); {6425#true} is VALID [2022-04-07 11:26:10,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {6425#true} assume !!(~main__urilen~0 >= -1000000); {6425#true} is VALID [2022-04-07 11:26:10,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {6425#true} assume !!(~main__tokenlen~0 <= 1000000); {6425#true} is VALID [2022-04-07 11:26:10,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {6425#true} assume !!(~main__tokenlen~0 >= -1000000); {6425#true} is VALID [2022-04-07 11:26:10,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {6425#true} assume !!(~main__scheme~0 <= 1000000); {6425#true} is VALID [2022-04-07 11:26:10,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {6425#true} assume !!(~main__scheme~0 >= -1000000); {6425#true} is VALID [2022-04-07 11:26:10,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {6425#true} assume ~main__urilen~0 > 0; {6425#true} is VALID [2022-04-07 11:26:10,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {6425#true} assume ~main__tokenlen~0 > 0; {6425#true} is VALID [2022-04-07 11:26:10,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {6425#true} assume ~main__scheme~0 >= 0; {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {6425#true} assume !(0 == ~main__scheme~0); {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {6425#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; {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {6425#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; {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {6425#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; {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {6425#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; {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {6425#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; {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {6425#true} assume !(0 == ~__VERIFIER_assert__cond~3); {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {6425#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; {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {6425#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {6425#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; {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {6425#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; {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {6425#true} assume !(0 == ~__VERIFIER_assert__cond~5); {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {6425#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; {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {6425#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; {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {6425#true} assume !(0 == ~__VERIFIER_assert__cond~7); {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {6425#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; {6425#true} is VALID [2022-04-07 11:26:10,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {6425#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; {6425#true} is VALID [2022-04-07 11:26:10,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {6425#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; {6430#(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-07 11:26:10,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {6430#(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); {6431#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:10,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {6431#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {6431#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:10,382 INFO L290 TraceCheckUtils]: 35: Hoare triple {6431#(<= 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; {6431#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:10,382 INFO L290 TraceCheckUtils]: 36: Hoare triple {6431#(<= 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; {6432#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-07 11:26:10,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {6432#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {6426#false} is VALID [2022-04-07 11:26:10,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {6426#false} assume !false; {6426#false} is VALID [2022-04-07 11:26:10,382 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-07 11:26:10,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:10,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819777362] [2022-04-07 11:26:10,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819777362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:10,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:10,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 11:26:10,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470202622] [2022-04-07 11:26:10,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:10,383 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-07 11:26:10,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:10,384 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-07 11:26:10,401 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-07 11:26:10,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 11:26:10,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:10,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 11:26:10,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 11:26:10,402 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-07 11:26:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:10,657 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-07 11:26:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 11:26:10,657 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-07 11:26:10,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:10,657 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-07 11:26:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-07 11:26:10,658 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-07 11:26:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-07 11:26:10,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2022-04-07 11:26:10,703 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-07 11:26:10,704 INFO L225 Difference]: With dead ends: 61 [2022-04-07 11:26:10,704 INFO L226 Difference]: Without dead ends: 59 [2022-04-07 11:26:10,704 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-07 11:26:10,704 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-07 11:26:10,704 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-07 11:26:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-07 11:26:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-07 11:26:10,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:10,725 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-07 11:26:10,725 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-07 11:26:10,725 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-07 11:26:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:10,726 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-07 11:26:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-07 11:26:10,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:10,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:10,726 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-07 11:26:10,726 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-07 11:26:10,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:10,727 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-07 11:26:10,727 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-07 11:26:10,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:10,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:10,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:10,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:10,727 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-07 11:26:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-04-07 11:26:10,728 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2022-04-07 11:26:10,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:10,728 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-04-07 11:26:10,728 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-07 11:26:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-07 11:26:10,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 11:26:10,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:10,729 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-07 11:26:10,729 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-07 11:26:10,729 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-07 11:26:10,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:10,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 1 times [2022-04-07 11:26:10,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:10,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162221747] [2022-04-07 11:26:10,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:10,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:10,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:10,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {6705#(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; {6698#true} is VALID [2022-04-07 11:26:10,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {6698#true} assume true; {6698#true} is VALID [2022-04-07 11:26:10,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6698#true} {6698#true} #225#return; {6698#true} is VALID [2022-04-07 11:26:10,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {6698#true} call ULTIMATE.init(); {6705#(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-07 11:26:10,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {6705#(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; {6698#true} is VALID [2022-04-07 11:26:10,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {6698#true} assume true; {6698#true} is VALID [2022-04-07 11:26:10,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6698#true} {6698#true} #225#return; {6698#true} is VALID [2022-04-07 11:26:10,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {6698#true} call #t~ret11 := main(); {6698#true} is VALID [2022-04-07 11:26:10,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {6698#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; {6698#true} is VALID [2022-04-07 11:26:10,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {6698#true} assume !!(~main__urilen~0 <= 1000000); {6698#true} is VALID [2022-04-07 11:26:10,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {6698#true} assume !!(~main__urilen~0 >= -1000000); {6698#true} is VALID [2022-04-07 11:26:10,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {6698#true} assume !!(~main__tokenlen~0 <= 1000000); {6698#true} is VALID [2022-04-07 11:26:10,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {6698#true} assume !!(~main__tokenlen~0 >= -1000000); {6698#true} is VALID [2022-04-07 11:26:10,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {6698#true} assume !!(~main__scheme~0 <= 1000000); {6698#true} is VALID [2022-04-07 11:26:10,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {6698#true} assume !!(~main__scheme~0 >= -1000000); {6698#true} is VALID [2022-04-07 11:26:10,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {6698#true} assume ~main__urilen~0 > 0; {6698#true} is VALID [2022-04-07 11:26:10,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {6698#true} assume ~main__tokenlen~0 > 0; {6698#true} is VALID [2022-04-07 11:26:10,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {6698#true} assume ~main__scheme~0 >= 0; {6698#true} is VALID [2022-04-07 11:26:10,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {6698#true} assume !(0 == ~main__scheme~0); {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {6698#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; {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {6698#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; {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {6698#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; {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {6698#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; {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {6698#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; {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {6698#true} assume !(0 == ~__VERIFIER_assert__cond~3); {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {6698#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; {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {6698#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {6698#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; {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {6698#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; {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {6698#true} assume !(0 == ~__VERIFIER_assert__cond~5); {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {6698#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; {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {6698#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; {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {6698#true} assume !(0 == ~__VERIFIER_assert__cond~7); {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {6698#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; {6698#true} is VALID [2022-04-07 11:26:10,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {6698#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; {6698#true} is VALID [2022-04-07 11:26:10,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {6698#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; {6698#true} is VALID [2022-04-07 11:26:10,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {6698#true} assume !(0 == ~__VERIFIER_assert__cond~9); {6698#true} is VALID [2022-04-07 11:26:10,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {6698#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {6698#true} is VALID [2022-04-07 11:26:10,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {6698#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; {6703#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-07 11:26:10,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {6703#(<= (+ 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; {6703#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-07 11:26:10,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {6703#(<= (+ 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; {6703#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-07 11:26:10,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {6703#(<= (+ 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; {6704#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-07 11:26:10,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {6704#(not (= main_~__VERIFIER_assert__cond~12 0))} assume 0 == ~__VERIFIER_assert__cond~12; {6699#false} is VALID [2022-04-07 11:26:10,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {6699#false} assume !false; {6699#false} is VALID [2022-04-07 11:26:10,768 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-07 11:26:10,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:10,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162221747] [2022-04-07 11:26:10,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162221747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:10,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:10,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 11:26:10,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794426799] [2022-04-07 11:26:10,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:10,769 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-07 11:26:10,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:10,769 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-07 11:26:10,786 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-07 11:26:10,787 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 11:26:10,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:10,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 11:26:10,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 11:26:10,787 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-07 11:26:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:10,989 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-07 11:26:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 11:26:10,990 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-07 11:26:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:10,990 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-07 11:26:10,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-07 11:26:10,991 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-07 11:26:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-07 11:26:10,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-07 11:26:11,040 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-07 11:26:11,041 INFO L225 Difference]: With dead ends: 70 [2022-04-07 11:26:11,041 INFO L226 Difference]: Without dead ends: 68 [2022-04-07 11:26:11,041 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-07 11:26:11,042 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-07 11:26:11,042 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-07 11:26:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-07 11:26:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2022-04-07 11:26:11,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:11,069 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-07 11:26:11,069 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-07 11:26:11,069 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-07 11:26:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:11,070 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-07 11:26:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-07 11:26:11,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:11,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:11,070 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-07 11:26:11,070 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-07 11:26:11,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:11,071 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-07 11:26:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-07 11:26:11,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:11,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:11,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:11,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:11,071 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-07 11:26:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-04-07 11:26:11,072 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2022-04-07 11:26:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:11,072 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-04-07 11:26:11,072 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-07 11:26:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-07 11:26:11,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-07 11:26:11,072 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:11,073 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-07 11:26:11,073 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-07 11:26:11,073 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-07 11:26:11,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:11,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 1 times [2022-04-07 11:26:11,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:11,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766209111] [2022-04-07 11:26:11,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:11,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:11,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:11,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {7010#(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; {7002#true} is VALID [2022-04-07 11:26:11,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {7002#true} assume true; {7002#true} is VALID [2022-04-07 11:26:11,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7002#true} {7002#true} #225#return; {7002#true} is VALID [2022-04-07 11:26:11,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {7002#true} call ULTIMATE.init(); {7010#(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-07 11:26:11,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {7010#(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; {7002#true} is VALID [2022-04-07 11:26:11,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {7002#true} assume true; {7002#true} is VALID [2022-04-07 11:26:11,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7002#true} {7002#true} #225#return; {7002#true} is VALID [2022-04-07 11:26:11,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {7002#true} call #t~ret11 := main(); {7002#true} is VALID [2022-04-07 11:26:11,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {7002#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; {7002#true} is VALID [2022-04-07 11:26:11,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {7002#true} assume !!(~main__urilen~0 <= 1000000); {7002#true} is VALID [2022-04-07 11:26:11,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {7002#true} assume !!(~main__urilen~0 >= -1000000); {7002#true} is VALID [2022-04-07 11:26:11,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {7002#true} assume !!(~main__tokenlen~0 <= 1000000); {7002#true} is VALID [2022-04-07 11:26:11,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {7002#true} assume !!(~main__tokenlen~0 >= -1000000); {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {7002#true} assume !!(~main__scheme~0 <= 1000000); {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {7002#true} assume !!(~main__scheme~0 >= -1000000); {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {7002#true} assume ~main__urilen~0 > 0; {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {7002#true} assume ~main__tokenlen~0 > 0; {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {7002#true} assume ~main__scheme~0 >= 0; {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {7002#true} assume !(0 == ~main__scheme~0); {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {7002#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; {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {7002#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; {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {7002#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; {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {7002#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; {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {7002#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; {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {7002#true} assume !(0 == ~__VERIFIER_assert__cond~3); {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {7002#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; {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {7002#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {7002#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; {7002#true} is VALID [2022-04-07 11:26:11,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {7002#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; {7002#true} is VALID [2022-04-07 11:26:11,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {7002#true} assume !(0 == ~__VERIFIER_assert__cond~5); {7002#true} is VALID [2022-04-07 11:26:11,156 INFO L290 TraceCheckUtils]: 27: Hoare triple {7002#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; {7002#true} is VALID [2022-04-07 11:26:11,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {7002#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; {7002#true} is VALID [2022-04-07 11:26:11,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {7002#true} assume !(0 == ~__VERIFIER_assert__cond~7); {7002#true} is VALID [2022-04-07 11:26:11,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {7002#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; {7002#true} is VALID [2022-04-07 11:26:11,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {7002#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; {7007#(= main_~main__c~0 0)} is VALID [2022-04-07 11:26:11,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {7007#(= 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; {7007#(= main_~main__c~0 0)} is VALID [2022-04-07 11:26:11,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {7007#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~9); {7007#(= main_~main__c~0 0)} is VALID [2022-04-07 11:26:11,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {7007#(= main_~main__c~0 0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7007#(= main_~main__c~0 0)} is VALID [2022-04-07 11:26:11,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {7007#(= 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; {7007#(= main_~main__c~0 0)} is VALID [2022-04-07 11:26:11,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {7007#(= 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; {7007#(= main_~main__c~0 0)} is VALID [2022-04-07 11:26:11,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {7007#(= 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; {7007#(= main_~main__c~0 0)} is VALID [2022-04-07 11:26:11,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {7007#(= 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; {7008#(<= 1 main_~main__c~0)} is VALID [2022-04-07 11:26:11,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {7008#(<= 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; {7009#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-07 11:26:11,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {7009#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {7003#false} is VALID [2022-04-07 11:26:11,158 INFO L290 TraceCheckUtils]: 41: Hoare triple {7003#false} assume !false; {7003#false} is VALID [2022-04-07 11:26:11,159 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-07 11:26:11,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:11,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766209111] [2022-04-07 11:26:11,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766209111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:11,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:11,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 11:26:11,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400823690] [2022-04-07 11:26:11,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:11,159 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-07 11:26:11,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:11,160 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-07 11:26:11,179 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-07 11:26:11,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 11:26:11,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:11,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 11:26:11,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 11:26:11,180 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-07 11:26:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:11,420 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-04-07 11:26:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 11:26:11,420 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-07 11:26:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:11,421 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-07 11:26:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-04-07 11:26:11,421 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-07 11:26:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-04-07 11:26:11,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2022-04-07 11:26:11,467 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-07 11:26:11,468 INFO L225 Difference]: With dead ends: 66 [2022-04-07 11:26:11,468 INFO L226 Difference]: Without dead ends: 64 [2022-04-07 11:26:11,468 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-07 11:26:11,469 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-07 11:26:11,469 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-07 11:26:11,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-07 11:26:11,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-04-07 11:26:11,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:11,491 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-07 11:26:11,491 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-07 11:26:11,491 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-07 11:26:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:11,492 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-07 11:26:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-07 11:26:11,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:11,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:11,492 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-07 11:26:11,492 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-07 11:26:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:11,493 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-07 11:26:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-07 11:26:11,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:11,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:11,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:11,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:11,493 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-07 11:26:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-07 11:26:11,494 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2022-04-07 11:26:11,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:11,494 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-07 11:26:11,495 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-07 11:26:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-07 11:26:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 11:26:11,495 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:11,495 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-07 11:26:11,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-07 11:26:11,495 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-07 11:26:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:11,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 1 times [2022-04-07 11:26:11,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:11,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855039242] [2022-04-07 11:26:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:11,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:11,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:11,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {7296#(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; {7288#true} is VALID [2022-04-07 11:26:11,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {7288#true} assume true; {7288#true} is VALID [2022-04-07 11:26:11,547 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7288#true} {7288#true} #225#return; {7288#true} is VALID [2022-04-07 11:26:11,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {7288#true} call ULTIMATE.init(); {7296#(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-07 11:26:11,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {7296#(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; {7288#true} is VALID [2022-04-07 11:26:11,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {7288#true} assume true; {7288#true} is VALID [2022-04-07 11:26:11,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7288#true} {7288#true} #225#return; {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {7288#true} call #t~ret11 := main(); {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {7288#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; {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {7288#true} assume !!(~main__urilen~0 <= 1000000); {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {7288#true} assume !!(~main__urilen~0 >= -1000000); {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {7288#true} assume !!(~main__tokenlen~0 <= 1000000); {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {7288#true} assume !!(~main__tokenlen~0 >= -1000000); {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {7288#true} assume !!(~main__scheme~0 <= 1000000); {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {7288#true} assume !!(~main__scheme~0 >= -1000000); {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {7288#true} assume ~main__urilen~0 > 0; {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {7288#true} assume ~main__tokenlen~0 > 0; {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {7288#true} assume ~main__scheme~0 >= 0; {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {7288#true} assume !(0 == ~main__scheme~0); {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {7288#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; {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {7288#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; {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {7288#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; {7288#true} is VALID [2022-04-07 11:26:11,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {7288#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; {7288#true} is VALID [2022-04-07 11:26:11,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {7288#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; {7288#true} is VALID [2022-04-07 11:26:11,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {7288#true} assume !(0 == ~__VERIFIER_assert__cond~3); {7288#true} is VALID [2022-04-07 11:26:11,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {7288#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; {7288#true} is VALID [2022-04-07 11:26:11,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {7288#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {7288#true} is VALID [2022-04-07 11:26:11,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {7288#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; {7288#true} is VALID [2022-04-07 11:26:11,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {7288#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; {7288#true} is VALID [2022-04-07 11:26:11,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {7288#true} assume !(0 == ~__VERIFIER_assert__cond~5); {7288#true} is VALID [2022-04-07 11:26:11,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {7288#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; {7288#true} is VALID [2022-04-07 11:26:11,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {7288#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; {7288#true} is VALID [2022-04-07 11:26:11,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {7288#true} assume !(0 == ~__VERIFIER_assert__cond~7); {7288#true} is VALID [2022-04-07 11:26:11,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {7288#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; {7288#true} is VALID [2022-04-07 11:26:11,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {7288#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; {7293#(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-07 11:26:11,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {7293#(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; {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:11,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~9); {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:11,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__cp~0 != ~main__urilen~0 - 1; {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:11,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {7294#(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; {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:11,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {7294#(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; {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:11,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {7294#(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; {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:11,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {7294#(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; {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:11,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {7294#(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; {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:11,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {7294#(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; {7295#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-07 11:26:11,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {7295#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {7289#false} is VALID [2022-04-07 11:26:11,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {7289#false} assume !false; {7289#false} is VALID [2022-04-07 11:26:11,552 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-07 11:26:11,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:11,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855039242] [2022-04-07 11:26:11,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855039242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:11,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:11,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 11:26:11,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890702670] [2022-04-07 11:26:11,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:11,555 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-07 11:26:11,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:11,555 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-07 11:26:11,574 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-07 11:26:11,574 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 11:26:11,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:11,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 11:26:11,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 11:26:11,575 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-07 11:26:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:11,950 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-04-07 11:26:11,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 11:26:11,950 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-07 11:26:11,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:11,950 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-07 11:26:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2022-04-07 11:26:11,951 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-07 11:26:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2022-04-07 11:26:11,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 93 transitions. [2022-04-07 11:26:12,016 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-07 11:26:12,017 INFO L225 Difference]: With dead ends: 88 [2022-04-07 11:26:12,017 INFO L226 Difference]: Without dead ends: 86 [2022-04-07 11:26:12,017 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-07 11:26:12,018 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-07 11:26:12,018 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-07 11:26:12,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-07 11:26:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2022-04-07 11:26:12,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:12,041 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-07 11:26:12,041 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-07 11:26:12,042 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-07 11:26:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:12,042 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-07 11:26:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-07 11:26:12,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:12,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:12,043 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-07 11:26:12,043 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-07 11:26:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:12,044 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-07 11:26:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-07 11:26:12,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:12,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:12,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:12,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:12,044 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-07 11:26:12,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-04-07 11:26:12,045 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2022-04-07 11:26:12,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:12,045 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-04-07 11:26:12,045 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-07 11:26:12,045 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-04-07 11:26:12,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 11:26:12,045 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:12,045 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-07 11:26:12,046 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-07 11:26:12,046 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-07 11:26:12,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:12,046 INFO L85 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 1 times [2022-04-07 11:26:12,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:12,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979835769] [2022-04-07 11:26:12,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:12,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:12,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:12,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {7662#(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; {7654#true} is VALID [2022-04-07 11:26:12,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {7654#true} assume true; {7654#true} is VALID [2022-04-07 11:26:12,097 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7654#true} {7654#true} #225#return; {7654#true} is VALID [2022-04-07 11:26:12,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {7654#true} call ULTIMATE.init(); {7662#(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-07 11:26:12,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {7662#(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; {7654#true} is VALID [2022-04-07 11:26:12,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {7654#true} assume true; {7654#true} is VALID [2022-04-07 11:26:12,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7654#true} {7654#true} #225#return; {7654#true} is VALID [2022-04-07 11:26:12,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {7654#true} call #t~ret11 := main(); {7654#true} is VALID [2022-04-07 11:26:12,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {7654#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; {7654#true} is VALID [2022-04-07 11:26:12,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {7654#true} assume !!(~main__urilen~0 <= 1000000); {7654#true} is VALID [2022-04-07 11:26:12,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {7654#true} assume !!(~main__urilen~0 >= -1000000); {7654#true} is VALID [2022-04-07 11:26:12,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {7654#true} assume !!(~main__tokenlen~0 <= 1000000); {7654#true} is VALID [2022-04-07 11:26:12,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {7654#true} assume !!(~main__tokenlen~0 >= -1000000); {7654#true} is VALID [2022-04-07 11:26:12,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {7654#true} assume !!(~main__scheme~0 <= 1000000); {7654#true} is VALID [2022-04-07 11:26:12,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {7654#true} assume !!(~main__scheme~0 >= -1000000); {7654#true} is VALID [2022-04-07 11:26:12,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {7654#true} assume ~main__urilen~0 > 0; {7654#true} is VALID [2022-04-07 11:26:12,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {7654#true} assume ~main__tokenlen~0 > 0; {7654#true} is VALID [2022-04-07 11:26:12,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {7654#true} assume ~main__scheme~0 >= 0; {7654#true} is VALID [2022-04-07 11:26:12,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {7654#true} assume !(0 == ~main__scheme~0); {7654#true} is VALID [2022-04-07 11:26:12,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {7654#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; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {7659#(< 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; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {7659#(< 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; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {7659#(< 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; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {7659#(< 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; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {7659#(< 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {7659#(< 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; {7661#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-07 11:26:12,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {7661#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {7655#false} is VALID [2022-04-07 11:26:12,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {7655#false} assume !false; {7655#false} is VALID [2022-04-07 11:26:12,105 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-07 11:26:12,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:12,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979835769] [2022-04-07 11:26:12,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979835769] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:26:12,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660025954] [2022-04-07 11:26:12,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:12,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:26:12,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:26:12,118 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-07 11:26:12,119 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-07 11:26:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:12,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 11:26:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:12,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:26:12,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {7654#true} call ULTIMATE.init(); {7654#true} is VALID [2022-04-07 11:26:12,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {7654#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; {7654#true} is VALID [2022-04-07 11:26:12,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {7654#true} assume true; {7654#true} is VALID [2022-04-07 11:26:12,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7654#true} {7654#true} #225#return; {7654#true} is VALID [2022-04-07 11:26:12,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {7654#true} call #t~ret11 := main(); {7654#true} is VALID [2022-04-07 11:26:12,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {7654#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; {7654#true} is VALID [2022-04-07 11:26:12,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {7654#true} assume !!(~main__urilen~0 <= 1000000); {7654#true} is VALID [2022-04-07 11:26:12,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {7654#true} assume !!(~main__urilen~0 >= -1000000); {7654#true} is VALID [2022-04-07 11:26:12,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {7654#true} assume !!(~main__tokenlen~0 <= 1000000); {7654#true} is VALID [2022-04-07 11:26:12,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {7654#true} assume !!(~main__tokenlen~0 >= -1000000); {7654#true} is VALID [2022-04-07 11:26:12,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {7654#true} assume !!(~main__scheme~0 <= 1000000); {7654#true} is VALID [2022-04-07 11:26:12,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {7654#true} assume !!(~main__scheme~0 >= -1000000); {7654#true} is VALID [2022-04-07 11:26:12,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {7654#true} assume ~main__urilen~0 > 0; {7654#true} is VALID [2022-04-07 11:26:12,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {7654#true} assume ~main__tokenlen~0 > 0; {7654#true} is VALID [2022-04-07 11:26:12,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {7654#true} assume ~main__scheme~0 >= 0; {7654#true} is VALID [2022-04-07 11:26:12,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {7654#true} assume !(0 == ~main__scheme~0); {7654#true} is VALID [2022-04-07 11:26:12,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {7654#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; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {7659#(< 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; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {7659#(< 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; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {7659#(< 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; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {7659#(< 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; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {7659#(< 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,407 INFO L290 TraceCheckUtils]: 41: Hoare triple {7659#(< 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; {7789#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID [2022-04-07 11:26:12,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {7789#(<= 1 main_~__VERIFIER_assert__cond~10)} assume 0 == ~__VERIFIER_assert__cond~10; {7655#false} is VALID [2022-04-07 11:26:12,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {7655#false} assume !false; {7655#false} is VALID [2022-04-07 11:26:12,407 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-07 11:26:12,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:26:12,584 INFO L290 TraceCheckUtils]: 43: Hoare triple {7655#false} assume !false; {7655#false} is VALID [2022-04-07 11:26:12,584 INFO L290 TraceCheckUtils]: 42: Hoare triple {7789#(<= 1 main_~__VERIFIER_assert__cond~10)} assume 0 == ~__VERIFIER_assert__cond~10; {7655#false} is VALID [2022-04-07 11:26:12,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {7659#(< 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; {7789#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID [2022-04-07 11:26:12,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {7660#(< (+ 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {7659#(< 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; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {7659#(< 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; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {7659#(< 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; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {7659#(< 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; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {7659#(< 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; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {7654#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; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 11:26:12,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {7654#true} assume !(0 == ~main__scheme~0); {7654#true} is VALID [2022-04-07 11:26:12,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {7654#true} assume ~main__scheme~0 >= 0; {7654#true} is VALID [2022-04-07 11:26:12,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {7654#true} assume ~main__tokenlen~0 > 0; {7654#true} is VALID [2022-04-07 11:26:12,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {7654#true} assume ~main__urilen~0 > 0; {7654#true} is VALID [2022-04-07 11:26:12,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {7654#true} assume !!(~main__scheme~0 >= -1000000); {7654#true} is VALID [2022-04-07 11:26:12,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {7654#true} assume !!(~main__scheme~0 <= 1000000); {7654#true} is VALID [2022-04-07 11:26:12,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {7654#true} assume !!(~main__tokenlen~0 >= -1000000); {7654#true} is VALID [2022-04-07 11:26:12,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {7654#true} assume !!(~main__tokenlen~0 <= 1000000); {7654#true} is VALID [2022-04-07 11:26:12,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {7654#true} assume !!(~main__urilen~0 >= -1000000); {7654#true} is VALID [2022-04-07 11:26:12,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {7654#true} assume !!(~main__urilen~0 <= 1000000); {7654#true} is VALID [2022-04-07 11:26:12,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {7654#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; {7654#true} is VALID [2022-04-07 11:26:12,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {7654#true} call #t~ret11 := main(); {7654#true} is VALID [2022-04-07 11:26:12,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7654#true} {7654#true} #225#return; {7654#true} is VALID [2022-04-07 11:26:12,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {7654#true} assume true; {7654#true} is VALID [2022-04-07 11:26:12,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {7654#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; {7654#true} is VALID [2022-04-07 11:26:12,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {7654#true} call ULTIMATE.init(); {7654#true} is VALID [2022-04-07 11:26:12,593 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-07 11:26:12,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660025954] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:26:12,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:26:12,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-07 11:26:12,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007622240] [2022-04-07 11:26:12,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:26:12,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-07 11:26:12,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:12,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:26:12,621 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-07 11:26:12,621 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 11:26:12,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:12,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 11:26:12,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 11:26:12,621 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:26:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:12,868 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-04-07 11:26:12,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 11:26:12,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-07 11:26:12,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:26:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-04-07 11:26:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:26:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-04-07 11:26:12,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2022-04-07 11:26:12,910 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-07 11:26:12,910 INFO L225 Difference]: With dead ends: 60 [2022-04-07 11:26:12,910 INFO L226 Difference]: Without dead ends: 58 [2022-04-07 11:26:12,911 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-07 11:26:12,911 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 84 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:26:12,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 54 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 11:26:12,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-07 11:26:12,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-07 11:26:12,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:12,934 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-07 11:26:12,934 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-07 11:26:12,934 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-07 11:26:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:12,935 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-07 11:26:12,935 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-07 11:26:12,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:12,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:12,935 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-07 11:26:12,935 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-07 11:26:12,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:12,936 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-07 11:26:12,936 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-07 11:26:12,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:12,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:12,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:12,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:12,936 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-07 11:26:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-04-07 11:26:12,937 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2022-04-07 11:26:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:12,937 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-04-07 11:26:12,937 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:26:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-07 11:26:12,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 11:26:12,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:12,937 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-07 11:26:12,956 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-07 11:26:13,147 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-07 11:26:13,148 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-07 11:26:13,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 1 times [2022-04-07 11:26:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:13,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431505281] [2022-04-07 11:26:13,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:13,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:13,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:13,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {8195#(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; {8187#true} is VALID [2022-04-07 11:26:13,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {8187#true} assume true; {8187#true} is VALID [2022-04-07 11:26:13,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8187#true} {8187#true} #225#return; {8187#true} is VALID [2022-04-07 11:26:13,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {8187#true} call ULTIMATE.init(); {8195#(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-07 11:26:13,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {8195#(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; {8187#true} is VALID [2022-04-07 11:26:13,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {8187#true} assume true; {8187#true} is VALID [2022-04-07 11:26:13,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8187#true} {8187#true} #225#return; {8187#true} is VALID [2022-04-07 11:26:13,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {8187#true} call #t~ret11 := main(); {8187#true} is VALID [2022-04-07 11:26:13,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {8187#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; {8187#true} is VALID [2022-04-07 11:26:13,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {8187#true} assume !!(~main__urilen~0 <= 1000000); {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {8187#true} assume !!(~main__urilen~0 >= -1000000); {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {8187#true} assume !!(~main__tokenlen~0 <= 1000000); {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {8187#true} assume !!(~main__tokenlen~0 >= -1000000); {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {8187#true} assume !!(~main__scheme~0 <= 1000000); {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {8187#true} assume !!(~main__scheme~0 >= -1000000); {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {8187#true} assume ~main__urilen~0 > 0; {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {8187#true} assume ~main__tokenlen~0 > 0; {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {8187#true} assume ~main__scheme~0 >= 0; {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {8187#true} assume !(0 == ~main__scheme~0); {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {8187#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; {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {8187#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; {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {8187#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; {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {8187#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; {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {8187#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; {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {8187#true} assume !(0 == ~__VERIFIER_assert__cond~3); {8187#true} is VALID [2022-04-07 11:26:13,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {8187#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; {8187#true} is VALID [2022-04-07 11:26:13,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {8187#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {8187#true} is VALID [2022-04-07 11:26:13,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {8187#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; {8187#true} is VALID [2022-04-07 11:26:13,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {8187#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; {8187#true} is VALID [2022-04-07 11:26:13,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {8187#true} assume !(0 == ~__VERIFIER_assert__cond~5); {8187#true} is VALID [2022-04-07 11:26:13,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {8187#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; {8187#true} is VALID [2022-04-07 11:26:13,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {8187#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; {8187#true} is VALID [2022-04-07 11:26:13,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {8187#true} assume !(0 == ~__VERIFIER_assert__cond~7); {8187#true} is VALID [2022-04-07 11:26:13,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {8187#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; {8187#true} is VALID [2022-04-07 11:26:13,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {8187#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; {8187#true} is VALID [2022-04-07 11:26:13,213 INFO L290 TraceCheckUtils]: 32: Hoare triple {8187#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; {8192#(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-07 11:26:13,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {8192#(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); {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:13,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {8193#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:13,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {8193#(<= 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; {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:13,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {8193#(<= 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; {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:13,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {8193#(<= 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; {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:13,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {8193#(<= 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; {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:13,214 INFO L290 TraceCheckUtils]: 39: Hoare triple {8193#(<= 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; {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:13,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {8193#(<= 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; {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 11:26:13,215 INFO L290 TraceCheckUtils]: 41: Hoare triple {8193#(<= 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; {8194#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-07 11:26:13,215 INFO L290 TraceCheckUtils]: 42: Hoare triple {8194#(not (= main_~__VERIFIER_assert__cond~15 0))} assume 0 == ~__VERIFIER_assert__cond~15; {8188#false} is VALID [2022-04-07 11:26:13,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {8188#false} assume !false; {8188#false} is VALID [2022-04-07 11:26:13,215 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-07 11:26:13,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:13,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431505281] [2022-04-07 11:26:13,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431505281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:13,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:13,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 11:26:13,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242932540] [2022-04-07 11:26:13,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:13,216 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-07 11:26:13,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:13,216 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-07 11:26:13,237 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-07 11:26:13,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 11:26:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:13,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 11:26:13,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 11:26:13,238 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-07 11:26:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:13,471 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-07 11:26:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 11:26:13,471 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-07 11:26:13,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:13,471 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-07 11:26:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-07 11:26:13,472 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-07 11:26:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-07 11:26:13,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-04-07 11:26:13,515 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-07 11:26:13,516 INFO L225 Difference]: With dead ends: 69 [2022-04-07 11:26:13,516 INFO L226 Difference]: Without dead ends: 67 [2022-04-07 11:26:13,516 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-07 11:26:13,517 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-07 11:26:13,517 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-07 11:26:13,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-07 11:26:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2022-04-07 11:26:13,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:13,557 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-07 11:26:13,557 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-07 11:26:13,557 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-07 11:26:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:13,558 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-07 11:26:13,558 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-07 11:26:13,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:13,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:13,558 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-07 11:26:13,558 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-07 11:26:13,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:13,559 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-07 11:26:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-07 11:26:13,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:13,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:13,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:13,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:13,559 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-07 11:26:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-04-07 11:26:13,560 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2022-04-07 11:26:13,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:13,560 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-04-07 11:26:13,560 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-07 11:26:13,560 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-07 11:26:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-07 11:26:13,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:26:13,561 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-07 11:26:13,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-07 11:26:13,561 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-07 11:26:13,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:26:13,561 INFO L85 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 1 times [2022-04-07 11:26:13,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:26:13,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477589615] [2022-04-07 11:26:13,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:26:13,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:26:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:13,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:26:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:26:13,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {8491#(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; {8483#true} is VALID [2022-04-07 11:26:13,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {8483#true} assume true; {8483#true} is VALID [2022-04-07 11:26:13,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8483#true} {8483#true} #225#return; {8483#true} is VALID [2022-04-07 11:26:13,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {8483#true} call ULTIMATE.init(); {8491#(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-07 11:26:13,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {8491#(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; {8483#true} is VALID [2022-04-07 11:26:13,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {8483#true} assume true; {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8483#true} {8483#true} #225#return; {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {8483#true} call #t~ret11 := main(); {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {8483#true} assume !!(~main__urilen~0 <= 1000000); {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {8483#true} assume !!(~main__urilen~0 >= -1000000); {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {8483#true} assume !!(~main__tokenlen~0 <= 1000000); {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {8483#true} assume !!(~main__tokenlen~0 >= -1000000); {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {8483#true} assume !!(~main__scheme~0 <= 1000000); {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {8483#true} assume !!(~main__scheme~0 >= -1000000); {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {8483#true} assume ~main__urilen~0 > 0; {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {8483#true} assume ~main__tokenlen~0 > 0; {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {8483#true} assume ~main__scheme~0 >= 0; {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {8483#true} assume !(0 == ~main__scheme~0); {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~3); {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {8483#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~5); {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~7); {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~9); {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {8483#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {8483#true} is VALID [2022-04-07 11:26:13,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {8483#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; {8483#true} is VALID [2022-04-07 11:26:13,615 INFO L290 TraceCheckUtils]: 38: Hoare triple {8483#true} assume !!(0 == ~main____CPAchecker_TMP_3~0); {8483#true} is VALID [2022-04-07 11:26:13,615 INFO L290 TraceCheckUtils]: 39: Hoare triple {8483#true} ~main__cp~0 := 1 + ~main__cp~0; {8483#true} is VALID [2022-04-07 11:26:13,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {8483#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {8483#true} is VALID [2022-04-07 11:26:13,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {8483#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; {8488#(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-07 11:26:13,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {8488#(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; {8489#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:13,616 INFO L290 TraceCheckUtils]: 43: Hoare triple {8489#(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; {8489#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:13,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {8489#(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; {8489#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:13,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {8489#(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; {8489#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 11:26:13,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {8489#(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; {8490#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-07 11:26:13,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {8490#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {8484#false} is VALID [2022-04-07 11:26:13,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {8484#false} assume !false; {8484#false} is VALID [2022-04-07 11:26:13,617 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-07 11:26:13,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:26:13,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477589615] [2022-04-07 11:26:13,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477589615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:26:13,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:26:13,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 11:26:13,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366700506] [2022-04-07 11:26:13,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:26:13,618 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-07 11:26:13,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:26:13,618 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-07 11:26:13,639 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-07 11:26:13,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 11:26:13,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:26:13,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 11:26:13,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 11:26:13,640 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-07 11:26:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:13,939 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-07 11:26:13,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 11:26:13,940 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-07 11:26:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:26:13,940 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-07 11:26:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-07 11:26:13,941 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-07 11:26:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-07 11:26:13,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 71 transitions. [2022-04-07 11:26:13,990 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-07 11:26:13,991 INFO L225 Difference]: With dead ends: 75 [2022-04-07 11:26:13,991 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 11:26:13,991 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-07 11:26:13,992 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-07 11:26:13,992 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-07 11:26:13,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 11:26:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 11:26:13,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:26:13,992 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-07 11:26:13,992 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-07 11:26:13,992 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-07 11:26:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:13,992 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 11:26:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 11:26:13,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:13,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:13,993 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-07 11:26:13,993 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-07 11:26:13,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:26:13,993 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 11:26:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 11:26:13,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:13,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:26:13,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:26:13,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:26:13,993 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-07 11:26:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 11:26:13,993 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-04-07 11:26:13,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:26:13,993 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 11:26:13,994 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-07 11:26:13,994 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 11:26:13,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:26:13,995 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-04-07 11:26:13,996 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-04-07 11:26:13,996 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-04-07 11:26:13,996 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-04-07 11:26:13,996 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-04-07 11:26:13,996 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-04-07 11:26:13,996 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-04-07 11:26:13,996 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-04-07 11:26:13,996 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-04-07 11:26:13,996 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-04-07 11:26:13,996 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-04-07 11:26:13,996 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-04-07 11:26:13,997 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-04-07 11:26:13,997 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-04-07 11:26:13,997 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-04-07 11:26:13,997 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-04-07 11:26:13,997 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-04-07 11:26:13,997 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-04-07 11:26:13,997 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-07 11:26:13,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 11:26:24,153 WARN L232 SmtUtils]: Spent 10.15s on a formula simplification. DAG size of input: 127 DAG size of output: 123 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-07 11:27:05,250 WARN L232 SmtUtils]: Spent 39.97s on a formula simplification. DAG size of input: 133 DAG size of output: 128 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-07 11:27:05,869 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-07 11:27:05,869 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-07 11:27:05,869 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-07 11:27:05,869 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 13 439) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point L374(line 374) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point L308(line 308) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point L143(lines 143 362) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point L234(lines 234 338) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point L135(lines 135 397) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point L61(lines 61 427) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point L53(lines 53 433) no Hoare annotation was computed. [2022-04-07 11:27:05,870 INFO L882 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2022-04-07 11:27:05,871 INFO L882 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-04-07 11:27:05,871 INFO L882 garLoopResultBuilder]: For program point L111(lines 111 405) no Hoare annotation was computed. [2022-04-07 11:27:05,871 INFO L882 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2022-04-07 11:27:05,871 INFO L878 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (and (< main_~main__cp~0 main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~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 (= 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 (<= 1 main_~__VERIFIER_assert__cond~16) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5)))) [2022-04-07 11:27:05,871 INFO L882 garLoopResultBuilder]: For program point L194(lines 194 354) no Hoare annotation was computed. [2022-04-07 11:27:05,871 INFO L882 garLoopResultBuilder]: For program point L384(lines 384 393) no Hoare annotation was computed. [2022-04-07 11:27:05,871 INFO L882 garLoopResultBuilder]: For program point L95(lines 95 412) no Hoare annotation was computed. [2022-04-07 11:27:05,871 INFO L882 garLoopResultBuilder]: For program point L29(lines 29 437) no Hoare annotation was computed. [2022-04-07 11:27:05,871 INFO L882 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-04-07 11:27:05,871 INFO L882 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-04-07 11:27:05,871 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-07 11:27:05,871 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 13 439) no Hoare annotation was computed. [2022-04-07 11:27:05,872 INFO L882 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2022-04-07 11:27:05,872 INFO L882 garLoopResultBuilder]: For program point L104(lines 104 411) no Hoare annotation was computed. [2022-04-07 11:27:05,872 INFO L882 garLoopResultBuilder]: For program point L71(lines 71 416) no Hoare annotation was computed. [2022-04-07 11:27:05,872 INFO L878 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (and (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (let ((.cse1 (= main_~__VERIFIER_assert__cond~9 1)) (.cse2 (not (= main_~__VERIFIER_assert__cond~1 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 (not (= main_~__VERIFIER_assert__cond~9 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 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse15 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .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 (= main_~main__c~0 0)) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse0)))) [2022-04-07 11:27:05,872 INFO L882 garLoopResultBuilder]: For program point L294(lines 294 318) no Hoare annotation was computed. [2022-04-07 11:27:05,872 INFO L882 garLoopResultBuilder]: For program point L162(lines 162 359) no Hoare annotation was computed. [2022-04-07 11:27:05,872 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-04-07 11:27:05,872 INFO L882 garLoopResultBuilder]: For program point L63(lines 63 422) no Hoare annotation was computed. [2022-04-07 11:27:05,872 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-07 11:27:05,872 INFO L882 garLoopResultBuilder]: For program point L253(lines 253 329) no Hoare annotation was computed. [2022-04-07 11:27:05,872 INFO L882 garLoopResultBuilder]: For program point L187(lines 187 355) no Hoare annotation was computed. [2022-04-07 11:27:05,872 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-07 11:27:05,872 INFO L882 garLoopResultBuilder]: For program point L212(lines 212 346) no Hoare annotation was computed. [2022-04-07 11:27:05,872 INFO L882 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-04-07 11:27:05,872 INFO L882 garLoopResultBuilder]: For program point L47(lines 47 434) no Hoare annotation was computed. [2022-04-07 11:27:05,872 INFO L882 garLoopResultBuilder]: For program point L270(lines 270 322) no Hoare annotation was computed. [2022-04-07 11:27:05,872 INFO L882 garLoopResultBuilder]: For program point L204(lines 204 353) no Hoare annotation was computed. [2022-04-07 11:27:05,872 INFO L882 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point L262(lines 262 328) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point L386(line 386) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point L155(lines 155 360) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point L23(lines 23 438) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point L296(line 296) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point L65(lines 65 417) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point L123(lines 123 403) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point L272(line 272) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point L41(lines 41 435) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2022-04-07 11:27:05,873 INFO L882 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-04-07 11:27:05,874 INFO L882 garLoopResultBuilder]: For program point L372(lines 372 395) no Hoare annotation was computed. [2022-04-07 11:27:05,874 INFO L882 garLoopResultBuilder]: For program point L83(lines 83 414) no Hoare annotation was computed. [2022-04-07 11:27:05,874 INFO L882 garLoopResultBuilder]: For program point L306(lines 306 316) no Hoare annotation was computed. [2022-04-07 11:27:05,874 INFO L882 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2022-04-07 11:27:05,874 INFO L882 garLoopResultBuilder]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2022-04-07 11:27:05,874 INFO L882 garLoopResultBuilder]: For program point L224(lines 224 344) no Hoare annotation was computed. [2022-04-07 11:27:05,874 INFO L882 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-04-07 11:27:05,874 INFO L882 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-04-07 11:27:05,874 INFO L882 garLoopResultBuilder]: For program point L59(lines 59 432) no Hoare annotation was computed. [2022-04-07 11:27:05,874 INFO L878 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse8 (= 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~7 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse4 (< main_~main__cp~0 main_~main__urilen~0)) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 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 (<= 1 main_~__VERIFIER_assert__cond~4)) (.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 (< (+ main_~main__cp~0 1) main_~main__urilen~0) .cse9 .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 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse7 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) (or (and .cse8 .cse15) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse15))) (<= 1 main_~__VERIFIER_assert__cond~10)))) [2022-04-07 11:27:05,874 INFO L882 garLoopResultBuilder]: For program point L282(lines 282 320) no Hoare annotation was computed. [2022-04-07 11:27:05,874 INFO L882 garLoopResultBuilder]: For program point L241(lines 241 331) no Hoare annotation was computed. [2022-04-07 11:27:05,874 INFO L882 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2022-04-07 11:27:05,874 INFO L882 garLoopResultBuilder]: For program point L175(lines 175 357) no Hoare annotation was computed. [2022-04-07 11:27:05,874 INFO L882 garLoopResultBuilder]: For program point L35(lines 35 436) no Hoare annotation was computed. [2022-04-07 11:27:05,874 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 11:27:05,874 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-07 11:27:05,875 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 11:27:05,875 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 11:27:05,875 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 11:27:05,875 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 11:27:05,875 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 11:27:05,877 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:27:05,878 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 11:27:05,880 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 11:27:05,880 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 11:27:05,880 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-07 11:27:05,880 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-07 11:27:05,881 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-07 11:27:05,882 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-07 11:27:05,883 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-07 11:27:05,883 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-04-07 11:27:05,883 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-04-07 11:27:05,883 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-04-07 11:27:05,884 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-04-07 11:27:05,884 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-04-07 11:27:05,884 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-07 11:27:05,884 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-04-07 11:27:05,884 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-04-07 11:27:05,884 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-07 11:27:05,884 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-07 11:27:05,884 WARN L170 areAnnotationChecker]: L374 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L374 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L386 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L386 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2022-04-07 11:27:05,885 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2022-04-07 11:27:05,886 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2022-04-07 11:27:05,886 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2022-04-07 11:27:05,886 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-04-07 11:27:05,886 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-04-07 11:27:05,886 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-04-07 11:27:05,888 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-04-07 11:27:05,888 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-04-07 11:27:05,888 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2022-04-07 11:27:05,888 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2022-04-07 11:27:05,888 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2022-04-07 11:27:05,888 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2022-04-07 11:27:05,888 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2022-04-07 11:27:05,888 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2022-04-07 11:27:05,888 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2022-04-07 11:27:05,888 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2022-04-07 11:27:05,888 WARN L170 areAnnotationChecker]: L262 has no Hoare annotation [2022-04-07 11:27:05,888 WARN L170 areAnnotationChecker]: L262 has no Hoare annotation [2022-04-07 11:27:05,889 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2022-04-07 11:27:05,889 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2022-04-07 11:27:05,891 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-04-07 11:27:05,891 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-04-07 11:27:05,891 WARN L170 areAnnotationChecker]: L282 has no Hoare annotation [2022-04-07 11:27:05,891 WARN L170 areAnnotationChecker]: L282 has no Hoare annotation [2022-04-07 11:27:05,891 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2022-04-07 11:27:05,891 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2022-04-07 11:27:05,891 WARN L170 areAnnotationChecker]: L294 has no Hoare annotation [2022-04-07 11:27:05,891 WARN L170 areAnnotationChecker]: L294 has no Hoare annotation [2022-04-07 11:27:05,891 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-04-07 11:27:05,891 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-04-07 11:27:05,891 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2022-04-07 11:27:05,891 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2022-04-07 11:27:05,891 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-04-07 11:27:05,891 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-04-07 11:27:05,891 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 11:27:05,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:27:05 BoogieIcfgContainer [2022-04-07 11:27:05,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 11:27:05,912 INFO L158 Benchmark]: Toolchain (without parser) took 65217.94ms. Allocated memory was 186.6MB in the beginning and 389.0MB in the end (delta: 202.4MB). Free memory was 136.0MB in the beginning and 183.8MB in the end (delta: -47.8MB). Peak memory consumption was 210.0MB. Max. memory is 8.0GB. [2022-04-07 11:27:05,912 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 11:27:05,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.51ms. Allocated memory is still 186.6MB. Free memory was 135.8MB in the beginning and 150.8MB in the end (delta: -15.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-07 11:27:05,912 INFO L158 Benchmark]: Boogie Preprocessor took 39.99ms. Allocated memory is still 186.6MB. Free memory was 150.8MB in the beginning and 148.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 11:27:05,913 INFO L158 Benchmark]: RCFGBuilder took 364.80ms. Allocated memory is still 186.6MB. Free memory was 148.9MB in the beginning and 130.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-04-07 11:27:05,913 INFO L158 Benchmark]: TraceAbstraction took 64539.39ms. Allocated memory was 186.6MB in the beginning and 389.0MB in the end (delta: 202.4MB). Free memory was 129.4MB in the beginning and 183.8MB in the end (delta: -54.4MB). Peak memory consumption was 203.8MB. Max. memory is 8.0GB. [2022-04-07 11:27:05,913 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.09ms. Allocated memory is still 186.6MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.51ms. Allocated memory is still 186.6MB. Free memory was 135.8MB in the beginning and 150.8MB in the end (delta: -15.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.99ms. Allocated memory is still 186.6MB. Free memory was 150.8MB in the beginning and 148.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 364.80ms. Allocated memory is still 186.6MB. Free memory was 148.9MB in the beginning and 130.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 64539.39ms. Allocated memory was 186.6MB in the beginning and 389.0MB in the end (delta: 202.4MB). Free memory was 129.4MB in the beginning and 183.8MB in the end (delta: -54.4MB). Peak memory consumption was 203.8MB. 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: 64.5s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 51.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3687 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3687 mSDsluCounter, 1690 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 365 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2571 IncrementalHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 1325 mSDtfsCounter, 2571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 269 SyntacticMatches, 18 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.3s 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: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 296 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 732 HoareAnnotationTreeSize, 9 FomulaSimplifications, 75971 FormulaSimplificationTreeSizeReduction, 51.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 370060 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 2199 SizeOfPredicates, 12 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (\old(__return_375) == __return_375 && __VERIFIER_assert__cond == 1) && ((((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__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 + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__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) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)) && main__c == 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 == 1) && !(__VERIFIER_assert__cond == 0)) && !(__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) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__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) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)))) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (main__cp < main__urilen && \old(__return_375) == __return_375) && ((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && 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))) - 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)) && 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) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) || (((main__c == 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)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) || (((((((((((((((__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)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__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)) && 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) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) || (((((((((((((((__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)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0))))) && 1 <= __VERIFIER_assert__cond) RESULT: Ultimate proved your program to be correct! [2022-04-07 11:27:05,946 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...