/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.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 17:00:03,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:00:03,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:00:03,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:00:03,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:00:03,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:00:03,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:00:03,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:00:03,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:00:03,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:00:03,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:00:03,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:00:03,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:00:03,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:00:03,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:00:03,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:00:03,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:00:03,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:00:03,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:00:03,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:00:03,859 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:00:03,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:00:03,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:00:03,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:00:03,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:00:03,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:00:03,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:00:03,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:00:03,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:00:03,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:00:03,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:00:03,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:00:03,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:00:03,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:00:03,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:00:03,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:00:03,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:00:03,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:00:03,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:00:03,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:00:03,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:00:03,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:00:03,876 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:00:03,882 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:00:03,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:00:03,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:00:03,883 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:00:03,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:00:03,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:00:03,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:00:03,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:00:03,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:00:03,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:00:03,884 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:00:03,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:00:03,884 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:00:03,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:00:03,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:00:03,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:00:03,884 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:00:03,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:00:03,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:00:03,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:00:03,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:00:03,886 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:00:03,886 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 17:00:04,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:00:04,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:00:04,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:00:04,078 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:00:04,079 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:00:04,080 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 17:00:04,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25529d99/5226b7a77fcd4eed8618bf15de22ecc7/FLAGa8e05810c [2022-04-07 17:00:04,470 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:00:04,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-04-07 17:00:04,478 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25529d99/5226b7a77fcd4eed8618bf15de22ecc7/FLAGa8e05810c [2022-04-07 17:00:04,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25529d99/5226b7a77fcd4eed8618bf15de22ecc7 [2022-04-07 17:00:04,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:00:04,882 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:00:04,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:00:04,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:00:04,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:00:04,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:00:04" (1/1) ... [2022-04-07 17:00:04,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f3d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:00:04, skipping insertion in model container [2022-04-07 17:00:04,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:00:04" (1/1) ... [2022-04-07 17:00:04,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:00:04,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:00:05,064 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 17:00:05,067 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 17:00:05,069 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 17:00:05,070 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 17:00:05,071 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 17:00:05,072 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 17:00:05,074 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 17:00:05,075 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 17:00:05,077 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 17:00:05,078 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 17:00:05,079 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 17:00:05,080 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 17:00:05,083 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 17:00:05,098 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 17:00:05,100 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 17:00:05,101 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 17:00:05,103 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 17:00:05,104 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 17:00:05,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:00:05,116 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:00:05,141 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 17:00:05,143 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 17:00:05,144 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 17:00:05,145 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 17:00:05,156 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 17:00:05,157 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 17:00:05,159 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 17:00:05,160 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 17:00:05,161 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 17:00:05,162 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 17:00:05,163 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 17:00:05,164 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 17:00:05,166 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 17:00:05,166 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 17:00:05,167 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 17:00:05,168 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 17:00:05,170 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 17:00:05,171 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 17:00:05,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:00:05,195 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:00:05,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:00:05 WrapperNode [2022-04-07 17:00:05,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:00:05,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:00:05,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:00:05,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:00:05,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:00:05" (1/1) ... [2022-04-07 17:00:05,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:00:05" (1/1) ... [2022-04-07 17:00:05,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:00:05" (1/1) ... [2022-04-07 17:00:05,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:00:05" (1/1) ... [2022-04-07 17:00:05,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:00:05" (1/1) ... [2022-04-07 17:00:05,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:00:05" (1/1) ... [2022-04-07 17:00:05,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:00:05" (1/1) ... [2022-04-07 17:00:05,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:00:05,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:00:05,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:00:05,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:00:05,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:00:05" (1/1) ... [2022-04-07 17:00:05,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:00:05,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:00:05,279 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 17:00:05,303 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 17:00:05,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:00:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:00:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:00:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 17:00:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:00:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:00:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:00:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:00:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:00:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 17:00:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:00:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 17:00:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:00:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:00:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:00:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:00:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:00:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:00:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:00:05,439 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:00:05,440 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:00:05,704 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:00:05,709 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:00:05,709 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-07 17:00:05,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:00:05 BoogieIcfgContainer [2022-04-07 17:00:05,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:00:05,711 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:00:05,711 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:00:05,712 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:00:05,714 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:00:05" (1/1) ... [2022-04-07 17:00:05,715 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:00:05,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:00:05 BasicIcfg [2022-04-07 17:00:05,772 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:00:05,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:00:05,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:00:05,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:00:05,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:00:04" (1/4) ... [2022-04-07 17:00:05,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8a269e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:00:05, skipping insertion in model container [2022-04-07 17:00:05,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:00:05" (2/4) ... [2022-04-07 17:00:05,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8a269e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:00:05, skipping insertion in model container [2022-04-07 17:00:05,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:00:05" (3/4) ... [2022-04-07 17:00:05,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8a269e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:00:05, skipping insertion in model container [2022-04-07 17:00:05,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:00:05" (4/4) ... [2022-04-07 17:00:05,778 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.cJordan [2022-04-07 17:00:05,784 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:00:05,784 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-04-07 17:00:05,810 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:00:05,813 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 17:00:05,814 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-04-07 17:00:05,826 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 17:00:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 17:00:05,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:05,831 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 17:00:05,831 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 17:00:05,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash 317693851, now seen corresponding path program 1 times [2022-04-07 17:00:05,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:05,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164918675] [2022-04-07 17:00:05,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:05,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:06,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:06,063 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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {90#true} is VALID [2022-04-07 17:00:06,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:00:06,063 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:00:06,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {90#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {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 17:00:06,066 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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {90#true} is VALID [2022-04-07 17:00:06,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:00:06,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:00:06,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:00:06,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {90#true} is VALID [2022-04-07 17:00:06,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:00:06,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {90#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:00:06,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {90#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:00:06,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {90#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:00:06,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {90#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:00:06,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {90#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:00:06,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {90#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:00:06,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {90#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:00:06,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {90#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:00:06,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {90#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:00:06,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {90#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {95#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-07 17:00:06,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {95#(not (= main_~__VERIFIER_assert__cond~0 0))} [257] L83-->L85: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-07 17:00:06,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {91#false} [259] L85-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-07 17:00:06,073 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 17:00:06,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:06,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164918675] [2022-04-07 17:00:06,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164918675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:06,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:06,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 17:00:06,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873023946] [2022-04-07 17:00:06,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:06,082 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 17:00:06,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:06,087 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 17:00:06,127 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 17:00:06,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 17:00:06,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:06,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 17:00:06,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 17:00:06,149 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 17:00:06,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:06,394 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2022-04-07 17:00:06,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 17:00:06,395 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 17:00:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:06,399 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 17:00:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2022-04-07 17:00:06,407 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 17:00:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2022-04-07 17:00:06,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 124 transitions. [2022-04-07 17:00:06,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:06,547 INFO L225 Difference]: With dead ends: 87 [2022-04-07 17:00:06,547 INFO L226 Difference]: Without dead ends: 80 [2022-04-07 17:00:06,549 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 17:00:06,555 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 170 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:00:06,558 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.0s Time] [2022-04-07 17:00:06,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-07 17:00:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-07 17:00:06,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:06,588 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 17:00:06,590 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 17:00:06,591 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 17:00:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:06,598 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-07 17:00:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-07 17:00:06,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:06,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:06,599 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 17:00:06,600 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 17:00:06,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:06,611 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-07 17:00:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-07 17:00:06,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:06,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:06,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:06,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:06,613 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 17:00:06,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-04-07 17:00:06,624 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2022-04-07 17:00:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:06,624 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-04-07 17:00:06,624 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 17:00:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-07 17:00:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 17:00:06,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:06,626 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 17:00:06,626 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:00:06,626 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 17:00:06,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:06,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1258576075, now seen corresponding path program 1 times [2022-04-07 17:00:06,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:06,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357435202] [2022-04-07 17:00:06,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:06,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:06,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:06,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {428#true} is VALID [2022-04-07 17:00:06,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-07 17:00:06,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {428#true} {428#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-07 17:00:06,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {437#(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 17:00:06,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {428#true} is VALID [2022-04-07 17:00:06,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-07 17:00:06,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-07 17:00:06,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-07 17:00:06,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {428#true} is VALID [2022-04-07 17:00:06,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-07 17:00:06,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-07 17:00:06,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {428#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-07 17:00:06,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {428#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-07 17:00:06,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {428#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-07 17:00:06,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {428#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-07 17:00:06,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-07 17:00:06,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {428#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-07 17:00:06,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {428#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {433#(< 0 (+ main_~main__scheme~0 1))} is VALID [2022-04-07 17:00:06,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {433#(< 0 (+ main_~main__scheme~0 1))} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {434#(not (<= main_~main__scheme~0 0))} is VALID [2022-04-07 17:00:06,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#(not (<= main_~main__scheme~0 0))} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {435#(<= 1 main_~main__cp~0)} is VALID [2022-04-07 17:00:06,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {435#(<= 1 main_~main__cp~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {436#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-07 17:00:06,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {436#(not (= main_~__VERIFIER_assert__cond~1 0))} [261] L95-->L97: Formula: (= v_main_~__VERIFIER_assert__cond~1_3 0) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} AuxVars[] AssignedVars[] {429#false} is VALID [2022-04-07 17:00:06,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {429#false} [263] L97-->mainErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {429#false} is VALID [2022-04-07 17:00:06,778 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 17:00:06,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:06,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357435202] [2022-04-07 17:00:06,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357435202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:06,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:06,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 17:00:06,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851189074] [2022-04-07 17:00:06,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:06,780 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 17:00:06,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:06,780 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 17:00:06,792 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 17:00:06,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 17:00:06,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:06,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 17:00:06,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-07 17:00:06,793 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 17:00:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:07,062 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-07 17:00:07,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:00:07,062 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 17:00:07,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:07,063 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 17:00:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-07 17:00:07,064 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 17:00:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-07 17:00:07,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2022-04-07 17:00:07,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:07,136 INFO L225 Difference]: With dead ends: 78 [2022-04-07 17:00:07,136 INFO L226 Difference]: Without dead ends: 78 [2022-04-07 17:00:07,136 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 17:00:07,137 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 17:00:07,137 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 17:00:07,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-07 17:00:07,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-07 17:00:07,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:07,141 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 17:00:07,141 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 17:00:07,141 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 17:00:07,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:07,143 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-07 17:00:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-07 17:00:07,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:07,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:07,144 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 17:00:07,144 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 17:00:07,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:07,146 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-07 17:00:07,146 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-07 17:00:07,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:07,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:07,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:07,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:07,147 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 17:00:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-07 17:00:07,148 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2022-04-07 17:00:07,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:07,149 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-07 17:00:07,149 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 17:00:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-07 17:00:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 17:00:07,149 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:07,149 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 17:00:07,149 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 17:00:07,150 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 17:00:07,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:07,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1689129137, now seen corresponding path program 1 times [2022-04-07 17:00:07,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:07,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178808002] [2022-04-07 17:00:07,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:07,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:07,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:07,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {767#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {760#true} is VALID [2022-04-07 17:00:07,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-07 17:00:07,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {760#true} {760#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-07 17:00:07,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {760#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {767#(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 17:00:07,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {767#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {760#true} is VALID [2022-04-07 17:00:07,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-07 17:00:07,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-07 17:00:07,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {760#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-07 17:00:07,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {760#true} is VALID [2022-04-07 17:00:07,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {760#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-07 17:00:07,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-07 17:00:07,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {760#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-07 17:00:07,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {760#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-07 17:00:07,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {760#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-07 17:00:07,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {760#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-07 17:00:07,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {760#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-07 17:00:07,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {760#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-07 17:00:07,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {760#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-07 17:00:07,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-07 17:00:07,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {760#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {765#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:07,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {765#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {765#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:07,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {765#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {765#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:07,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {765#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {766#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-07 17:00:07,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {766#(not (= main_~__VERIFIER_assert__cond~2 0))} [267] L111-->L113: Formula: (= v_main_~__VERIFIER_assert__cond~2_3 0) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_3} OutVars{main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_3} AuxVars[] AssignedVars[] {761#false} is VALID [2022-04-07 17:00:07,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {761#false} [270] L113-->mainErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {761#false} is VALID [2022-04-07 17:00:07,233 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 17:00:07,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:07,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178808002] [2022-04-07 17:00:07,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178808002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:07,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:07,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 17:00:07,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108926493] [2022-04-07 17:00:07,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:07,234 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 17:00:07,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:07,234 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 17:00:07,247 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 17:00:07,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 17:00:07,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:07,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 17:00:07,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 17:00:07,248 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 17:00:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:07,507 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-07 17:00:07,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:00:07,507 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 17:00:07,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:07,508 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 17:00:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-04-07 17:00:07,509 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 17:00:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-04-07 17:00:07,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 105 transitions. [2022-04-07 17:00:07,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:07,613 INFO L225 Difference]: With dead ends: 99 [2022-04-07 17:00:07,613 INFO L226 Difference]: Without dead ends: 99 [2022-04-07 17:00:07,613 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 17:00:07,615 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 17:00:07,615 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 17:00:07,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-07 17:00:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2022-04-07 17:00:07,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:07,618 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 17:00:07,618 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 17:00:07,619 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 17:00:07,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:07,621 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-07 17:00:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-07 17:00:07,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:07,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:07,621 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 17:00:07,622 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 17:00:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:07,624 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-07 17:00:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-07 17:00:07,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:07,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:07,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:07,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:07,624 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 17:00:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-07 17:00:07,626 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2022-04-07 17:00:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:07,626 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-07 17:00:07,626 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 17:00:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-07 17:00:07,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 17:00:07,627 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:07,627 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 17:00:07,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 17:00:07,627 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 17:00:07,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:07,627 INFO L85 PathProgramCache]: Analyzing trace with hash -823394398, now seen corresponding path program 1 times [2022-04-07 17:00:07,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:07,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126416687] [2022-04-07 17:00:07,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:07,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:07,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:07,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {1157#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {1149#true} is VALID [2022-04-07 17:00:07,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-07 17:00:07,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1149#true} {1149#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-07 17:00:07,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1157#(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 17:00:07,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {1157#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {1149#true} is VALID [2022-04-07 17:00:07,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {1149#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-07 17:00:07,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1149#true} {1149#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-07 17:00:07,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {1149#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-07 17:00:07,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {1149#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {1149#true} is VALID [2022-04-07 17:00:07,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {1149#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-07 17:00:07,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {1149#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-07 17:00:07,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {1149#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-07 17:00:07,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {1149#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-07 17:00:07,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {1149#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-07 17:00:07,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {1149#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-07 17:00:07,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {1149#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-07 17:00:07,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {1149#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-07 17:00:07,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {1149#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {1154#(<= 0 main_~main__scheme~0)} is VALID [2022-04-07 17:00:07,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {1154#(<= 0 main_~main__scheme~0)} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {1154#(<= 0 main_~main__scheme~0)} is VALID [2022-04-07 17:00:07,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {1154#(<= 0 main_~main__scheme~0)} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {1155#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:07,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {1155#(<= 0 main_~main__cp~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {1155#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:07,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {1155#(<= 0 main_~main__cp~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {1155#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:07,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {1155#(<= 0 main_~main__cp~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {1155#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:07,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {1155#(<= 0 main_~main__cp~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {1156#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-07 17:00:07,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {1156#(not (= main_~__VERIFIER_assert__cond~3 0))} [272] L123-->L125: Formula: (= v_main_~__VERIFIER_assert__cond~3_3 0) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_3} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_3} AuxVars[] AssignedVars[] {1150#false} is VALID [2022-04-07 17:00:07,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {1150#false} [274] L125-->mainErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1150#false} is VALID [2022-04-07 17:00:07,681 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 17:00:07,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:07,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126416687] [2022-04-07 17:00:07,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126416687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:07,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:07,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:00:07,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155497845] [2022-04-07 17:00:07,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:07,682 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 17:00:07,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:07,682 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 17:00:07,693 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 17:00:07,693 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:00:07,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:07,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:00:07,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:00:07,694 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 17:00:07,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:07,890 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-07 17:00:07,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:00:07,890 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 17:00:07,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:07,890 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 17:00:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-07 17:00:07,892 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 17:00:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-07 17:00:07,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-07 17:00:07,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:07,957 INFO L225 Difference]: With dead ends: 74 [2022-04-07 17:00:07,957 INFO L226 Difference]: Without dead ends: 74 [2022-04-07 17:00:07,958 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 17:00:07,958 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 17:00:07,959 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 17:00:07,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-07 17:00:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-07 17:00:07,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:07,961 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 17:00:07,962 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 17:00:07,962 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 17:00:07,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:07,963 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-07 17:00:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-07 17:00:07,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:07,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:07,968 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 17:00:07,968 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 17:00:07,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:07,969 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-07 17:00:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-07 17:00:07,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:07,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:07,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:07,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:07,973 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 17:00:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-04-07 17:00:07,974 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2022-04-07 17:00:07,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:07,975 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-04-07 17:00:07,975 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 17:00:07,975 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-07 17:00:07,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 17:00:07,975 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:07,975 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 17:00:07,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 17:00:07,975 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 17:00:07,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1183023144, now seen corresponding path program 1 times [2022-04-07 17:00:07,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:07,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452989829] [2022-04-07 17:00:07,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:07,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:08,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:08,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {1470#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {1462#true} is VALID [2022-04-07 17:00:08,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {1462#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-07 17:00:08,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1462#true} {1462#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-07 17:00:08,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {1462#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1470#(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 17:00:08,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {1470#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {1462#true} is VALID [2022-04-07 17:00:08,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {1462#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-07 17:00:08,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1462#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-07 17:00:08,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {1462#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-07 17:00:08,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {1462#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {1462#true} is VALID [2022-04-07 17:00:08,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {1462#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-07 17:00:08,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {1462#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-07 17:00:08,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {1462#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-07 17:00:08,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {1462#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-07 17:00:08,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {1462#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-07 17:00:08,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {1462#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-07 17:00:08,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {1462#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-07 17:00:08,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {1462#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-07 17:00:08,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {1462#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-07 17:00:08,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {1462#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-07 17:00:08,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {1462#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {1462#true} is VALID [2022-04-07 17:00:08,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {1462#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {1462#true} is VALID [2022-04-07 17:00:08,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {1462#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {1462#true} is VALID [2022-04-07 17:00:08,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {1462#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {1467#(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 17:00:08,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {1467#(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)))} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {1468#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:08,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {1468#(not (<= main_~main__urilen~0 main_~main__cp~0))} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {1468#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:08,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {1468#(not (<= main_~main__urilen~0 main_~main__cp~0))} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {1468#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:08,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {1468#(not (<= main_~main__urilen~0 main_~main__cp~0))} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {1469#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-07 17:00:08,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {1469#(not (= main_~__VERIFIER_assert__cond~16 0))} [281] L372-->L374: Formula: (= v_main_~__VERIFIER_assert__cond~16_3 0) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} AuxVars[] AssignedVars[] {1463#false} is VALID [2022-04-07 17:00:08,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {1463#false} [285] L374-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1463#false} is VALID [2022-04-07 17:00:08,074 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 17:00:08,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:08,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452989829] [2022-04-07 17:00:08,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452989829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:08,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:08,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:00:08,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627273594] [2022-04-07 17:00:08,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:08,075 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 17:00:08,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:08,076 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 17:00:08,096 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 17:00:08,096 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:00:08,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:08,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:00:08,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:00:08,097 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 17:00:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:08,678 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-07 17:00:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 17:00:08,678 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 17:00:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:08,679 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 17:00:08,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2022-04-07 17:00:08,681 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 17:00:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2022-04-07 17:00:08,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 146 transitions. [2022-04-07 17:00:08,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:08,804 INFO L225 Difference]: With dead ends: 139 [2022-04-07 17:00:08,804 INFO L226 Difference]: Without dead ends: 139 [2022-04-07 17:00:08,805 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 17:00:08,805 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 17:00:08,806 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 17:00:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-07 17:00:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2022-04-07 17:00:08,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:08,809 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 17:00:08,809 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 17:00:08,810 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 17:00:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:08,813 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-07 17:00:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-07 17:00:08,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:08,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:08,814 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 17:00:08,814 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 17:00:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:08,817 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-07 17:00:08,817 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-07 17:00:08,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:08,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:08,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:08,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:08,818 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 17:00:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-07 17:00:08,820 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2022-04-07 17:00:08,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:08,820 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-07 17:00:08,820 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 17:00:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-07 17:00:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 17:00:08,820 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:08,821 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 17:00:08,821 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 17:00:08,821 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 17:00:08,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:08,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1182992326, now seen corresponding path program 1 times [2022-04-07 17:00:08,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:08,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874426575] [2022-04-07 17:00:08,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:08,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:08,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:08,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {1985#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {1977#true} is VALID [2022-04-07 17:00:08,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {1977#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-07 17:00:08,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1977#true} {1977#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-07 17:00:08,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {1977#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1985#(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 17:00:08,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {1985#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {1977#true} is VALID [2022-04-07 17:00:08,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {1977#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-07 17:00:08,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1977#true} {1977#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-07 17:00:08,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {1977#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-07 17:00:08,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {1977#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {1977#true} is VALID [2022-04-07 17:00:08,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {1977#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-07 17:00:08,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {1977#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-07 17:00:08,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {1977#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-07 17:00:08,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {1977#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-07 17:00:08,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {1977#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-07 17:00:08,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {1977#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-07 17:00:08,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {1977#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-07 17:00:08,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {1977#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-07 17:00:08,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {1977#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-07 17:00:08,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {1977#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-07 17:00:08,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {1977#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {1977#true} is VALID [2022-04-07 17:00:08,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {1977#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {1977#true} is VALID [2022-04-07 17:00:08,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {1977#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {1977#true} is VALID [2022-04-07 17:00:08,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {1977#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {1982#(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 17:00:08,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {1982#(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)))} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {1983#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:08,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {1983#(not (<= main_~main__urilen~0 main_~main__cp~0))} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {1983#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:08,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {1983#(not (<= main_~main__urilen~0 main_~main__cp~0))} [277] L392-->L401: Formula: (= v_main_~main__cp~0_29 (+ (- 1) v_main_~main__urilen~0_24)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_24, main_~main__cp~0=v_main_~main__cp~0_29} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_24, main_~main__cp~0=v_main_~main__cp~0_29} AuxVars[] AssignedVars[] {1983#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:08,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {1983#(not (<= main_~main__urilen~0 main_~main__cp~0))} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {1984#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-07 17:00:08,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {1984#(not (= main_~__VERIFIER_assert__cond~4 0))} [283] L143-->L145: Formula: (= v_main_~__VERIFIER_assert__cond~4_3 0) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} OutVars{main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} AuxVars[] AssignedVars[] {1978#false} is VALID [2022-04-07 17:00:08,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {1978#false} [289] L145-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1978#false} is VALID [2022-04-07 17:00:08,911 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 17:00:08,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:08,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874426575] [2022-04-07 17:00:08,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874426575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:08,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:08,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:00:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81969303] [2022-04-07 17:00:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:08,912 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 17:00:08,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:08,913 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 17:00:08,931 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 17:00:08,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:00:08,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:08,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:00:08,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:00:08,933 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 17:00:09,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:09,381 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-07 17:00:09,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 17:00:09,381 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 17:00:09,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:09,381 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 17:00:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2022-04-07 17:00:09,383 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 17:00:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2022-04-07 17:00:09,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 113 transitions. [2022-04-07 17:00:09,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:09,486 INFO L225 Difference]: With dead ends: 106 [2022-04-07 17:00:09,486 INFO L226 Difference]: Without dead ends: 106 [2022-04-07 17:00:09,486 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 17:00:09,487 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 17:00:09,487 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 17:00:09,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-07 17:00:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2022-04-07 17:00:09,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:09,490 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 17:00:09,491 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 17:00:09,491 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 17:00:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:09,493 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-07 17:00:09,493 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-07 17:00:09,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:09,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:09,494 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 17:00:09,494 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 17:00:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:09,497 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-07 17:00:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-07 17:00:09,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:09,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:09,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:09,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:09,497 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 17:00:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-04-07 17:00:09,499 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2022-04-07 17:00:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:09,499 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-04-07 17:00:09,499 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 17:00:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-07 17:00:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 17:00:09,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:09,500 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 17:00:09,500 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 17:00:09,500 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 17:00:09,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:09,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1980989516, now seen corresponding path program 1 times [2022-04-07 17:00:09,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:09,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063104011] [2022-04-07 17:00:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:09,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:09,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:09,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {2404#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {2396#true} is VALID [2022-04-07 17:00:09,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {2396#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-07 17:00:09,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2396#true} {2396#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-07 17:00:09,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2404#(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 17:00:09,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {2404#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {2396#true} is VALID [2022-04-07 17:00:09,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {2396#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-07 17:00:09,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2396#true} {2396#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-07 17:00:09,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {2396#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-07 17:00:09,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {2396#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {2396#true} is VALID [2022-04-07 17:00:09,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {2396#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-07 17:00:09,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {2396#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-07 17:00:09,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {2396#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-07 17:00:09,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {2396#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-07 17:00:09,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {2396#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-07 17:00:09,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {2396#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-07 17:00:09,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {2396#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-07 17:00:09,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {2396#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-07 17:00:09,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {2396#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-07 17:00:09,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {2396#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-07 17:00:09,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {2396#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {2396#true} is VALID [2022-04-07 17:00:09,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {2396#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {2396#true} is VALID [2022-04-07 17:00:09,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {2396#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {2396#true} is VALID [2022-04-07 17:00:09,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {2396#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {2396#true} is VALID [2022-04-07 17:00:09,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {2396#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {2401#(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 17:00:09,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {2401#(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)))} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {2402#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:09,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {2402#(<= 0 main_~main__cp~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {2402#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:09,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {2402#(<= 0 main_~main__cp~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {2402#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:09,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {2402#(<= 0 main_~main__cp~0)} [282] L372-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= v_main_~__tmp_18~0_1 (ite (<= 0 v_main_~main__cp~0_26) 1 0))) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__cp~0=v_main_~main__cp~0_26} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1, main_~main__cp~0=v_main_~main__cp~0_26} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {2403#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-07 17:00:09,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {2403#(not (= main_~__VERIFIER_assert__cond~17 0))} [287] L384-->L386: Formula: (= v_main_~__VERIFIER_assert__cond~17_3 0) InVars {main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_3} OutVars{main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_3} AuxVars[] AssignedVars[] {2397#false} is VALID [2022-04-07 17:00:09,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} [293] L386-->mainErr17ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2397#false} is VALID [2022-04-07 17:00:09,590 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 17:00:09,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:09,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063104011] [2022-04-07 17:00:09,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063104011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:09,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:09,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:00:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568712664] [2022-04-07 17:00:09,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:09,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 17:00:09,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:09,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 17:00:09,606 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 17:00:09,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:00:09,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:09,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:00:09,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:00:09,607 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 17:00:09,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:09,967 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-07 17:00:09,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:00:09,967 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 17:00:09,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:09,967 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 17:00:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-07 17:00:09,969 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 17:00:09,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-07 17:00:09,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2022-04-07 17:00:10,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:10,071 INFO L225 Difference]: With dead ends: 119 [2022-04-07 17:00:10,071 INFO L226 Difference]: Without dead ends: 119 [2022-04-07 17:00:10,072 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 17:00:10,072 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 17:00:10,073 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 17:00:10,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-07 17:00:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2022-04-07 17:00:10,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:10,076 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 17:00:10,076 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 17:00:10,076 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 17:00:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:10,079 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-07 17:00:10,079 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-07 17:00:10,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:10,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:10,080 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 17:00:10,080 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 17:00:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:10,082 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-07 17:00:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-07 17:00:10,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:10,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:10,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:10,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:10,083 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 17:00:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-07 17:00:10,085 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2022-04-07 17:00:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:10,085 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-07 17:00:10,085 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 17:00:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-07 17:00:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 17:00:10,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:10,086 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 17:00:10,086 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 17:00:10,086 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 17:00:10,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:10,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1981944876, now seen corresponding path program 1 times [2022-04-07 17:00:10,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:10,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643339639] [2022-04-07 17:00:10,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:10,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:10,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:10,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {2855#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {2847#true} is VALID [2022-04-07 17:00:10,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {2847#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-07 17:00:10,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2847#true} {2847#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-07 17:00:10,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {2847#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2855#(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 17:00:10,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {2855#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {2847#true} is VALID [2022-04-07 17:00:10,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {2847#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-07 17:00:10,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2847#true} {2847#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-07 17:00:10,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {2847#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-07 17:00:10,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {2847#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {2847#true} is VALID [2022-04-07 17:00:10,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {2847#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-07 17:00:10,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {2847#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-07 17:00:10,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {2847#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-07 17:00:10,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {2847#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-07 17:00:10,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {2847#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-07 17:00:10,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {2847#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-07 17:00:10,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {2847#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-07 17:00:10,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {2847#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-07 17:00:10,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {2847#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-07 17:00:10,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {2847#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-07 17:00:10,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {2847#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {2847#true} is VALID [2022-04-07 17:00:10,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {2847#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {2847#true} is VALID [2022-04-07 17:00:10,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {2847#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {2847#true} is VALID [2022-04-07 17:00:10,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {2847#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {2847#true} is VALID [2022-04-07 17:00:10,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {2847#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {2852#(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 17:00:10,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {2852#(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)))} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {2853#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:10,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {2853#(<= 0 main_~main__cp~0)} [277] L392-->L401: Formula: (= v_main_~main__cp~0_29 (+ (- 1) v_main_~main__urilen~0_24)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_24, main_~main__cp~0=v_main_~main__cp~0_29} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_24, main_~main__cp~0=v_main_~main__cp~0_29} AuxVars[] AssignedVars[] {2853#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:10,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {2853#(<= 0 main_~main__cp~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {2853#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:10,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {2853#(<= 0 main_~main__cp~0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {2854#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-07 17:00:10,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {2854#(not (= main_~__VERIFIER_assert__cond~5 0))} [291] L155-->L157: Formula: (= v_main_~__VERIFIER_assert__cond~5_3 0) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_3} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_3} AuxVars[] AssignedVars[] {2848#false} is VALID [2022-04-07 17:00:10,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {2848#false} [295] L157-->mainErr5ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2848#false} is VALID [2022-04-07 17:00:10,151 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 17:00:10,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:10,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643339639] [2022-04-07 17:00:10,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643339639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:10,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:10,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:00:10,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742540503] [2022-04-07 17:00:10,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:10,152 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 17:00:10,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:10,152 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 17:00:10,166 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 17:00:10,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:00:10,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:10,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:00:10,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:00:10,167 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 17:00:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:10,418 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-07 17:00:10,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:00:10,418 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 17:00:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:10,418 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 17:00:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-07 17:00:10,419 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 17:00:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-07 17:00:10,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-07 17:00:10,478 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 17:00:10,479 INFO L225 Difference]: With dead ends: 75 [2022-04-07 17:00:10,479 INFO L226 Difference]: Without dead ends: 75 [2022-04-07 17:00:10,480 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 17:00:10,480 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 17:00:10,480 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 17:00:10,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-07 17:00:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-07 17:00:10,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:10,482 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 17:00:10,482 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 17:00:10,482 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 17:00:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:10,484 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-07 17:00:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-07 17:00:10,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:10,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:10,484 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 17:00:10,484 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 17:00:10,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:10,486 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-07 17:00:10,486 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-07 17:00:10,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:10,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:10,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:10,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:10,486 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 17:00:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-04-07 17:00:10,487 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2022-04-07 17:00:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:10,487 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-04-07 17:00:10,488 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 17:00:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-07 17:00:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 17:00:10,488 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:10,488 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 17:00:10,488 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 17:00:10,488 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 17:00:10,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1978555952, now seen corresponding path program 1 times [2022-04-07 17:00:10,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:10,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090316147] [2022-04-07 17:00:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:10,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:10,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {3170#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3164#true} is VALID [2022-04-07 17:00:10,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {3164#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3164#true} {3164#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {3164#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3170#(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 17:00:10,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {3170#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3164#true} is VALID [2022-04-07 17:00:10,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {3164#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3164#true} {3164#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {3164#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {3164#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {3164#true} is VALID [2022-04-07 17:00:10,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {3164#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {3164#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {3164#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {3164#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {3164#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {3164#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {3164#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {3164#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {3164#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {3164#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {3164#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {3164#true} is VALID [2022-04-07 17:00:10,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {3164#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3164#true} is VALID [2022-04-07 17:00:10,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {3164#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {3164#true} is VALID [2022-04-07 17:00:10,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {3164#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {3164#true} is VALID [2022-04-07 17:00:10,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {3164#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {3164#true} is VALID [2022-04-07 17:00:10,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {3164#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-07 17:00:10,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {3164#true} [277] L392-->L401: Formula: (= v_main_~main__cp~0_29 (+ (- 1) v_main_~main__urilen~0_24)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_24, main_~main__cp~0=v_main_~main__cp~0_29} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_24, main_~main__cp~0=v_main_~main__cp~0_29} AuxVars[] AssignedVars[] {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-07 17:00:10,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-07 17:00:10,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-07 17:00:10,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-07 17:00:10,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {3165#false} is VALID [2022-04-07 17:00:10,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {3165#false} [299] L175-->L177: Formula: (= v_main_~__VERIFIER_assert__cond~6_3 0) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} OutVars{main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} AuxVars[] AssignedVars[] {3165#false} is VALID [2022-04-07 17:00:10,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {3165#false} [301] L177-->mainErr6ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3165#false} is VALID [2022-04-07 17:00:10,524 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 17:00:10,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:10,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090316147] [2022-04-07 17:00:10,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090316147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:10,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:10,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 17:00:10,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332986127] [2022-04-07 17:00:10,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:10,525 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 17:00:10,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:10,525 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 17:00:10,539 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 17:00:10,539 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 17:00:10,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:10,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 17:00:10,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 17:00:10,540 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 17:00:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:10,689 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-04-07 17:00:10,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 17:00:10,689 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 17:00:10,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:10,689 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 17:00:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-04-07 17:00:10,690 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 17:00:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-04-07 17:00:10,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2022-04-07 17:00:10,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:10,758 INFO L225 Difference]: With dead ends: 79 [2022-04-07 17:00:10,759 INFO L226 Difference]: Without dead ends: 75 [2022-04-07 17:00:10,759 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 17:00:10,759 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:00:10,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 78 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:00:10,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-07 17:00:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-07 17:00:10,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:10,762 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 17:00:10,762 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 17:00:10,762 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 17:00:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:10,764 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-07 17:00:10,764 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-07 17:00:10,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:10,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:10,764 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 17:00:10,764 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 17:00:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:10,766 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-07 17:00:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-07 17:00:10,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:10,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:10,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:10,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:10,766 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 17:00:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-04-07 17:00:10,767 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2022-04-07 17:00:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:10,768 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-04-07 17:00:10,768 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 17:00:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-07 17:00:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 17:00:10,768 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:10,768 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 17:00:10,768 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 17:00:10,768 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 17:00:10,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:10,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1860757727, now seen corresponding path program 1 times [2022-04-07 17:00:10,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:10,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643143670] [2022-04-07 17:00:10,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:10,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:10,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:10,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {3487#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3479#true} is VALID [2022-04-07 17:00:10,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {3479#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-07 17:00:10,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3479#true} {3479#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-07 17:00:10,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {3479#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3487#(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 17:00:10,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {3487#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3479#true} is VALID [2022-04-07 17:00:10,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {3479#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-07 17:00:10,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3479#true} {3479#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-07 17:00:10,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {3479#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-07 17:00:10,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {3479#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {3479#true} is VALID [2022-04-07 17:00:10,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {3479#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-07 17:00:10,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {3479#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-07 17:00:10,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {3479#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-07 17:00:10,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {3479#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-07 17:00:10,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {3479#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-07 17:00:10,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {3479#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-07 17:00:10,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {3479#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-07 17:00:10,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {3479#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-07 17:00:10,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {3479#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-07 17:00:10,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {3479#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-07 17:00:10,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {3479#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {3484#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:10,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {3484#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3484#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:10,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {3484#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {3484#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:10,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {3484#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {3484#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:10,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {3484#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {3484#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:10,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {3484#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {3484#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:10,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {3484#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-07 17:00:10,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-07 17:00:10,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-07 17:00:10,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-07 17:00:10,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-07 17:00:10,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {3486#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-07 17:00:10,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {3486#(not (= main_~__VERIFIER_assert__cond~6 0))} [299] L175-->L177: Formula: (= v_main_~__VERIFIER_assert__cond~6_3 0) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} OutVars{main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} AuxVars[] AssignedVars[] {3480#false} is VALID [2022-04-07 17:00:10,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {3480#false} [301] L177-->mainErr6ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3480#false} is VALID [2022-04-07 17:00:10,847 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 17:00:10,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:10,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643143670] [2022-04-07 17:00:10,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643143670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:10,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:10,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:00:10,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32197922] [2022-04-07 17:00:10,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:10,849 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 17:00:10,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:10,849 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 17:00:10,867 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 17:00:10,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:00:10,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:10,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:00:10,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:00:10,868 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 17:00:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:11,109 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-07 17:00:11,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:00:11,110 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 17:00:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:11,110 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 17:00:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-07 17:00:11,111 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 17:00:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-07 17:00:11,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-04-07 17:00:11,169 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 17:00:11,176 INFO L225 Difference]: With dead ends: 74 [2022-04-07 17:00:11,176 INFO L226 Difference]: Without dead ends: 74 [2022-04-07 17:00:11,176 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 17:00:11,177 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 183 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:00:11,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 62 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:00:11,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-07 17:00:11,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-04-07 17:00:11,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:11,180 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 17:00:11,180 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 17:00:11,186 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 17:00:11,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:11,188 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-07 17:00:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-07 17:00:11,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:11,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:11,190 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 17:00:11,191 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 17:00:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:11,192 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-07 17:00:11,192 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-07 17:00:11,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:11,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:11,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:11,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:11,193 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 17:00:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-04-07 17:00:11,194 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2022-04-07 17:00:11,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:11,194 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-04-07 17:00:11,194 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 17:00:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-07 17:00:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 17:00:11,194 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:11,194 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 17:00:11,194 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 17:00:11,194 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 17:00:11,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:11,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1486248991, now seen corresponding path program 1 times [2022-04-07 17:00:11,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:11,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657503914] [2022-04-07 17:00:11,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:11,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:11,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:11,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {3801#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3793#true} is VALID [2022-04-07 17:00:11,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {3793#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3793#true} {3793#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {3793#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3801#(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 17:00:11,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {3801#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3793#true} is VALID [2022-04-07 17:00:11,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {3793#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3793#true} {3793#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {3793#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {3793#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {3793#true} is VALID [2022-04-07 17:00:11,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {3793#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {3793#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {3793#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {3793#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {3793#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {3793#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {3793#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {3793#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {3793#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [282] L372-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= v_main_~__tmp_18~0_1 (ite (<= 0 v_main_~main__cp~0_26) 1 0))) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__cp~0=v_main_~main__cp~0_26} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1, main_~main__cp~0=v_main_~main__cp~0_26} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [288] L384-->L392: Formula: (and (= v_main_~main__cp~0_27 (+ v_main_~main__cp~0_28 1)) (not (= v_main_~__VERIFIER_assert__cond~17_4 0))) InVars {main_~main__cp~0=v_main_~main__cp~0_28, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main__cp~0=v_main_~main__cp~0_27, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[main_~main__cp~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {3800#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-07 17:00:11,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {3800#(not (= main_~__VERIFIER_assert__cond~16 0))} [281] L372-->L374: Formula: (= v_main_~__VERIFIER_assert__cond~16_3 0) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} AuxVars[] AssignedVars[] {3794#false} is VALID [2022-04-07 17:00:11,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {3794#false} [285] L374-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3794#false} is VALID [2022-04-07 17:00:11,274 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 17:00:11,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:11,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657503914] [2022-04-07 17:00:11,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657503914] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:00:11,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315650121] [2022-04-07 17:00:11,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:11,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:00:11,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:00:11,276 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 17:00:11,287 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 17:00:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:11,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 17:00:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:11,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:00:11,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {3793#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {3793#true} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3793#true} is VALID [2022-04-07 17:00:11,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {3793#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3793#true} {3793#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {3793#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {3793#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {3793#true} is VALID [2022-04-07 17:00:11,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {3793#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {3793#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {3793#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {3793#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {3793#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {3793#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {3793#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {3793#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {3793#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [282] L372-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= v_main_~__tmp_18~0_1 (ite (<= 0 v_main_~main__cp~0_26) 1 0))) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__cp~0=v_main_~main__cp~0_26} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1, main_~main__cp~0=v_main_~main__cp~0_26} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [288] L384-->L392: Formula: (and (= v_main_~main__cp~0_27 (+ v_main_~main__cp~0_28 1)) (not (= v_main_~__VERIFIER_assert__cond~17_4 0))) InVars {main_~main__cp~0=v_main_~main__cp~0_28, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main__cp~0=v_main_~main__cp~0_27, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[main_~main__cp~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {3886#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID [2022-04-07 17:00:11,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {3886#(<= 1 main_~__VERIFIER_assert__cond~16)} [281] L372-->L374: Formula: (= v_main_~__VERIFIER_assert__cond~16_3 0) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} AuxVars[] AssignedVars[] {3794#false} is VALID [2022-04-07 17:00:11,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {3794#false} [285] L374-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3794#false} is VALID [2022-04-07 17:00:11,567 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 17:00:11,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:00:11,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {3794#false} [285] L374-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3794#false} is VALID [2022-04-07 17:00:11,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {3886#(<= 1 main_~__VERIFIER_assert__cond~16)} [281] L372-->L374: Formula: (= v_main_~__VERIFIER_assert__cond~16_3 0) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} AuxVars[] AssignedVars[] {3794#false} is VALID [2022-04-07 17:00:11,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {3886#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID [2022-04-07 17:00:11,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [288] L384-->L392: Formula: (and (= v_main_~main__cp~0_27 (+ v_main_~main__cp~0_28 1)) (not (= v_main_~__VERIFIER_assert__cond~17_4 0))) InVars {main_~main__cp~0=v_main_~main__cp~0_28, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main__cp~0=v_main_~main__cp~0_27, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[main_~main__cp~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [282] L372-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= v_main_~__tmp_18~0_1 (ite (<= 0 v_main_~main__cp~0_26) 1 0))) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__cp~0=v_main_~main__cp~0_26} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1, main_~main__cp~0=v_main_~main__cp~0_26} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {3793#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:11,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {3793#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {3793#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {3793#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {3793#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {3793#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {3793#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {3793#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {3793#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {3793#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {3793#true} is VALID [2022-04-07 17:00:11,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {3793#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3793#true} {3793#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {3793#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {3793#true} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3793#true} is VALID [2022-04-07 17:00:11,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {3793#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-07 17:00:11,713 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 17:00:11,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315650121] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:00:11,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:00:11,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-07 17:00:11,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775928068] [2022-04-07 17:00:11,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:00:11,714 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 17:00:11,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:11,715 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 17:00:11,732 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 17:00:11,732 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 17:00:11,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:11,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 17:00:11,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 17:00:11,733 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 17:00:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:12,061 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-07 17:00:12,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:00:12,062 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 17:00:12,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:12,062 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 17:00:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-07 17:00:12,063 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 17:00:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-07 17:00:12,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 113 transitions. [2022-04-07 17:00:12,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:12,186 INFO L225 Difference]: With dead ends: 109 [2022-04-07 17:00:12,186 INFO L226 Difference]: Without dead ends: 109 [2022-04-07 17:00:12,187 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 17:00:12,187 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 146 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:00:12,187 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 97 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:00:12,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-07 17:00:12,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2022-04-07 17:00:12,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:12,190 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 17:00:12,190 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 17:00:12,190 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 17:00:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:12,192 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-07 17:00:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-07 17:00:12,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:12,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:12,193 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 17:00:12,193 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 17:00:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:12,195 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-07 17:00:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-07 17:00:12,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:12,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:12,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:12,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:12,201 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 17:00:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-07 17:00:12,202 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2022-04-07 17:00:12,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:12,202 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-07 17:00:12,202 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 17:00:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-07 17:00:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 17:00:12,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:12,203 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 17:00:12,224 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 17:00:12,416 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 17:00:12,416 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 17:00:12,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:12,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1848916017, now seen corresponding path program 1 times [2022-04-07 17:00:12,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:12,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457942012] [2022-04-07 17:00:12,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:12,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:12,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:12,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {4395#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {4387#true} is VALID [2022-04-07 17:00:12,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {4387#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-07 17:00:12,477 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4387#true} {4387#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-07 17:00:12,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {4387#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4395#(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 17:00:12,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {4395#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {4387#true} is VALID [2022-04-07 17:00:12,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {4387#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-07 17:00:12,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4387#true} {4387#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-07 17:00:12,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {4387#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-07 17:00:12,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {4387#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {4387#true} is VALID [2022-04-07 17:00:12,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {4387#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-07 17:00:12,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {4387#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-07 17:00:12,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {4387#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-07 17:00:12,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {4387#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-07 17:00:12,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {4387#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-07 17:00:12,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {4387#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-07 17:00:12,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {4387#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-07 17:00:12,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {4387#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-07 17:00:12,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {4387#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {4392#(<= 0 main_~main__scheme~0)} is VALID [2022-04-07 17:00:12,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {4392#(<= 0 main_~main__scheme~0)} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {4392#(<= 0 main_~main__scheme~0)} is VALID [2022-04-07 17:00:12,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {4392#(<= 0 main_~main__scheme~0)} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:12,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {4393#(<= 0 main_~main__cp~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:12,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {4393#(<= 0 main_~main__cp~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:12,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {4393#(<= 0 main_~main__cp~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:12,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {4393#(<= 0 main_~main__cp~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:12,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {4393#(<= 0 main_~main__cp~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:12,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {4393#(<= 0 main_~main__cp~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:12,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {4393#(<= 0 main_~main__cp~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:12,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {4393#(<= 0 main_~main__cp~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:12,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {4393#(<= 0 main_~main__cp~0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:12,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {4393#(<= 0 main_~main__cp~0)} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:12,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {4393#(<= 0 main_~main__cp~0)} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:12,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {4393#(<= 0 main_~main__cp~0)} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {4394#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-07 17:00:12,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {4394#(not (= main_~__VERIFIER_assert__cond~7 0))} [303] L187-->L189: Formula: (= v_main_~__VERIFIER_assert__cond~7_3 0) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_3} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_3} AuxVars[] AssignedVars[] {4388#false} is VALID [2022-04-07 17:00:12,495 INFO L290 TraceCheckUtils]: 30: Hoare triple {4388#false} [305] L189-->mainErr7ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4388#false} is VALID [2022-04-07 17:00:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:00:12,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:12,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457942012] [2022-04-07 17:00:12,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457942012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:12,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:12,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:00:12,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580027908] [2022-04-07 17:00:12,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:12,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-07 17:00:12,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:12,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:00:12,513 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 17:00:12,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:00:12,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:12,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:00:12,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:00:12,514 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 17:00:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:12,703 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-07 17:00:12,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:00:12,703 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 17:00:12,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:12,704 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 17:00:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-04-07 17:00:12,704 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 17:00:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-04-07 17:00:12,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 67 transitions. [2022-04-07 17:00:12,774 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 17:00:12,775 INFO L225 Difference]: With dead ends: 68 [2022-04-07 17:00:12,775 INFO L226 Difference]: Without dead ends: 68 [2022-04-07 17:00:12,776 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 17:00:12,776 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 170 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:00:12,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 60 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:00:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-07 17:00:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-07 17:00:12,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:12,778 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 17:00:12,778 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 17:00:12,778 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 17:00:12,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:12,779 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-07 17:00:12,779 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-07 17:00:12,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:12,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:12,780 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 17:00:12,780 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 17:00:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:12,781 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-07 17:00:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-07 17:00:12,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:12,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:12,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:12,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:12,781 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 17:00:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-04-07 17:00:12,782 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2022-04-07 17:00:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:12,782 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-04-07 17:00:12,782 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 17:00:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-07 17:00:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 17:00:12,783 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:12,783 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 17:00:12,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 17:00:12,783 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 17:00:12,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:12,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1170891010, now seen corresponding path program 1 times [2022-04-07 17:00:12,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:12,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668869973] [2022-04-07 17:00:12,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:12,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:12,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:12,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {4684#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {4676#true} is VALID [2022-04-07 17:00:12,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {4676#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:12,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4676#true} {4676#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:12,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {4676#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4684#(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 17:00:12,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {4684#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {4676#true} is VALID [2022-04-07 17:00:12,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {4676#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:12,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4676#true} {4676#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:12,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {4676#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:12,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {4676#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {4676#true} is VALID [2022-04-07 17:00:12,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {4676#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:12,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {4676#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:12,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {4676#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:12,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {4676#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:12,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {4676#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:12,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {4676#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:12,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {4676#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:12,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {4676#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:12,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {4676#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:12,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {4676#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:12,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {4676#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:12,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:12,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:12,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:12,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:12,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:12,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:12,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:12,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [282] L372-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= v_main_~__tmp_18~0_1 (ite (<= 0 v_main_~main__cp~0_26) 1 0))) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__cp~0=v_main_~main__cp~0_26} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1, main_~main__cp~0=v_main_~main__cp~0_26} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:12,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [288] L384-->L392: Formula: (and (= v_main_~main__cp~0_27 (+ v_main_~main__cp~0_28 1)) (not (= v_main_~__VERIFIER_assert__cond~17_4 0))) InVars {main_~main__cp~0=v_main_~main__cp~0_28, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main__cp~0=v_main_~main__cp~0_27, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[main_~main__cp~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:12,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:12,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:12,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {4683#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-07 17:00:12,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {4683#(not (= main_~__VERIFIER_assert__cond~4 0))} [283] L143-->L145: Formula: (= v_main_~__VERIFIER_assert__cond~4_3 0) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} OutVars{main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} AuxVars[] AssignedVars[] {4677#false} is VALID [2022-04-07 17:00:12,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {4677#false} [289] L145-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4677#false} is VALID [2022-04-07 17:00:12,842 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 17:00:12,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:12,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668869973] [2022-04-07 17:00:12,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668869973] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:00:12,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177373807] [2022-04-07 17:00:12,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:12,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:00:12,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:00:12,844 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 17:00:12,848 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 17:00:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:12,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 17:00:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:12,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:00:13,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {4676#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {4676#true} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {4676#true} is VALID [2022-04-07 17:00:13,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {4676#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4676#true} {4676#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {4676#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {4676#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {4676#true} is VALID [2022-04-07 17:00:13,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {4676#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {4676#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {4676#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {4676#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {4676#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {4676#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {4676#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {4676#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {4676#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {4676#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {4676#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [282] L372-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= v_main_~__tmp_18~0_1 (ite (<= 0 v_main_~main__cp~0_26) 1 0))) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__cp~0=v_main_~main__cp~0_26} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1, main_~main__cp~0=v_main_~main__cp~0_26} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [288] L384-->L392: Formula: (and (= v_main_~main__cp~0_27 (+ v_main_~main__cp~0_28 1)) (not (= v_main_~__VERIFIER_assert__cond~17_4 0))) InVars {main_~main__cp~0=v_main_~main__cp~0_28, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main__cp~0=v_main_~main__cp~0_27, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[main_~main__cp~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {4772#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID [2022-04-07 17:00:13,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {4772#(<= 1 main_~__VERIFIER_assert__cond~4)} [283] L143-->L145: Formula: (= v_main_~__VERIFIER_assert__cond~4_3 0) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} OutVars{main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} AuxVars[] AssignedVars[] {4677#false} is VALID [2022-04-07 17:00:13,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {4677#false} [289] L145-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4677#false} is VALID [2022-04-07 17:00:13,065 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 17:00:13,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:00:13,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {4677#false} [289] L145-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4677#false} is VALID [2022-04-07 17:00:13,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {4772#(<= 1 main_~__VERIFIER_assert__cond~4)} [283] L143-->L145: Formula: (= v_main_~__VERIFIER_assert__cond~4_3 0) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} OutVars{main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} AuxVars[] AssignedVars[] {4677#false} is VALID [2022-04-07 17:00:13,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {4772#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID [2022-04-07 17:00:13,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [288] L384-->L392: Formula: (and (= v_main_~main__cp~0_27 (+ v_main_~main__cp~0_28 1)) (not (= v_main_~__VERIFIER_assert__cond~17_4 0))) InVars {main_~main__cp~0=v_main_~main__cp~0_28, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main__cp~0=v_main_~main__cp~0_27, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[main_~main__cp~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [282] L372-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= v_main_~__tmp_18~0_1 (ite (<= 0 v_main_~main__cp~0_26) 1 0))) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__cp~0=v_main_~main__cp~0_26} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1, main_~main__cp~0=v_main_~main__cp~0_26} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {4676#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {4676#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {4676#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {4676#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {4676#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {4676#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {4676#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {4676#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {4676#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {4676#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {4676#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {4676#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {4676#true} is VALID [2022-04-07 17:00:13,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {4676#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4676#true} {4676#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {4676#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {4676#true} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {4676#true} is VALID [2022-04-07 17:00:13,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {4676#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-07 17:00:13,214 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 17:00:13,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177373807] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:00:13,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:00:13,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-07 17:00:13,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648206183] [2022-04-07 17:00:13,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:00:13,216 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 17:00:13,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:13,216 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 17:00:13,237 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 17:00:13,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 17:00:13,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:13,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 17:00:13,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 17:00:13,238 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 17:00:13,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:13,485 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-07 17:00:13,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:00:13,485 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 17:00:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:13,486 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 17:00:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-07 17:00:13,487 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 17:00:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-07 17:00:13,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2022-04-07 17:00:13,547 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 17:00:13,548 INFO L225 Difference]: With dead ends: 67 [2022-04-07 17:00:13,548 INFO L226 Difference]: Without dead ends: 67 [2022-04-07 17:00:13,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 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 17:00:13,549 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 201 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:00:13,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 56 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:00:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-07 17:00:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-04-07 17:00:13,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:13,554 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 17:00:13,554 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 17:00:13,554 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 17:00:13,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:13,555 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-07 17:00:13,555 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-07 17:00:13,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:13,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:13,556 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 17:00:13,556 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 17:00:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:13,557 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-07 17:00:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-07 17:00:13,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:13,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:13,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:13,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:13,557 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 17:00:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-04-07 17:00:13,558 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2022-04-07 17:00:13,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:13,558 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-04-07 17:00:13,558 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 17:00:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-04-07 17:00:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 17:00:13,559 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:13,559 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:00:13,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 17:00:13,777 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 17:00:13,778 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 17:00:13,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:13,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1897188956, now seen corresponding path program 1 times [2022-04-07 17:00:13,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:13,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790966368] [2022-04-07 17:00:13,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:13,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:13,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:13,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {5150#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {5142#true} is VALID [2022-04-07 17:00:13,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {5142#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-07 17:00:13,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5142#true} {5142#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-07 17:00:13,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {5142#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5150#(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 17:00:13,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {5150#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {5142#true} is VALID [2022-04-07 17:00:13,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {5142#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-07 17:00:13,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5142#true} {5142#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-07 17:00:13,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {5142#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-07 17:00:13,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {5142#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {5142#true} is VALID [2022-04-07 17:00:13,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {5142#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-07 17:00:13,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {5142#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-07 17:00:13,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {5142#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-07 17:00:13,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {5142#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-07 17:00:13,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {5142#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-07 17:00:13,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {5142#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-07 17:00:13,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {5142#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-07 17:00:13,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {5142#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-07 17:00:13,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {5142#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-07 17:00:13,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {5142#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-07 17:00:13,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {5142#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {5147#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {5147#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {5147#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {5147#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {5147#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {5147#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {5147#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {5147#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {5147#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {5147#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {5147#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {5147#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {5147#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:13,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {5147#(< main_~main__cp~0 main_~main__urilen~0)} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {5149#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-07 17:00:13,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {5149#(not (= main_~__VERIFIER_assert__cond~8 0))} [311] L212-->L214: Formula: (= v_main_~__VERIFIER_assert__cond~8_3 0) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_3} OutVars{main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_3} AuxVars[] AssignedVars[] {5143#false} is VALID [2022-04-07 17:00:13,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {5143#false} [313] L214-->mainErr8ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5143#false} is VALID [2022-04-07 17:00:13,861 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 17:00:13,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:13,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790966368] [2022-04-07 17:00:13,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790966368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:13,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:13,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:00:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625908203] [2022-04-07 17:00:13,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:13,862 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 17:00:13,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:13,862 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 17:00:13,887 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 17:00:13,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:00:13,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:13,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:00:13,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:00:13,888 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 17:00:14,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:14,092 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-07 17:00:14,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:00:14,092 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 17:00:14,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:14,092 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 17:00:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-07 17:00:14,093 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 17:00:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-07 17:00:14,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-07 17:00:14,140 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 17:00:14,141 INFO L225 Difference]: With dead ends: 61 [2022-04-07 17:00:14,141 INFO L226 Difference]: Without dead ends: 61 [2022-04-07 17:00:14,141 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-07 17:00:14,143 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 17:00:14,143 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 17:00:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-07 17:00:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-04-07 17:00:14,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:14,145 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 17:00:14,145 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 17:00:14,145 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 17:00:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:14,146 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-07 17:00:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-07 17:00:14,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:14,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:14,147 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 17:00:14,147 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 17:00:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:14,148 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-07 17:00:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-07 17:00:14,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:14,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:14,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:14,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:14,148 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 17:00:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-07 17:00:14,149 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2022-04-07 17:00:14,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:14,149 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-07 17:00:14,149 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 17:00:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-07 17:00:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 17:00:14,149 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:14,150 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 17:00:14,150 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 17:00:14,150 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 17:00:14,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:14,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1316685848, now seen corresponding path program 1 times [2022-04-07 17:00:14,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:14,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883803271] [2022-04-07 17:00:14,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:14,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:14,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:14,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {5413#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {5404#true} is VALID [2022-04-07 17:00:14,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {5404#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-07 17:00:14,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5404#true} {5404#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-07 17:00:14,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {5404#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5413#(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 17:00:14,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {5413#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {5404#true} is VALID [2022-04-07 17:00:14,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {5404#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-07 17:00:14,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5404#true} {5404#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-07 17:00:14,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {5404#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-07 17:00:14,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {5404#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {5404#true} is VALID [2022-04-07 17:00:14,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {5404#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-07 17:00:14,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {5404#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-07 17:00:14,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {5404#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-07 17:00:14,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {5404#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-07 17:00:14,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {5404#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-07 17:00:14,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {5404#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-07 17:00:14,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {5404#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-07 17:00:14,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {5404#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-07 17:00:14,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {5404#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {5409#(<= 0 main_~main__scheme~0)} is VALID [2022-04-07 17:00:14,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {5409#(<= 0 main_~main__scheme~0)} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {5409#(<= 0 main_~main__scheme~0)} is VALID [2022-04-07 17:00:14,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {5409#(<= 0 main_~main__scheme~0)} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {5410#(<= 0 main_~main__cp~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {5410#(<= 0 main_~main__cp~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {5410#(<= 0 main_~main__cp~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {5410#(<= 0 main_~main__cp~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {5410#(<= 0 main_~main__cp~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {5410#(<= 0 main_~main__cp~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {5410#(<= 0 main_~main__cp~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {5410#(<= 0 main_~main__cp~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {5410#(<= 0 main_~main__cp~0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {5410#(<= 0 main_~main__cp~0)} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {5410#(<= 0 main_~main__cp~0)} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {5410#(<= 0 main_~main__cp~0)} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {5410#(<= 0 main_~main__cp~0)} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {5410#(<= 0 main_~main__cp~0)} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {5411#(<= 1 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {5411#(<= 1 main_~main__cp~0)} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {5411#(<= 1 main_~main__cp~0)} is VALID [2022-04-07 17:00:14,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {5411#(<= 1 main_~main__cp~0)} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {5412#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-07 17:00:14,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {5412#(not (= main_~__VERIFIER_assert__cond~9 0))} [315] L224-->L226: Formula: (= v_main_~__VERIFIER_assert__cond~9_3 0) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_3} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_3} AuxVars[] AssignedVars[] {5405#false} is VALID [2022-04-07 17:00:14,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {5405#false} [317] L226-->mainErr9ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5405#false} is VALID [2022-04-07 17:00:14,236 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 17:00:14,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:14,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883803271] [2022-04-07 17:00:14,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883803271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:14,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:14,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 17:00:14,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095203317] [2022-04-07 17:00:14,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:14,237 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 17:00:14,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:14,237 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 17:00:14,255 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 17:00:14,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 17:00:14,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:14,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 17:00:14,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-07 17:00:14,256 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 17:00:14,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:14,507 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-07 17:00:14,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:00:14,507 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 17:00:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:14,508 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 17:00:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-07 17:00:14,509 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 17:00:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-07 17:00:14,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-07 17:00:14,571 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 17:00:14,573 INFO L225 Difference]: With dead ends: 69 [2022-04-07 17:00:14,573 INFO L226 Difference]: Without dead ends: 69 [2022-04-07 17:00:14,574 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 17:00:14,576 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 17:00:14,576 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 17:00:14,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-07 17:00:14,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-04-07 17:00:14,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:14,577 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 17:00:14,579 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 17:00:14,579 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 17:00:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:14,580 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-07 17:00:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-07 17:00:14,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:14,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:14,581 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 17:00:14,581 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 17:00:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:14,582 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-07 17:00:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-07 17:00:14,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:14,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:14,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:14,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:14,583 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 17:00:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-04-07 17:00:14,584 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2022-04-07 17:00:14,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:14,584 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-04-07 17:00:14,584 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 17:00:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-04-07 17:00:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-07 17:00:14,585 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:14,585 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 17:00:14,585 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 17:00:14,585 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 17:00:14,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:14,586 INFO L85 PathProgramCache]: Analyzing trace with hash -546914678, now seen corresponding path program 1 times [2022-04-07 17:00:14,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:14,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986800723] [2022-04-07 17:00:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:14,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:14,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {5697#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {5689#true} is VALID [2022-04-07 17:00:14,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {5689#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,652 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5689#true} {5689#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {5689#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5697#(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 17:00:14,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {5697#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {5689#true} is VALID [2022-04-07 17:00:14,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {5689#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5689#true} {5689#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {5689#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {5689#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {5689#true} is VALID [2022-04-07 17:00:14,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {5689#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {5689#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {5689#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {5689#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {5689#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {5689#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {5689#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {5689#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {5689#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {5689#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {5689#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {5689#true} is VALID [2022-04-07 17:00:14,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {5689#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {5689#true} is VALID [2022-04-07 17:00:14,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {5689#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {5689#true} is VALID [2022-04-07 17:00:14,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {5689#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {5689#true} is VALID [2022-04-07 17:00:14,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {5689#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {5689#true} is VALID [2022-04-07 17:00:14,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {5689#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {5689#true} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {5689#true} is VALID [2022-04-07 17:00:14,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {5689#true} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {5689#true} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {5689#true} is VALID [2022-04-07 17:00:14,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {5689#true} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {5689#true} is VALID [2022-04-07 17:00:14,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {5689#true} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {5689#true} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {5689#true} is VALID [2022-04-07 17:00:14,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {5689#true} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {5689#true} is VALID [2022-04-07 17:00:14,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {5689#true} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-07 17:00:14,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {5689#true} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {5689#true} is VALID [2022-04-07 17:00:14,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {5689#true} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {5694#(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 17:00:14,656 INFO L290 TraceCheckUtils]: 32: Hoare triple {5694#(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)))} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {5695#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:14,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {5695#(not (<= main_~main__urilen~0 main_~main__cp~0))} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {5695#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:14,657 INFO L290 TraceCheckUtils]: 34: Hoare triple {5695#(not (<= main_~main__urilen~0 main_~main__cp~0))} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {5695#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:14,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {5695#(not (<= main_~main__urilen~0 main_~main__cp~0))} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {5696#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-07 17:00:14,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {5696#(not (= main_~__VERIFIER_assert__cond~10 0))} [323] L241-->L243: Formula: (= v_main_~__VERIFIER_assert__cond~10_3 0) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} OutVars{main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} AuxVars[] AssignedVars[] {5690#false} is VALID [2022-04-07 17:00:14,657 INFO L290 TraceCheckUtils]: 37: Hoare triple {5690#false} [325] L243-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5690#false} is VALID [2022-04-07 17:00:14,658 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 17:00:14,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:14,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986800723] [2022-04-07 17:00:14,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986800723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:14,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:14,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:00:14,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457660718] [2022-04-07 17:00:14,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:14,659 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 17:00:14,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:14,659 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 17:00:14,680 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 17:00:14,680 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:00:14,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:14,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:00:14,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:00:14,681 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 17:00:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:15,002 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-07 17:00:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 17:00:15,002 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 17:00:15,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:15,002 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 17:00:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-07 17:00:15,003 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 17:00:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-07 17:00:15,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2022-04-07 17:00:15,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:15,086 INFO L225 Difference]: With dead ends: 89 [2022-04-07 17:00:15,086 INFO L226 Difference]: Without dead ends: 89 [2022-04-07 17:00:15,086 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 17:00:15,087 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 17:00:15,087 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 17:00:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-07 17:00:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-04-07 17:00:15,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:15,090 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 17:00:15,090 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 17:00:15,090 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 17:00:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:15,092 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-07 17:00:15,092 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-07 17:00:15,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:15,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:15,093 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 17:00:15,093 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 17:00:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:15,097 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-07 17:00:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-07 17:00:15,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:15,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:15,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:15,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:15,097 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 17:00:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-04-07 17:00:15,100 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2022-04-07 17:00:15,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:15,100 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-04-07 17:00:15,100 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 17:00:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-07 17:00:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-07 17:00:15,100 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:15,100 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 17:00:15,101 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 17:00:15,101 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 17:00:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:15,101 INFO L85 PathProgramCache]: Analyzing trace with hash 225515518, now seen corresponding path program 1 times [2022-04-07 17:00:15,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:15,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007859227] [2022-04-07 17:00:15,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:15,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:15,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:15,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {6047#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6039#true} is VALID [2022-04-07 17:00:15,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {6039#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6039#true} {6039#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {6039#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6047#(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 17:00:15,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {6047#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6039#true} is VALID [2022-04-07 17:00:15,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {6039#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6039#true} {6039#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {6039#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {6039#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {6039#true} is VALID [2022-04-07 17:00:15,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {6039#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {6039#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {6039#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {6039#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {6039#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {6039#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {6039#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {6039#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {6039#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {6039#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {6039#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {6039#true} is VALID [2022-04-07 17:00:15,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {6039#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {6039#true} is VALID [2022-04-07 17:00:15,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {6039#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {6039#true} is VALID [2022-04-07 17:00:15,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {6039#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {6039#true} is VALID [2022-04-07 17:00:15,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {6039#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {6039#true} is VALID [2022-04-07 17:00:15,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {6039#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {6039#true} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {6039#true} is VALID [2022-04-07 17:00:15,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {6039#true} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {6039#true} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {6039#true} is VALID [2022-04-07 17:00:15,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {6039#true} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {6039#true} is VALID [2022-04-07 17:00:15,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {6039#true} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {6039#true} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {6039#true} is VALID [2022-04-07 17:00:15,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {6039#true} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {6039#true} is VALID [2022-04-07 17:00:15,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {6039#true} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-07 17:00:15,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {6039#true} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {6039#true} is VALID [2022-04-07 17:00:15,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {6039#true} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {6039#true} is VALID [2022-04-07 17:00:15,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {6039#true} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {6044#(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 17:00:15,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {6044#(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)))} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {6045#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:15,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {6045#(<= 0 main_~main__cp~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {6045#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:15,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {6045#(<= 0 main_~main__cp~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {6045#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:15,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {6045#(<= 0 main_~main__cp~0)} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {6046#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-07 17:00:15,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {6046#(not (= main_~__VERIFIER_assert__cond~11 0))} [327] L253-->L255: Formula: (= v_main_~__VERIFIER_assert__cond~11_3 0) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} AuxVars[] AssignedVars[] {6040#false} is VALID [2022-04-07 17:00:15,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {6040#false} [329] L255-->mainErr11ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6040#false} is VALID [2022-04-07 17:00:15,179 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 17:00:15,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:15,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007859227] [2022-04-07 17:00:15,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007859227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:15,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:15,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:00:15,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912334824] [2022-04-07 17:00:15,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:15,180 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 17:00:15,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:15,180 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 17:00:15,201 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 17:00:15,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:00:15,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:15,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:00:15,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:00:15,202 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 17:00:15,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:15,472 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-07 17:00:15,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:00:15,472 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 17:00:15,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:15,473 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 17:00:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-04-07 17:00:15,473 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 17:00:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-04-07 17:00:15,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2022-04-07 17:00:15,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:15,528 INFO L225 Difference]: With dead ends: 59 [2022-04-07 17:00:15,528 INFO L226 Difference]: Without dead ends: 59 [2022-04-07 17:00:15,528 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 17:00:15,529 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 17:00:15,529 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 17:00:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-07 17:00:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-07 17:00:15,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:15,530 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 17:00:15,530 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 17:00:15,530 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 17:00:15,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:15,531 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-07 17:00:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-07 17:00:15,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:15,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:15,532 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 17:00:15,532 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 17:00:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:15,533 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-07 17:00:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-07 17:00:15,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:15,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:15,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:15,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:15,533 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 17:00:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-04-07 17:00:15,534 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2022-04-07 17:00:15,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:15,534 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-04-07 17:00:15,534 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 17:00:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-07 17:00:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 17:00:15,534 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:15,534 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 17:00:15,534 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-07 17:00:15,535 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 17:00:15,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:15,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1972090370, now seen corresponding path program 1 times [2022-04-07 17:00:15,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:15,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833463368] [2022-04-07 17:00:15,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:15,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:15,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:15,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {6299#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6292#true} is VALID [2022-04-07 17:00:15,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {6292#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,576 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6292#true} {6292#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {6292#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6299#(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 17:00:15,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {6299#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6292#true} is VALID [2022-04-07 17:00:15,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {6292#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6292#true} {6292#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {6292#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {6292#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {6292#true} is VALID [2022-04-07 17:00:15,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {6292#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {6292#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {6292#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {6292#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {6292#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {6292#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {6292#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {6292#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {6292#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {6292#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {6292#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {6292#true} is VALID [2022-04-07 17:00:15,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {6292#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {6292#true} is VALID [2022-04-07 17:00:15,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {6292#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {6292#true} is VALID [2022-04-07 17:00:15,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {6292#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {6292#true} is VALID [2022-04-07 17:00:15,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {6292#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {6292#true} is VALID [2022-04-07 17:00:15,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {6292#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {6292#true} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {6292#true} is VALID [2022-04-07 17:00:15,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {6292#true} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {6292#true} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {6292#true} is VALID [2022-04-07 17:00:15,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {6292#true} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {6292#true} is VALID [2022-04-07 17:00:15,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {6292#true} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {6292#true} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {6292#true} is VALID [2022-04-07 17:00:15,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {6292#true} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {6292#true} is VALID [2022-04-07 17:00:15,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {6292#true} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {6292#true} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {6292#true} is VALID [2022-04-07 17:00:15,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {6292#true} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {6292#true} is VALID [2022-04-07 17:00:15,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {6292#true} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {6292#true} is VALID [2022-04-07 17:00:15,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {6292#true} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {6292#true} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-07 17:00:15,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {6292#true} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {6297#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-07 17:00:15,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {6297#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {6297#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-07 17:00:15,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {6297#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {6297#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-07 17:00:15,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {6297#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} [331] L262-->L270: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (= (+ v_main_~main__c~0_5 1) v_main_~main__c~0_4) (= (ite (< v_main_~main__c~0_4 v_main_~main__tokenlen~0_10) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_5, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} AuxVars[] AssignedVars[main_~main__c~0, main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {6298#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-07 17:00:15,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {6298#(not (= main_~__VERIFIER_assert__cond~12 0))} [333] L270-->L272: Formula: (= v_main_~__VERIFIER_assert__cond~12_3 0) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3} OutVars{main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3} AuxVars[] AssignedVars[] {6293#false} is VALID [2022-04-07 17:00:15,581 INFO L290 TraceCheckUtils]: 40: Hoare triple {6293#false} [336] L272-->mainErr12ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6293#false} is VALID [2022-04-07 17:00:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:00:15,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:15,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833463368] [2022-04-07 17:00:15,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833463368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:15,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:15,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 17:00:15,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071021016] [2022-04-07 17:00:15,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:15,582 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 17:00:15,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:15,583 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 17:00:15,604 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 17:00:15,604 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 17:00:15,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:15,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 17:00:15,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 17:00:15,605 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 17:00:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:15,794 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-07 17:00:15,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:00:15,794 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 17:00:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:15,795 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 17:00:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-07 17:00:15,796 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 17:00:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-07 17:00:15,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-07 17:00:15,848 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 17:00:15,849 INFO L225 Difference]: With dead ends: 68 [2022-04-07 17:00:15,849 INFO L226 Difference]: Without dead ends: 68 [2022-04-07 17:00:15,849 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 17:00:15,850 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 17:00:15,850 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 17:00:15,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-07 17:00:15,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2022-04-07 17:00:15,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:15,851 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 17:00:15,852 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 17:00:15,852 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 17:00:15,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:15,853 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-07 17:00:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-07 17:00:15,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:15,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:15,853 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 17:00:15,853 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 17:00:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:15,854 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-07 17:00:15,854 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-07 17:00:15,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:15,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:15,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:15,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:15,854 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 17:00:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-04-07 17:00:15,855 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2022-04-07 17:00:15,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:15,855 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-04-07 17:00:15,855 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 17:00:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-07 17:00:15,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-07 17:00:15,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:15,856 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 17:00:15,856 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-07 17:00:15,856 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 17:00:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:15,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1005260689, now seen corresponding path program 1 times [2022-04-07 17:00:15,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:15,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788957986] [2022-04-07 17:00:15,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:15,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:15,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:15,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {6580#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6572#true} is VALID [2022-04-07 17:00:15,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {6572#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6572#true} {6572#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {6572#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6580#(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 17:00:15,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {6580#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6572#true} is VALID [2022-04-07 17:00:15,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {6572#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6572#true} {6572#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {6572#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {6572#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {6572#true} is VALID [2022-04-07 17:00:15,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {6572#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {6572#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {6572#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {6572#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {6572#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {6572#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {6572#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {6572#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {6572#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {6572#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {6572#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {6572#true} is VALID [2022-04-07 17:00:15,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {6572#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {6572#true} is VALID [2022-04-07 17:00:15,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {6572#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {6572#true} is VALID [2022-04-07 17:00:15,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {6572#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {6572#true} is VALID [2022-04-07 17:00:15,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {6572#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {6572#true} is VALID [2022-04-07 17:00:15,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {6572#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {6572#true} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {6572#true} is VALID [2022-04-07 17:00:15,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {6572#true} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {6572#true} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {6572#true} is VALID [2022-04-07 17:00:15,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {6572#true} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {6572#true} is VALID [2022-04-07 17:00:15,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {6572#true} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {6572#true} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {6572#true} is VALID [2022-04-07 17:00:15,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {6572#true} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {6572#true} is VALID [2022-04-07 17:00:15,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {6572#true} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-07 17:00:15,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {6572#true} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {6572#true} is VALID [2022-04-07 17:00:15,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {6572#true} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {6577#(= main_~main__c~0 0)} is VALID [2022-04-07 17:00:15,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {6577#(= main_~main__c~0 0)} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {6577#(= main_~main__c~0 0)} is VALID [2022-04-07 17:00:15,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {6577#(= main_~main__c~0 0)} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {6577#(= main_~main__c~0 0)} is VALID [2022-04-07 17:00:15,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {6577#(= main_~main__c~0 0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {6577#(= main_~main__c~0 0)} is VALID [2022-04-07 17:00:15,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {6577#(= main_~main__c~0 0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {6577#(= main_~main__c~0 0)} is VALID [2022-04-07 17:00:15,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {6577#(= main_~main__c~0 0)} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {6577#(= main_~main__c~0 0)} is VALID [2022-04-07 17:00:15,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {6577#(= main_~main__c~0 0)} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {6577#(= main_~main__c~0 0)} is VALID [2022-04-07 17:00:15,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {6577#(= main_~main__c~0 0)} [331] L262-->L270: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (= (+ v_main_~main__c~0_5 1) v_main_~main__c~0_4) (= (ite (< v_main_~main__c~0_4 v_main_~main__tokenlen~0_10) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_5, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} AuxVars[] AssignedVars[main_~main__c~0, main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {6578#(<= 1 main_~main__c~0)} is VALID [2022-04-07 17:00:15,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {6578#(<= 1 main_~main__c~0)} [334] L270-->L282: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= (ite (<= 0 v_main_~main__c~0_6) 1 0) v_main_~__tmp_14~0_1) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__c~0=v_main_~main__c~0_6} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__c~0=v_main_~main__c~0_6, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {6579#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-07 17:00:15,907 INFO L290 TraceCheckUtils]: 40: Hoare triple {6579#(not (= main_~__VERIFIER_assert__cond~13 0))} [338] L282-->L284: Formula: (= v_main_~__VERIFIER_assert__cond~13_3 0) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_3} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_3} AuxVars[] AssignedVars[] {6573#false} is VALID [2022-04-07 17:00:15,907 INFO L290 TraceCheckUtils]: 41: Hoare triple {6573#false} [340] L284-->mainErr13ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6573#false} is VALID [2022-04-07 17:00:15,908 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 17:00:15,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:15,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788957986] [2022-04-07 17:00:15,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788957986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:15,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:15,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:00:15,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057809948] [2022-04-07 17:00:15,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:15,909 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 17:00:15,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:15,909 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 17:00:15,931 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 17:00:15,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:00:15,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:15,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:00:15,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:00:15,932 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 17:00:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:16,172 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-07 17:00:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:00:16,172 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 17:00:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:16,172 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 17:00:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-07 17:00:16,173 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 17:00:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-07 17:00:16,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-04-07 17:00:16,218 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 17:00:16,219 INFO L225 Difference]: With dead ends: 64 [2022-04-07 17:00:16,219 INFO L226 Difference]: Without dead ends: 64 [2022-04-07 17:00:16,219 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 17:00:16,219 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 17:00:16,219 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 17:00:16,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-07 17:00:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-04-07 17:00:16,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:16,221 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 17:00:16,221 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 17:00:16,221 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 17:00:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:16,222 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-07 17:00:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-07 17:00:16,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:16,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:16,222 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 17:00:16,222 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 17:00:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:16,223 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-07 17:00:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-07 17:00:16,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:16,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:16,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:16,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:16,224 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 17:00:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-07 17:00:16,224 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2022-04-07 17:00:16,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:16,224 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-07 17:00:16,225 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 17:00:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-07 17:00:16,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 17:00:16,225 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:16,225 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 17:00:16,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-07 17:00:16,225 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 17:00:16,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:16,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1098311654, now seen corresponding path program 1 times [2022-04-07 17:00:16,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:16,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735401665] [2022-04-07 17:00:16,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:16,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:16,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:16,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {6844#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6836#true} is VALID [2022-04-07 17:00:16,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {6836#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,277 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6836#true} {6836#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {6836#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6844#(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 17:00:16,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {6844#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6836#true} is VALID [2022-04-07 17:00:16,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {6836#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6836#true} {6836#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {6836#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {6836#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {6836#true} is VALID [2022-04-07 17:00:16,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {6836#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {6836#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {6836#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {6836#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {6836#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {6836#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {6836#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {6836#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {6836#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {6836#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {6836#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {6836#true} is VALID [2022-04-07 17:00:16,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {6836#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {6836#true} is VALID [2022-04-07 17:00:16,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {6836#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {6836#true} is VALID [2022-04-07 17:00:16,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {6836#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {6836#true} is VALID [2022-04-07 17:00:16,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {6836#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {6836#true} is VALID [2022-04-07 17:00:16,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {6836#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {6836#true} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {6836#true} is VALID [2022-04-07 17:00:16,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {6836#true} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {6836#true} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {6836#true} is VALID [2022-04-07 17:00:16,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {6836#true} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {6836#true} is VALID [2022-04-07 17:00:16,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {6836#true} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {6836#true} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {6836#true} is VALID [2022-04-07 17:00:16,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {6836#true} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {6836#true} is VALID [2022-04-07 17:00:16,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {6836#true} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-07 17:00:16,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {6836#true} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {6836#true} is VALID [2022-04-07 17:00:16,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {6836#true} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {6841#(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 17:00:16,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {6841#(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)))} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:16,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:16,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:16,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:16,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:16,282 INFO L290 TraceCheckUtils]: 37: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:16,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [331] L262-->L270: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (= (+ v_main_~main__c~0_5 1) v_main_~main__c~0_4) (= (ite (< v_main_~main__c~0_4 v_main_~main__tokenlen~0_10) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_5, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} AuxVars[] AssignedVars[main_~main__c~0, main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:16,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [334] L270-->L282: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= (ite (<= 0 v_main_~main__c~0_6) 1 0) v_main_~__tmp_14~0_1) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__c~0=v_main_~main__c~0_6} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__c~0=v_main_~main__c~0_6, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:16,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [339] L282-->L294: Formula: (and (= (ite (< v_main_~main__cp~0_20 v_main_~main__urilen~0_21) 1 0) v_main_~__tmp_15~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0)) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_21, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main__cp~0=v_main_~main__cp~0_20} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_21, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main__cp~0=v_main_~main__cp~0_20} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {6843#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-07 17:00:16,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {6843#(not (= main_~__VERIFIER_assert__cond~14 0))} [342] L294-->L296: Formula: (= v_main_~__VERIFIER_assert__cond~14_3 0) InVars {main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_3} OutVars{main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_3} AuxVars[] AssignedVars[] {6837#false} is VALID [2022-04-07 17:00:16,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {6837#false} [344] L296-->mainErr14ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6837#false} is VALID [2022-04-07 17:00:16,283 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 17:00:16,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:16,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735401665] [2022-04-07 17:00:16,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735401665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:16,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:16,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:00:16,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520441619] [2022-04-07 17:00:16,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:16,284 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 17:00:16,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:16,284 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 17:00:16,304 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 17:00:16,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:00:16,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:16,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:00:16,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:00:16,305 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 17:00:16,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:16,668 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-07 17:00:16,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 17:00:16,668 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 17:00:16,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:16,670 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 17:00:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-07 17:00:16,672 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 17:00:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-07 17:00:16,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-07 17:00:16,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:16,741 INFO L225 Difference]: With dead ends: 86 [2022-04-07 17:00:16,741 INFO L226 Difference]: Without dead ends: 86 [2022-04-07 17:00:16,742 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 17:00:16,742 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 17:00:16,742 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 17:00:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-07 17:00:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2022-04-07 17:00:16,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:16,744 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 17:00:16,744 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 17:00:16,744 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 17:00:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:16,745 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-07 17:00:16,745 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-07 17:00:16,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:16,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:16,745 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 17:00:16,745 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 17:00:16,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:16,746 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-07 17:00:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-07 17:00:16,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:16,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:16,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:16,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:16,747 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 17:00:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-04-07 17:00:16,748 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2022-04-07 17:00:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:16,748 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-04-07 17:00:16,748 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 17:00:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-04-07 17:00:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 17:00:16,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:16,748 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 17:00:16,749 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-07 17:00:16,749 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-07 17:00:16,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:16,749 INFO L85 PathProgramCache]: Analyzing trace with hash -312075723, now seen corresponding path program 1 times [2022-04-07 17:00:16,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:16,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335129317] [2022-04-07 17:00:16,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:16,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:16,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:16,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {7184#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7176#true} is VALID [2022-04-07 17:00:16,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {7176#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,818 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7176#true} {7176#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {7176#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7184#(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 17:00:16,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {7184#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7176#true} is VALID [2022-04-07 17:00:16,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {7176#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7176#true} {7176#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {7176#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {7176#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {7176#true} is VALID [2022-04-07 17:00:16,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {7176#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {7176#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {7176#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {7176#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {7176#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {7176#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {7176#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {7176#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {7176#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {7176#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {7176#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {7176#true} is VALID [2022-04-07 17:00:16,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {7176#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {7176#true} is VALID [2022-04-07 17:00:16,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {7176#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {7176#true} is VALID [2022-04-07 17:00:16,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {7176#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {7176#true} is VALID [2022-04-07 17:00:16,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {7176#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {7176#true} is VALID [2022-04-07 17:00:16,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {7176#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {7176#true} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {7176#true} is VALID [2022-04-07 17:00:16,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {7176#true} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {7176#true} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {7176#true} is VALID [2022-04-07 17:00:16,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {7176#true} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {7176#true} is VALID [2022-04-07 17:00:16,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {7176#true} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {7176#true} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {7176#true} is VALID [2022-04-07 17:00:16,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {7176#true} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {7176#true} is VALID [2022-04-07 17:00:16,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {7176#true} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-07 17:00:16,821 INFO L290 TraceCheckUtils]: 30: Hoare triple {7176#true} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {7176#true} is VALID [2022-04-07 17:00:16,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {7176#true} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {7176#true} is VALID [2022-04-07 17:00:16,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {7176#true} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {7181#(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 17:00:16,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {7181#(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)))} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:16,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {7182#(<= 0 main_~main__cp~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:16,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {7182#(<= 0 main_~main__cp~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:16,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {7182#(<= 0 main_~main__cp~0)} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:16,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {7182#(<= 0 main_~main__cp~0)} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:16,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {7182#(<= 0 main_~main__cp~0)} [331] L262-->L270: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (= (+ v_main_~main__c~0_5 1) v_main_~main__c~0_4) (= (ite (< v_main_~main__c~0_4 v_main_~main__tokenlen~0_10) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_5, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} AuxVars[] AssignedVars[main_~main__c~0, main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:16,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {7182#(<= 0 main_~main__cp~0)} [334] L270-->L282: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= (ite (<= 0 v_main_~main__c~0_6) 1 0) v_main_~__tmp_14~0_1) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__c~0=v_main_~main__c~0_6} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__c~0=v_main_~main__c~0_6, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:16,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {7182#(<= 0 main_~main__cp~0)} [339] L282-->L294: Formula: (and (= (ite (< v_main_~main__cp~0_20 v_main_~main__urilen~0_21) 1 0) v_main_~__tmp_15~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0)) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_21, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main__cp~0=v_main_~main__cp~0_20} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_21, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main__cp~0=v_main_~main__cp~0_20} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-07 17:00:16,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {7182#(<= 0 main_~main__cp~0)} [343] L294-->L306: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~14_4 0)) (= v_main_~__tmp_16~0_1 (ite (<= 0 v_main_~main__cp~0_21) 1 0)) (= v_main_~__tmp_16~0_1 v_main_~__VERIFIER_assert__cond~15_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_21, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_1, main_~__tmp_16~0=v_main_~__tmp_16~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__cp~0=v_main_~main__cp~0_21} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~15, main_~__tmp_16~0] {7183#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-07 17:00:16,824 INFO L290 TraceCheckUtils]: 42: Hoare triple {7183#(not (= main_~__VERIFIER_assert__cond~15 0))} [346] L306-->L308: Formula: (= v_main_~__VERIFIER_assert__cond~15_3 0) InVars {main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_3} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_3} AuxVars[] AssignedVars[] {7177#false} is VALID [2022-04-07 17:00:16,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {7177#false} [348] L308-->mainErr15ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7177#false} is VALID [2022-04-07 17:00:16,824 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 17:00:16,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:16,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335129317] [2022-04-07 17:00:16,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335129317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:16,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:16,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:00:16,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687768082] [2022-04-07 17:00:16,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:16,826 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 17:00:16,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:16,826 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 17:00:16,846 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 17:00:16,847 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:00:16,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:16,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:00:16,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:00:16,847 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:00:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:17,094 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-07 17:00:17,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:00:17,094 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 17:00:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:17,094 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 17:00:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-04-07 17:00:17,095 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 17:00:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-04-07 17:00:17,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 67 transitions. [2022-04-07 17:00:17,147 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 17:00:17,148 INFO L225 Difference]: With dead ends: 71 [2022-04-07 17:00:17,148 INFO L226 Difference]: Without dead ends: 71 [2022-04-07 17:00:17,148 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 17:00:17,148 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 81 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:00:17,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 69 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:00:17,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-07 17:00:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2022-04-07 17:00:17,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:17,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 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 17:00:17,150 INFO L74 IsIncluded]: Start isIncluded. First operand 71 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 17:00:17,150 INFO L87 Difference]: Start difference. First operand 71 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 17:00:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:17,151 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-07 17:00:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-07 17:00:17,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:17,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:17,151 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 71 states. [2022-04-07 17:00:17,151 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 71 states. [2022-04-07 17:00:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:17,152 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-07 17:00:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-07 17:00:17,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:17,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:17,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:17,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:17,153 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 17:00:17,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-04-07 17:00:17,153 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2022-04-07 17:00:17,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:17,153 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-04-07 17:00:17,154 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 17:00:17,154 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-07 17:00:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 17:00:17,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:17,154 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 17:00:17,154 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-07 17:00:17,154 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-07 17:00:17,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:17,155 INFO L85 PathProgramCache]: Analyzing trace with hash -283140749, now seen corresponding path program 1 times [2022-04-07 17:00:17,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:17,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321001678] [2022-04-07 17:00:17,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:17,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:17,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:17,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {7472#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7464#true} is VALID [2022-04-07 17:00:17,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {7464#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7464#true} {7464#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {7464#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7472#(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 17:00:17,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {7472#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7464#true} is VALID [2022-04-07 17:00:17,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {7464#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7464#true} {7464#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {7464#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {7464#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {7464#true} is VALID [2022-04-07 17:00:17,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {7464#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {7464#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {7464#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {7464#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {7464#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {7464#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {7464#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {7464#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {7464#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {7464#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {7464#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,252 INFO L290 TraceCheckUtils]: 32: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,252 INFO L290 TraceCheckUtils]: 34: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,253 INFO L290 TraceCheckUtils]: 35: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,253 INFO L290 TraceCheckUtils]: 36: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [332] L262-->L327: Formula: (= v_main_~main____CPAchecker_TMP_3~0_4 0) InVars {main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,254 INFO L290 TraceCheckUtils]: 39: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [335] L327-->L315: Formula: (= v_main_~main__cp~0_22 (+ v_main_~main__cp~0_23 1)) InVars {main_~main__cp~0=v_main_~main__cp~0_23} OutVars{main_~main__cp~0=v_main_~main__cp~0_22} AuxVars[] AssignedVars[main_~main__cp~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,254 INFO L290 TraceCheckUtils]: 40: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7471#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-07 17:00:17,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {7471#(not (= main_~__VERIFIER_assert__cond~10 0))} [323] L241-->L243: Formula: (= v_main_~__VERIFIER_assert__cond~10_3 0) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} OutVars{main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} AuxVars[] AssignedVars[] {7465#false} is VALID [2022-04-07 17:00:17,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {7465#false} [325] L243-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7465#false} is VALID [2022-04-07 17:00:17,255 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 17:00:17,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:17,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321001678] [2022-04-07 17:00:17,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321001678] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:00:17,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608007271] [2022-04-07 17:00:17,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:17,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:00:17,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:00:17,257 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 17:00:17,258 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 17:00:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:17,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 17:00:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:17,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:00:17,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {7464#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {7464#true} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7464#true} is VALID [2022-04-07 17:00:17,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {7464#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7464#true} {7464#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {7464#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {7464#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {7464#true} is VALID [2022-04-07 17:00:17,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {7464#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {7464#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {7464#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {7464#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {7464#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {7464#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {7464#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {7464#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {7464#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {7464#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {7464#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,566 INFO L290 TraceCheckUtils]: 37: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,566 INFO L290 TraceCheckUtils]: 38: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [332] L262-->L327: Formula: (= v_main_~main____CPAchecker_TMP_3~0_4 0) InVars {main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [335] L327-->L315: Formula: (= v_main_~main__cp~0_22 (+ v_main_~main__cp~0_23 1)) InVars {main_~main__cp~0=v_main_~main__cp~0_23} OutVars{main_~main__cp~0=v_main_~main__cp~0_22} AuxVars[] AssignedVars[main_~main__cp~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,567 INFO L290 TraceCheckUtils]: 40: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,567 INFO L290 TraceCheckUtils]: 41: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7599#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID [2022-04-07 17:00:17,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {7599#(<= 1 main_~__VERIFIER_assert__cond~10)} [323] L241-->L243: Formula: (= v_main_~__VERIFIER_assert__cond~10_3 0) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} OutVars{main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} AuxVars[] AssignedVars[] {7465#false} is VALID [2022-04-07 17:00:17,568 INFO L290 TraceCheckUtils]: 43: Hoare triple {7465#false} [325] L243-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7465#false} is VALID [2022-04-07 17:00:17,568 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 17:00:17,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:00:17,758 INFO L290 TraceCheckUtils]: 43: Hoare triple {7465#false} [325] L243-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7465#false} is VALID [2022-04-07 17:00:17,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {7599#(<= 1 main_~__VERIFIER_assert__cond~10)} [323] L241-->L243: Formula: (= v_main_~__VERIFIER_assert__cond~10_3 0) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} OutVars{main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} AuxVars[] AssignedVars[] {7465#false} is VALID [2022-04-07 17:00:17,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7599#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID [2022-04-07 17:00:17,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,760 INFO L290 TraceCheckUtils]: 39: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [335] L327-->L315: Formula: (= v_main_~main__cp~0_22 (+ v_main_~main__cp~0_23 1)) InVars {main_~main__cp~0=v_main_~main__cp~0_23} OutVars{main_~main__cp~0=v_main_~main__cp~0_22} AuxVars[] AssignedVars[main_~main__cp~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [332] L262-->L327: Formula: (= v_main_~main____CPAchecker_TMP_3~0_4 0) InVars {main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,761 INFO L290 TraceCheckUtils]: 36: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,761 INFO L290 TraceCheckUtils]: 35: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,761 INFO L290 TraceCheckUtils]: 34: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {7464#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-07 17:00:17,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {7464#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {7464#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {7464#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {7464#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {7464#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {7464#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {7464#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {7464#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {7464#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {7464#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {7464#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {7464#true} is VALID [2022-04-07 17:00:17,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {7464#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7464#true} {7464#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {7464#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {7464#true} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7464#true} is VALID [2022-04-07 17:00:17,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {7464#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-07 17:00:17,768 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 17:00:17,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608007271] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:00:17,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:00:17,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-07 17:00:17,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819058062] [2022-04-07 17:00:17,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:00:17,769 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 17:00:17,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:17,769 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 17:00:17,795 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 17:00:17,796 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 17:00:17,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:17,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 17:00:17,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 17:00:17,796 INFO L87 Difference]: Start difference. First operand 58 states and 61 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 17:00:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:18,003 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-04-07 17:00:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:00:18,003 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 17:00:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:18,003 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 17:00:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-07 17:00:18,004 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 17:00:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-07 17:00:18,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2022-04-07 17:00:18,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:18,043 INFO L225 Difference]: With dead ends: 56 [2022-04-07 17:00:18,043 INFO L226 Difference]: Without dead ends: 56 [2022-04-07 17:00:18,043 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 17:00:18,043 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 78 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 52 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 17:00:18,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 52 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:00:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-07 17:00:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-07 17:00:18,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:18,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 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 17:00:18,045 INFO L74 IsIncluded]: Start isIncluded. First operand 56 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 17:00:18,045 INFO L87 Difference]: Start difference. First operand 56 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 17:00:18,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:18,046 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-04-07 17:00:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-07 17:00:18,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:18,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:18,046 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 56 states. [2022-04-07 17:00:18,046 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 56 states. [2022-04-07 17:00:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:18,047 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-04-07 17:00:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-07 17:00:18,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:18,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:18,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:18,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:18,047 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 17:00:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-04-07 17:00:18,048 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2022-04-07 17:00:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:18,048 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-04-07 17:00:18,048 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 17:00:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-07 17:00:18,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-07 17:00:18,048 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:18,048 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 17:00:18,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-07 17:00:18,259 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:00:18,259 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 17:00:18,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:18,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1506676067, now seen corresponding path program 1 times [2022-04-07 17:00:18,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:18,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271915575] [2022-04-07 17:00:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:18,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:18,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:18,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {7977#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7969#true} is VALID [2022-04-07 17:00:18,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {7969#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7969#true} {7969#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {7969#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7977#(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 17:00:18,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {7977#(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|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7969#true} is VALID [2022-04-07 17:00:18,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {7969#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7969#true} {7969#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {7969#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {7969#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {7969#true} is VALID [2022-04-07 17:00:18,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {7969#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {7969#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {7969#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {7969#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {7969#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {7969#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {7969#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {7969#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {7969#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {7969#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {7969#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {7969#true} is VALID [2022-04-07 17:00:18,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {7969#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {7969#true} is VALID [2022-04-07 17:00:18,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {7969#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {7969#true} is VALID [2022-04-07 17:00:18,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {7969#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {7969#true} is VALID [2022-04-07 17:00:18,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {7969#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {7969#true} is VALID [2022-04-07 17:00:18,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {7969#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {7969#true} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {7969#true} is VALID [2022-04-07 17:00:18,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {7969#true} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {7969#true} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {7969#true} is VALID [2022-04-07 17:00:18,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {7969#true} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {7969#true} is VALID [2022-04-07 17:00:18,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {7969#true} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {7969#true} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {7969#true} is VALID [2022-04-07 17:00:18,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {7969#true} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {7969#true} is VALID [2022-04-07 17:00:18,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {7969#true} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {7969#true} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {7969#true} is VALID [2022-04-07 17:00:18,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {7969#true} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {7969#true} is VALID [2022-04-07 17:00:18,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {7969#true} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {7969#true} is VALID [2022-04-07 17:00:18,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {7969#true} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {7969#true} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,323 INFO L290 TraceCheckUtils]: 35: Hoare triple {7969#true} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7969#true} is VALID [2022-04-07 17:00:18,323 INFO L290 TraceCheckUtils]: 36: Hoare triple {7969#true} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {7969#true} is VALID [2022-04-07 17:00:18,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {7969#true} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {7969#true} is VALID [2022-04-07 17:00:18,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {7969#true} [332] L262-->L327: Formula: (= v_main_~main____CPAchecker_TMP_3~0_4 0) InVars {main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {7969#true} [335] L327-->L315: Formula: (= v_main_~main__cp~0_22 (+ v_main_~main__cp~0_23 1)) InVars {main_~main__cp~0=v_main_~main__cp~0_23} OutVars{main_~main__cp~0=v_main_~main__cp~0_22} AuxVars[] AssignedVars[main_~main__cp~0] {7969#true} is VALID [2022-04-07 17:00:18,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {7969#true} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-07 17:00:18,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {7969#true} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7974#(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 17:00:18,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {7974#(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))))} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:18,324 INFO L290 TraceCheckUtils]: 43: Hoare triple {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:18,325 INFO L290 TraceCheckUtils]: 44: Hoare triple {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} [331] L262-->L270: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (= (+ v_main_~main__c~0_5 1) v_main_~main__c~0_4) (= (ite (< v_main_~main__c~0_4 v_main_~main__tokenlen~0_10) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_5, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} AuxVars[] AssignedVars[main_~main__c~0, main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:18,325 INFO L290 TraceCheckUtils]: 45: Hoare triple {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} [334] L270-->L282: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= (ite (<= 0 v_main_~main__c~0_6) 1 0) v_main_~__tmp_14~0_1) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__c~0=v_main_~main__c~0_6} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__c~0=v_main_~main__c~0_6, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-07 17:00:18,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} [339] L282-->L294: Formula: (and (= (ite (< v_main_~main__cp~0_20 v_main_~main__urilen~0_21) 1 0) v_main_~__tmp_15~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0)) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_21, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main__cp~0=v_main_~main__cp~0_20} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_21, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main__cp~0=v_main_~main__cp~0_20} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {7976#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-07 17:00:18,326 INFO L290 TraceCheckUtils]: 47: Hoare triple {7976#(not (= main_~__VERIFIER_assert__cond~14 0))} [342] L294-->L296: Formula: (= v_main_~__VERIFIER_assert__cond~14_3 0) InVars {main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_3} OutVars{main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_3} AuxVars[] AssignedVars[] {7970#false} is VALID [2022-04-07 17:00:18,326 INFO L290 TraceCheckUtils]: 48: Hoare triple {7970#false} [344] L296-->mainErr14ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7970#false} is VALID [2022-04-07 17:00:18,326 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 17:00:18,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:18,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271915575] [2022-04-07 17:00:18,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271915575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:00:18,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:00:18,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:00:18,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51441753] [2022-04-07 17:00:18,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:00:18,329 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 17:00:18,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:18,329 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 17:00:18,354 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 17:00:18,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:00:18,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:18,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:00:18,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:00:18,355 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 17:00:18,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:18,669 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-04-07 17:00:18,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 17:00:18,669 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 17:00:18,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:18,670 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 17:00:18,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-07 17:00:18,670 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 17:00:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-07 17:00:18,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2022-04-07 17:00:18,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:18,744 INFO L225 Difference]: With dead ends: 73 [2022-04-07 17:00:18,745 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 17:00:18,745 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 17:00:18,745 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 17:00:18,745 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 17:00:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 17:00:18,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 17:00:18,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:18,746 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 17:00:18,746 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 17:00:18,746 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 17:00:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:18,746 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:00:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:00:18,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:18,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:18,746 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 17:00:18,746 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 17:00:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:18,746 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:00:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:00:18,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:18,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:18,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:18,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:18,747 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 17:00:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 17:00:18,747 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-04-07 17:00:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:18,747 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 17:00:18,747 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 17:00:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:00:18,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:18,749 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-04-07 17:00:18,750 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-04-07 17:00:18,750 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-04-07 17:00:18,750 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-04-07 17:00:18,750 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-04-07 17:00:18,750 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-04-07 17:00:18,750 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-04-07 17:00:18,750 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-04-07 17:00:18,750 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-04-07 17:00:18,750 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-04-07 17:00:18,750 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-04-07 17:00:18,750 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-04-07 17:00:18,750 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-04-07 17:00:18,750 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-04-07 17:00:18,751 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-04-07 17:00:18,751 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-04-07 17:00:18,751 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-04-07 17:00:18,751 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-04-07 17:00:18,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-07 17:00:18,753 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 17:00:18,754 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 17:00:18,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:00:18 BasicIcfg [2022-04-07 17:00:18,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 17:00:18,756 INFO L158 Benchmark]: Toolchain (without parser) took 13874.35ms. Allocated memory was 179.3MB in the beginning and 264.2MB in the end (delta: 84.9MB). Free memory was 128.1MB in the beginning and 229.5MB in the end (delta: -101.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:00:18,756 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory was 144.4MB in the beginning and 144.2MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:00:18,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.37ms. Allocated memory is still 179.3MB. Free memory was 127.9MB in the beginning and 144.2MB in the end (delta: -16.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 17:00:18,756 INFO L158 Benchmark]: Boogie Preprocessor took 50.78ms. Allocated memory is still 179.3MB. Free memory was 144.2MB in the beginning and 142.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 17:00:18,756 INFO L158 Benchmark]: RCFGBuilder took 462.80ms. Allocated memory is still 179.3MB. Free memory was 142.6MB in the beginning and 123.3MB in the end (delta: 19.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-04-07 17:00:18,757 INFO L158 Benchmark]: IcfgTransformer took 61.35ms. Allocated memory is still 179.3MB. Free memory was 123.3MB in the beginning and 119.7MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-07 17:00:18,757 INFO L158 Benchmark]: TraceAbstraction took 12982.14ms. Allocated memory was 179.3MB in the beginning and 264.2MB in the end (delta: 84.9MB). Free memory was 119.1MB in the beginning and 229.5MB in the end (delta: -110.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:00:18,757 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 179.3MB. Free memory was 144.4MB in the beginning and 144.2MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 312.37ms. Allocated memory is still 179.3MB. Free memory was 127.9MB in the beginning and 144.2MB in the end (delta: -16.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.78ms. Allocated memory is still 179.3MB. Free memory was 144.2MB in the beginning and 142.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 462.80ms. Allocated memory is still 179.3MB. Free memory was 142.6MB in the beginning and 123.3MB in the end (delta: 19.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * IcfgTransformer took 61.35ms. Allocated memory is still 179.3MB. Free memory was 123.3MB in the beginning and 119.7MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 12982.14ms. Allocated memory was 179.3MB in the beginning and 264.2MB in the end (delta: 84.9MB). Free memory was 119.1MB in the beginning and 229.5MB in the end (delta: -110.4MB). There was no memory consumed. 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: 374]: 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: 386]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3717 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3717 mSDsluCounter, 1687 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 360 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2598 IncrementalHoareTripleChecker+Invalid, 2790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 1327 mSDtfsCounter, 2598 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.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 298 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s 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 RESULT: Ultimate proved your program to be correct! [2022-04-07 17:00:18,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...