/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/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:32:44,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:32:44,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:32:44,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:32:44,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:32:44,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:32:44,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:32:44,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:32:44,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:32:44,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:32:44,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:32:44,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:32:44,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:32:44,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:32:44,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:32:44,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:32:44,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:32:44,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:32:45,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:32:45,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:32:45,010 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:32:45,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:32:45,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:32:45,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:32:45,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:32:45,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:32:45,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:32:45,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:32:45,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:32:45,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:32:45,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:32:45,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:32:45,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:32:45,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:32:45,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:32:45,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:32:45,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:32:45,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:32:45,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:32:45,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:32:45,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:32:45,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:32:45,026 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:32:45,045 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:32:45,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:32:45,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:32:45,046 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:32:45,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:32:45,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:32:45,047 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:32:45,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:32:45,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:32:45,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:32:45,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:32:45,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:32:45,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:32:45,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:32:45,048 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:32:45,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:32:45,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:32:45,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:32:45,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:32:45,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:32:45,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:32:45,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:32:45,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:32:45,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:32:45,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:32:45,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:32:45,049 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:32:45,050 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:32:45,050 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:32:45,050 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-15 00:32:45,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:32:45,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:32:45,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:32:45,250 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:32:45,250 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:32:45,251 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-15 00:32:45,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9bd11eb4/d20034c60a234177a3d0f7ca4229a7f9/FLAG46284b568 [2022-04-15 00:32:45,600 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:32:45,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-04-15 00:32:45,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9bd11eb4/d20034c60a234177a3d0f7ca4229a7f9/FLAG46284b568 [2022-04-15 00:32:46,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9bd11eb4/d20034c60a234177a3d0f7ca4229a7f9 [2022-04-15 00:32:46,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:32:46,030 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:32:46,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:32:46,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:32:46,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:32:46,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:46" (1/1) ... [2022-04-15 00:32:46,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ff81f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:46, skipping insertion in model container [2022-04-15 00:32:46,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:46" (1/1) ... [2022-04-15 00:32:46,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:32:46,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:32:46,196 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-15 00:32:46,199 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-15 00:32:46,201 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-15 00:32:46,202 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-15 00:32:46,203 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-15 00:32:46,204 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-15 00:32:46,206 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-15 00:32:46,207 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-15 00:32:46,209 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-15 00:32:46,210 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-15 00:32:46,222 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-15 00:32:46,224 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-15 00:32:46,225 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-15 00:32:46,226 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-15 00:32:46,227 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-15 00:32:46,228 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-15 00:32:46,236 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-15 00:32:46,237 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-15 00:32:46,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:32:46,249 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:32:46,261 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-15 00:32:46,270 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-15 00:32:46,271 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-15 00:32:46,272 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-15 00:32:46,273 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-15 00:32:46,274 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-15 00:32:46,275 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-15 00:32:46,275 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-15 00:32:46,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-04-15 00:32:46,278 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-15 00:32:46,279 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-15 00:32:46,281 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-15 00:32:46,283 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-15 00:32:46,283 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-15 00:32:46,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-04-15 00:32:46,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-04-15 00:32:46,286 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-15 00:32:46,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-04-15 00:32:46,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:32:46,297 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:32:46,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:46 WrapperNode [2022-04-15 00:32:46,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:32:46,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:32:46,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:32:46,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:32:46,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:46" (1/1) ... [2022-04-15 00:32:46,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:46" (1/1) ... [2022-04-15 00:32:46,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:46" (1/1) ... [2022-04-15 00:32:46,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:46" (1/1) ... [2022-04-15 00:32:46,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:46" (1/1) ... [2022-04-15 00:32:46,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:46" (1/1) ... [2022-04-15 00:32:46,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:46" (1/1) ... [2022-04-15 00:32:46,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:32:46,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:32:46,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:32:46,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:32:46,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:46" (1/1) ... [2022-04-15 00:32:46,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:32:46,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:32:46,367 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-15 00:32:46,369 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-15 00:32:46,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:32:46,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:32:46,404 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:32:46,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 00:32:46,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:32:46,404 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:32:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:32:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:32:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:32:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 00:32:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:32:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 00:32:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:32:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:32:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:32:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:32:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:32:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:32:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:32:46,473 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:32:46,474 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:32:46,805 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:32:46,818 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:32:46,818 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-15 00:32:46,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:46 BoogieIcfgContainer [2022-04-15 00:32:46,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:32:46,820 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:32:46,820 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:32:46,821 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:32:46,823 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:46" (1/1) ... [2022-04-15 00:32:46,825 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:32:46,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:32:46 BasicIcfg [2022-04-15 00:32:46,889 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:32:46,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:32:46,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:32:46,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:32:46,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:32:46" (1/4) ... [2022-04-15 00:32:46,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5550bfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:46, skipping insertion in model container [2022-04-15 00:32:46,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:46" (2/4) ... [2022-04-15 00:32:46,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5550bfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:46, skipping insertion in model container [2022-04-15 00:32:46,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:46" (3/4) ... [2022-04-15 00:32:46,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5550bfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:32:46, skipping insertion in model container [2022-04-15 00:32:46,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:32:46" (4/4) ... [2022-04-15 00:32:46,895 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.cqvasr [2022-04-15 00:32:46,899 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:32:46,899 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-04-15 00:32:46,939 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:32:46,944 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 00:32:46,944 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-04-15 00:32:46,968 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-15 00:32:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 00:32:46,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:46,974 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-15 00:32:46,975 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-15 00:32:46,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:46,978 INFO L85 PathProgramCache]: Analyzing trace with hash 317693851, now seen corresponding path program 1 times [2022-04-15 00:32:46,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:46,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149528331] [2022-04-15 00:32:46,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:46,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:47,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:47,189 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-15 00:32:47,190 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-15 00:32:47,190 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-15 00:32:47,191 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-15 00:32:47,193 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-15 00:32:47,193 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-15 00:32:47,194 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-15 00:32:47,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-15 00:32:47,194 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-15 00:32:47,195 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-15 00:32:47,195 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-15 00:32:47,195 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-15 00:32:47,196 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-15 00:32:47,196 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-15 00:32:47,196 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-15 00:32:47,196 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-15 00:32:47,196 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-15 00:32:47,197 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-15 00:32:47,197 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-15 00:32:47,198 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-15 00:32:47,198 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-15 00:32:47,200 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-15 00:32:47,200 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-15 00:32:47,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:47,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149528331] [2022-04-15 00:32:47,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149528331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:47,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:47,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 00:32:47,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594396813] [2022-04-15 00:32:47,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:47,206 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-15 00:32:47,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:47,210 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-15 00:32:47,240 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-15 00:32:47,240 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 00:32:47,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:47,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 00:32:47,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 00:32:47,267 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-15 00:32:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:47,506 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2022-04-15 00:32:47,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 00:32:47,506 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-15 00:32:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:47,507 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-15 00:32:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-15 00:32:47,521 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-15 00:32:47,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-15 00:32:47,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2022-04-15 00:32:47,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:47,633 INFO L225 Difference]: With dead ends: 93 [2022-04-15 00:32:47,633 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 00:32:47,635 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-15 00:32:47,637 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-15 00:32:47,638 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-15 00:32:47,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 00:32:47,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-15 00:32:47,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:47,659 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-15 00:32:47,673 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-15 00:32:47,673 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-15 00:32:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:47,677 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-15 00:32:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-15 00:32:47,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:47,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:47,678 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-15 00:32:47,678 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-15 00:32:47,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:47,681 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-15 00:32:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-15 00:32:47,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:47,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:47,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:47,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:47,682 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-15 00:32:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-04-15 00:32:47,685 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2022-04-15 00:32:47,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:47,685 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-04-15 00:32:47,686 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-15 00:32:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-15 00:32:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 00:32:47,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:47,686 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-15 00:32:47,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:32:47,687 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-15 00:32:47,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:47,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1258576075, now seen corresponding path program 1 times [2022-04-15 00:32:47,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:47,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291775935] [2022-04-15 00:32:47,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:47,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:47,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:47,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {451#true} is VALID [2022-04-15 00:32:47,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {451#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-15 00:32:47,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {451#true} {451#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-15 00:32:47,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {451#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:47,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {451#true} is VALID [2022-04-15 00:32:47,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {451#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-15 00:32:47,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {451#true} {451#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-15 00:32:47,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {451#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#true} is VALID [2022-04-15 00:32:47,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {451#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] {451#true} is VALID [2022-04-15 00:32:47,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {451#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[] {451#true} is VALID [2022-04-15 00:32:47,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {451#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[] {451#true} is VALID [2022-04-15 00:32:47,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {451#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[] {451#true} is VALID [2022-04-15 00:32:47,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {451#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[] {451#true} is VALID [2022-04-15 00:32:47,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {451#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[] {451#true} is VALID [2022-04-15 00:32:47,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {451#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[] {451#true} is VALID [2022-04-15 00:32:47,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {451#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[] {451#true} is VALID [2022-04-15 00:32:47,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {451#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[] {451#true} is VALID [2022-04-15 00:32:47,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {451#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[] {456#(< 0 (+ main_~main__scheme~0 1))} is VALID [2022-04-15 00:32:47,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {456#(< 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[] {457#(not (<= main_~main__scheme~0 0))} is VALID [2022-04-15 00:32:47,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {457#(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] {458#(<= 1 main_~main__cp~0)} is VALID [2022-04-15 00:32:47,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {458#(<= 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] {459#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-15 00:32:47,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {459#(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[] {452#false} is VALID [2022-04-15 00:32:47,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {452#false} [263] L97-->mainErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#false} is VALID [2022-04-15 00:32:47,764 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-15 00:32:47,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:47,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291775935] [2022-04-15 00:32:47,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291775935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:47,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:47,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 00:32:47,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792266465] [2022-04-15 00:32:47,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:47,765 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-15 00:32:47,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:47,766 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-15 00:32:47,778 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-15 00:32:47,779 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:32:47,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:47,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:32:47,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:32:47,779 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-15 00:32:48,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:48,093 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-15 00:32:48,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:32:48,093 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-15 00:32:48,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:48,094 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-15 00:32:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-04-15 00:32:48,095 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-15 00:32:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-04-15 00:32:48,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 83 transitions. [2022-04-15 00:32:48,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:48,174 INFO L225 Difference]: With dead ends: 80 [2022-04-15 00:32:48,174 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 00:32:48,174 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-15 00:32:48,175 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-15 00:32:48,175 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-15 00:32:48,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 00:32:48,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-15 00:32:48,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:48,183 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-15 00:32:48,183 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-15 00:32:48,184 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-15 00:32:48,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:48,186 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-15 00:32:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-15 00:32:48,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:48,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:48,187 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-15 00:32:48,187 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-15 00:32:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:48,189 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-15 00:32:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-15 00:32:48,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:48,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:48,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:48,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:48,190 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-15 00:32:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-15 00:32:48,191 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2022-04-15 00:32:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:48,192 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-15 00:32:48,192 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-15 00:32:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-15 00:32:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 00:32:48,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:48,193 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-15 00:32:48,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:32:48,193 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-15 00:32:48,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:48,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1689129137, now seen corresponding path program 1 times [2022-04-15 00:32:48,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:48,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119886228] [2022-04-15 00:32:48,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:48,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:48,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:48,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {808#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {801#true} is VALID [2022-04-15 00:32:48,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {801#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {801#true} is VALID [2022-04-15 00:32:48,281 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {801#true} {801#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {801#true} is VALID [2022-04-15 00:32:48,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {801#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {808#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:48,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {801#true} is VALID [2022-04-15 00:32:48,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {801#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {801#true} is VALID [2022-04-15 00:32:48,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {801#true} {801#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {801#true} is VALID [2022-04-15 00:32:48,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {801#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {801#true} is VALID [2022-04-15 00:32:48,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {801#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] {801#true} is VALID [2022-04-15 00:32:48,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {801#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[] {801#true} is VALID [2022-04-15 00:32:48,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {801#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[] {801#true} is VALID [2022-04-15 00:32:48,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {801#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[] {801#true} is VALID [2022-04-15 00:32:48,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {801#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[] {801#true} is VALID [2022-04-15 00:32:48,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {801#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[] {801#true} is VALID [2022-04-15 00:32:48,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {801#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[] {801#true} is VALID [2022-04-15 00:32:48,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {801#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[] {801#true} is VALID [2022-04-15 00:32:48,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {801#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[] {801#true} is VALID [2022-04-15 00:32:48,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {801#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[] {801#true} is VALID [2022-04-15 00:32:48,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {801#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[] {801#true} is VALID [2022-04-15 00:32:48,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {801#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] {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:48,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {806#(<= (+ 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] {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:48,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {806#(<= (+ 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] {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:48,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {806#(<= (+ 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] {807#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-15 00:32:48,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {807#(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[] {802#false} is VALID [2022-04-15 00:32:48,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {802#false} [270] L113-->mainErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {802#false} is VALID [2022-04-15 00:32:48,286 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-15 00:32:48,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:48,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119886228] [2022-04-15 00:32:48,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119886228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:48,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:48,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 00:32:48,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809531388] [2022-04-15 00:32:48,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:48,287 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-15 00:32:48,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:48,288 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-15 00:32:48,299 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-15 00:32:48,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 00:32:48,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:48,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 00:32:48,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 00:32:48,300 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-15 00:32:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:48,549 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-04-15 00:32:48,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:32:48,549 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-15 00:32:48,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:48,549 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-15 00:32:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-04-15 00:32:48,550 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-15 00:32:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-04-15 00:32:48,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 106 transitions. [2022-04-15 00:32:48,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:48,657 INFO L225 Difference]: With dead ends: 101 [2022-04-15 00:32:48,657 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 00:32:48,658 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-15 00:32:48,660 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-15 00:32:48,663 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-15 00:32:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 00:32:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2022-04-15 00:32:48,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:48,684 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-15 00:32:48,684 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-15 00:32:48,684 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-15 00:32:48,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:48,687 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-15 00:32:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-15 00:32:48,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:48,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:48,689 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-15 00:32:48,689 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-15 00:32:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:48,694 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-15 00:32:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-15 00:32:48,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:48,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:48,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:48,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:48,696 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-15 00:32:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-15 00:32:48,698 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2022-04-15 00:32:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:48,698 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-15 00:32:48,698 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-15 00:32:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-15 00:32:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 00:32:48,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:48,699 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-15 00:32:48,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 00:32:48,699 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-15 00:32:48,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:48,699 INFO L85 PathProgramCache]: Analyzing trace with hash -823394398, now seen corresponding path program 1 times [2022-04-15 00:32:48,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:48,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823038813] [2022-04-15 00:32:48,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:48,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:48,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {1218#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {1210#true} is VALID [2022-04-15 00:32:48,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1210#true} is VALID [2022-04-15 00:32:48,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1210#true} {1210#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1210#true} is VALID [2022-04-15 00:32:48,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {1210#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1218#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:48,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {1218#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {1210#true} is VALID [2022-04-15 00:32:48,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1210#true} is VALID [2022-04-15 00:32:48,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1210#true} is VALID [2022-04-15 00:32:48,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {1210#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1210#true} is VALID [2022-04-15 00:32:48,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#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] {1210#true} is VALID [2022-04-15 00:32:48,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {1210#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[] {1210#true} is VALID [2022-04-15 00:32:48,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {1210#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[] {1210#true} is VALID [2022-04-15 00:32:48,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {1210#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[] {1210#true} is VALID [2022-04-15 00:32:48,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {1210#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[] {1210#true} is VALID [2022-04-15 00:32:48,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {1210#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[] {1210#true} is VALID [2022-04-15 00:32:48,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {1210#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[] {1210#true} is VALID [2022-04-15 00:32:48,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {1210#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[] {1210#true} is VALID [2022-04-15 00:32:48,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {1210#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[] {1210#true} is VALID [2022-04-15 00:32:48,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {1210#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[] {1215#(<= 0 main_~main__scheme~0)} is VALID [2022-04-15 00:32:48,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {1215#(<= 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[] {1215#(<= 0 main_~main__scheme~0)} is VALID [2022-04-15 00:32:48,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {1215#(<= 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] {1216#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:48,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {1216#(<= 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] {1216#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:48,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {1216#(<= 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] {1216#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:48,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {1216#(<= 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] {1216#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:48,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {1216#(<= 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] {1217#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-15 00:32:48,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {1217#(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[] {1211#false} is VALID [2022-04-15 00:32:48,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {1211#false} [274] L125-->mainErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1211#false} is VALID [2022-04-15 00:32:48,777 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-15 00:32:48,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:48,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823038813] [2022-04-15 00:32:48,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823038813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:48,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:48,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:48,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173271445] [2022-04-15 00:32:48,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:48,779 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-15 00:32:48,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:48,779 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-15 00:32:48,791 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-15 00:32:48,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:48,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:48,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:48,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:48,792 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-15 00:32:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:49,001 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-15 00:32:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:32:49,001 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-15 00:32:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:49,001 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-15 00:32:49,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-15 00:32:49,003 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-15 00:32:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-15 00:32:49,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2022-04-15 00:32:49,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:49,060 INFO L225 Difference]: With dead ends: 76 [2022-04-15 00:32:49,060 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 00:32:49,060 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-15 00:32:49,060 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-15 00:32:49,061 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-15 00:32:49,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 00:32:49,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-15 00:32:49,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:49,073 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-15 00:32:49,073 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-15 00:32:49,073 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-15 00:32:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:49,075 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-15 00:32:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-15 00:32:49,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:49,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:49,075 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-15 00:32:49,076 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-15 00:32:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:49,077 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-15 00:32:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-15 00:32:49,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:49,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:49,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:49,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:49,078 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-15 00:32:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-04-15 00:32:49,079 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2022-04-15 00:32:49,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:49,079 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-04-15 00:32:49,079 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-15 00:32:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-15 00:32:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 00:32:49,080 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:49,080 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-15 00:32:49,080 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 00:32:49,080 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-15 00:32:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1183023144, now seen corresponding path program 1 times [2022-04-15 00:32:49,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:49,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232723046] [2022-04-15 00:32:49,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:49,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:49,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {1549#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {1541#true} is VALID [2022-04-15 00:32:49,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {1541#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1541#true} is VALID [2022-04-15 00:32:49,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1541#true} {1541#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1541#true} is VALID [2022-04-15 00:32:49,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {1541#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1549#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:49,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {1549#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {1541#true} is VALID [2022-04-15 00:32:49,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {1541#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1541#true} is VALID [2022-04-15 00:32:49,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1541#true} {1541#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1541#true} is VALID [2022-04-15 00:32:49,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {1541#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1541#true} is VALID [2022-04-15 00:32:49,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {1541#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] {1541#true} is VALID [2022-04-15 00:32:49,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {1541#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[] {1541#true} is VALID [2022-04-15 00:32:49,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {1541#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[] {1541#true} is VALID [2022-04-15 00:32:49,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {1541#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[] {1541#true} is VALID [2022-04-15 00:32:49,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {1541#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[] {1541#true} is VALID [2022-04-15 00:32:49,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {1541#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[] {1541#true} is VALID [2022-04-15 00:32:49,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {1541#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[] {1541#true} is VALID [2022-04-15 00:32:49,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {1541#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[] {1541#true} is VALID [2022-04-15 00:32:49,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {1541#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[] {1541#true} is VALID [2022-04-15 00:32:49,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {1541#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[] {1541#true} is VALID [2022-04-15 00:32:49,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {1541#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[] {1541#true} is VALID [2022-04-15 00:32:49,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {1541#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] {1541#true} is VALID [2022-04-15 00:32:49,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {1541#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] {1541#true} is VALID [2022-04-15 00:32:49,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {1541#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] {1541#true} is VALID [2022-04-15 00:32:49,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {1541#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] {1546#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-15 00:32:49,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {1546#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} [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] {1547#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:49,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {1547#(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[] {1547#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:49,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {1547#(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] {1547#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:49,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {1547#(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] {1548#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-15 00:32:49,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {1548#(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[] {1542#false} is VALID [2022-04-15 00:32:49,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {1542#false} [285] L374-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#false} is VALID [2022-04-15 00:32:49,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-15 00:32:49,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:49,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232723046] [2022-04-15 00:32:49,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232723046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:49,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:49,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:49,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757704340] [2022-04-15 00:32:49,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:49,152 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-15 00:32:49,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:49,152 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-15 00:32:49,166 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-15 00:32:49,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:49,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:49,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:49,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:49,167 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-15 00:32:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:49,723 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-04-15 00:32:49,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:32:49,723 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-15 00:32:49,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:49,723 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-15 00:32:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2022-04-15 00:32:49,725 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-15 00:32:49,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2022-04-15 00:32:49,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 147 transitions. [2022-04-15 00:32:49,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:49,846 INFO L225 Difference]: With dead ends: 141 [2022-04-15 00:32:49,846 INFO L226 Difference]: Without dead ends: 139 [2022-04-15 00:32:49,847 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-15 00:32:49,847 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-15 00:32:49,848 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-15 00:32:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-15 00:32:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2022-04-15 00:32:49,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:49,863 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-15 00:32:49,863 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-15 00:32:49,863 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-15 00:32:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:49,865 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-15 00:32:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-15 00:32:49,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:49,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:49,866 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-15 00:32:49,866 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-15 00:32:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:49,868 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-15 00:32:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-15 00:32:49,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:49,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:49,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:49,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:49,869 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-15 00:32:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-15 00:32:49,870 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2022-04-15 00:32:49,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:49,870 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-15 00:32:49,871 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-15 00:32:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-15 00:32:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 00:32:49,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:49,871 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-15 00:32:49,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 00:32:49,871 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-15 00:32:49,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1182992326, now seen corresponding path program 1 times [2022-04-15 00:32:49,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:49,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47090432] [2022-04-15 00:32:49,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:49,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:49,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {2088#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {2080#true} is VALID [2022-04-15 00:32:49,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {2080#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2080#true} is VALID [2022-04-15 00:32:49,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2080#true} {2080#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2080#true} is VALID [2022-04-15 00:32:49,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {2080#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2088#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:49,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {2088#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {2080#true} is VALID [2022-04-15 00:32:49,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {2080#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2080#true} is VALID [2022-04-15 00:32:49,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2080#true} {2080#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2080#true} is VALID [2022-04-15 00:32:49,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {2080#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2080#true} is VALID [2022-04-15 00:32:49,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {2080#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] {2080#true} is VALID [2022-04-15 00:32:49,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {2080#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[] {2080#true} is VALID [2022-04-15 00:32:49,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {2080#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[] {2080#true} is VALID [2022-04-15 00:32:49,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {2080#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[] {2080#true} is VALID [2022-04-15 00:32:49,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {2080#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[] {2080#true} is VALID [2022-04-15 00:32:49,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {2080#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[] {2080#true} is VALID [2022-04-15 00:32:49,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {2080#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[] {2080#true} is VALID [2022-04-15 00:32:49,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {2080#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[] {2080#true} is VALID [2022-04-15 00:32:49,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {2080#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[] {2080#true} is VALID [2022-04-15 00:32:49,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {2080#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[] {2080#true} is VALID [2022-04-15 00:32:49,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {2080#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[] {2080#true} is VALID [2022-04-15 00:32:49,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {2080#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] {2080#true} is VALID [2022-04-15 00:32:49,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {2080#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] {2080#true} is VALID [2022-04-15 00:32:49,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {2080#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] {2080#true} is VALID [2022-04-15 00:32:49,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {2080#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] {2085#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-15 00:32:49,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {2085#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} [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] {2086#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:49,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {2086#(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[] {2086#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:49,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {2086#(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[] {2086#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:49,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {2086#(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] {2087#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-15 00:32:49,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {2087#(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[] {2081#false} is VALID [2022-04-15 00:32:49,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {2081#false} [289] L145-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2081#false} is VALID [2022-04-15 00:32:49,934 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-15 00:32:49,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:49,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47090432] [2022-04-15 00:32:49,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47090432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:49,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:49,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:49,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959052147] [2022-04-15 00:32:49,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:49,935 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-15 00:32:49,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:49,935 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-15 00:32:49,951 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-15 00:32:49,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:49,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:49,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:49,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:49,951 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-15 00:32:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:50,356 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2022-04-15 00:32:50,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:32:50,357 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-15 00:32:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:50,358 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-15 00:32:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-04-15 00:32:50,363 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-15 00:32:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-04-15 00:32:50,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 114 transitions. [2022-04-15 00:32:50,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:50,451 INFO L225 Difference]: With dead ends: 108 [2022-04-15 00:32:50,452 INFO L226 Difference]: Without dead ends: 106 [2022-04-15 00:32:50,452 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-15 00:32:50,452 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-15 00:32:50,452 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-15 00:32:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-15 00:32:50,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2022-04-15 00:32:50,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:50,473 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-15 00:32:50,473 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-15 00:32:50,473 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-15 00:32:50,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:50,475 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-15 00:32:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-15 00:32:50,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:50,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:50,476 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-15 00:32:50,476 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-15 00:32:50,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:50,478 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-15 00:32:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-15 00:32:50,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:50,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:50,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:50,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:50,478 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-15 00:32:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-04-15 00:32:50,479 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2022-04-15 00:32:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:50,481 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-04-15 00:32:50,481 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-15 00:32:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-15 00:32:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 00:32:50,481 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:50,481 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-15 00:32:50,481 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 00:32:50,481 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-15 00:32:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:50,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1980989516, now seen corresponding path program 1 times [2022-04-15 00:32:50,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:50,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330271528] [2022-04-15 00:32:50,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:50,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:50,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:50,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {2530#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {2522#true} is VALID [2022-04-15 00:32:50,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {2522#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2522#true} is VALID [2022-04-15 00:32:50,545 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2522#true} {2522#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2522#true} is VALID [2022-04-15 00:32:50,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {2522#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2530#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:50,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {2530#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {2522#true} is VALID [2022-04-15 00:32:50,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {2522#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2522#true} is VALID [2022-04-15 00:32:50,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2522#true} {2522#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2522#true} is VALID [2022-04-15 00:32:50,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {2522#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2522#true} is VALID [2022-04-15 00:32:50,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {2522#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] {2522#true} is VALID [2022-04-15 00:32:50,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {2522#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[] {2522#true} is VALID [2022-04-15 00:32:50,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {2522#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[] {2522#true} is VALID [2022-04-15 00:32:50,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {2522#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[] {2522#true} is VALID [2022-04-15 00:32:50,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {2522#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[] {2522#true} is VALID [2022-04-15 00:32:50,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {2522#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[] {2522#true} is VALID [2022-04-15 00:32:50,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {2522#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[] {2522#true} is VALID [2022-04-15 00:32:50,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {2522#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[] {2522#true} is VALID [2022-04-15 00:32:50,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {2522#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[] {2522#true} is VALID [2022-04-15 00:32:50,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {2522#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[] {2522#true} is VALID [2022-04-15 00:32:50,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {2522#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[] {2522#true} is VALID [2022-04-15 00:32:50,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {2522#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] {2522#true} is VALID [2022-04-15 00:32:50,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {2522#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] {2522#true} is VALID [2022-04-15 00:32:50,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {2522#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] {2522#true} is VALID [2022-04-15 00:32:50,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {2522#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] {2522#true} is VALID [2022-04-15 00:32:50,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {2522#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] {2527#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} is VALID [2022-04-15 00:32:50,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {2527#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} [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[] {2528#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:50,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {2528#(<= 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] {2528#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:50,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {2528#(<= 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] {2528#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:50,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {2528#(<= 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] {2529#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-15 00:32:50,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {2529#(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[] {2523#false} is VALID [2022-04-15 00:32:50,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {2523#false} [293] L386-->mainErr17ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2523#false} is VALID [2022-04-15 00:32:50,550 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-15 00:32:50,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:50,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330271528] [2022-04-15 00:32:50,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330271528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:50,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:50,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:50,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909413193] [2022-04-15 00:32:50,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:50,551 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-15 00:32:50,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:50,551 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-15 00:32:50,565 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-15 00:32:50,565 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:50,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:50,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:50,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:50,566 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-15 00:32:50,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:50,902 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2022-04-15 00:32:50,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:32:50,902 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-15 00:32:50,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:50,902 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-15 00:32:50,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2022-04-15 00:32:50,904 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-15 00:32:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2022-04-15 00:32:50,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 125 transitions. [2022-04-15 00:32:51,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:51,010 INFO L225 Difference]: With dead ends: 121 [2022-04-15 00:32:51,010 INFO L226 Difference]: Without dead ends: 119 [2022-04-15 00:32:51,011 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-15 00:32:51,011 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-15 00:32:51,011 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-15 00:32:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-15 00:32:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2022-04-15 00:32:51,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:51,040 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-15 00:32:51,040 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-15 00:32:51,040 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-15 00:32:51,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:51,042 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-15 00:32:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-15 00:32:51,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:51,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:51,043 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-15 00:32:51,043 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-15 00:32:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:51,045 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-15 00:32:51,045 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-15 00:32:51,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:51,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:51,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:51,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:51,046 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-15 00:32:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-15 00:32:51,047 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2022-04-15 00:32:51,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:51,047 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-15 00:32:51,047 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-15 00:32:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-15 00:32:51,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 00:32:51,048 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:51,048 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-15 00:32:51,048 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 00:32:51,048 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-15 00:32:51,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1981944876, now seen corresponding path program 1 times [2022-04-15 00:32:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:51,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217017684] [2022-04-15 00:32:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {3006#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {2998#true} is VALID [2022-04-15 00:32:51,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {2998#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2998#true} is VALID [2022-04-15 00:32:51,115 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2998#true} {2998#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2998#true} is VALID [2022-04-15 00:32:51,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {2998#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3006#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:51,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {3006#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {2998#true} is VALID [2022-04-15 00:32:51,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {2998#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2998#true} is VALID [2022-04-15 00:32:51,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2998#true} {2998#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2998#true} is VALID [2022-04-15 00:32:51,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {2998#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2998#true} is VALID [2022-04-15 00:32:51,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {2998#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] {2998#true} is VALID [2022-04-15 00:32:51,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {2998#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[] {2998#true} is VALID [2022-04-15 00:32:51,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {2998#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[] {2998#true} is VALID [2022-04-15 00:32:51,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {2998#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[] {2998#true} is VALID [2022-04-15 00:32:51,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {2998#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[] {2998#true} is VALID [2022-04-15 00:32:51,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {2998#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[] {2998#true} is VALID [2022-04-15 00:32:51,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {2998#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[] {2998#true} is VALID [2022-04-15 00:32:51,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {2998#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[] {2998#true} is VALID [2022-04-15 00:32:51,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {2998#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[] {2998#true} is VALID [2022-04-15 00:32:51,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {2998#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[] {2998#true} is VALID [2022-04-15 00:32:51,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {2998#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[] {2998#true} is VALID [2022-04-15 00:32:51,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {2998#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] {2998#true} is VALID [2022-04-15 00:32:51,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {2998#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] {2998#true} is VALID [2022-04-15 00:32:51,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {2998#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] {2998#true} is VALID [2022-04-15 00:32:51,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {2998#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] {2998#true} is VALID [2022-04-15 00:32:51,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {2998#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] {3003#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} is VALID [2022-04-15 00:32:51,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {3003#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} [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[] {3004#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:51,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {3004#(<= 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[] {3004#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:51,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {3004#(<= 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] {3004#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:51,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {3004#(<= 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] {3005#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-15 00:32:51,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {3005#(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[] {2999#false} is VALID [2022-04-15 00:32:51,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {2999#false} [295] L157-->mainErr5ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2999#false} is VALID [2022-04-15 00:32:51,119 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-15 00:32:51,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:51,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217017684] [2022-04-15 00:32:51,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217017684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:51,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:51,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:51,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640940628] [2022-04-15 00:32:51,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:51,120 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-15 00:32:51,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:51,120 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-15 00:32:51,135 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-15 00:32:51,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:51,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:51,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:51,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:51,135 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-15 00:32:51,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:51,456 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-04-15 00:32:51,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:32:51,456 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-15 00:32:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:51,456 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-15 00:32:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-15 00:32:51,458 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-15 00:32:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-15 00:32:51,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-15 00:32:51,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:51,514 INFO L225 Difference]: With dead ends: 77 [2022-04-15 00:32:51,514 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 00:32:51,515 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-15 00:32:51,515 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-15 00:32:51,515 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-15 00:32:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 00:32:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-15 00:32:51,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:51,533 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-15 00:32:51,533 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-15 00:32:51,533 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-15 00:32:51,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:51,535 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-15 00:32:51,535 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-15 00:32:51,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:51,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:51,535 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-15 00:32:51,535 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-15 00:32:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:51,537 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-15 00:32:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-15 00:32:51,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:51,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:51,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:51,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:51,537 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-15 00:32:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-04-15 00:32:51,538 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2022-04-15 00:32:51,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:51,538 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-04-15 00:32:51,538 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-15 00:32:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-15 00:32:51,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 00:32:51,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:51,539 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-15 00:32:51,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 00:32:51,539 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-15 00:32:51,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1978555952, now seen corresponding path program 1 times [2022-04-15 00:32:51,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:51,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113528366] [2022-04-15 00:32:51,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:51,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {3343#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {3337#true} is VALID [2022-04-15 00:32:51,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {3337#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3337#true} is VALID [2022-04-15 00:32:51,578 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3337#true} {3337#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3337#true} is VALID [2022-04-15 00:32:51,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {3337#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3343#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:51,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {3343#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {3337#true} is VALID [2022-04-15 00:32:51,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {3337#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3337#true} is VALID [2022-04-15 00:32:51,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3337#true} {3337#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3337#true} is VALID [2022-04-15 00:32:51,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {3337#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3337#true} is VALID [2022-04-15 00:32:51,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {3337#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] {3337#true} is VALID [2022-04-15 00:32:51,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {3337#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[] {3337#true} is VALID [2022-04-15 00:32:51,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {3337#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[] {3337#true} is VALID [2022-04-15 00:32:51,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {3337#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[] {3337#true} is VALID [2022-04-15 00:32:51,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {3337#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[] {3337#true} is VALID [2022-04-15 00:32:51,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {3337#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[] {3337#true} is VALID [2022-04-15 00:32:51,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {3337#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[] {3337#true} is VALID [2022-04-15 00:32:51,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {3337#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[] {3337#true} is VALID [2022-04-15 00:32:51,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {3337#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[] {3337#true} is VALID [2022-04-15 00:32:51,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {3337#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[] {3337#true} is VALID [2022-04-15 00:32:51,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {3337#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[] {3337#true} is VALID [2022-04-15 00:32:51,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {3337#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] {3337#true} is VALID [2022-04-15 00:32:51,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {3337#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] {3337#true} is VALID [2022-04-15 00:32:51,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {3337#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] {3337#true} is VALID [2022-04-15 00:32:51,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {3337#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] {3337#true} is VALID [2022-04-15 00:32:51,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {3337#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] {3337#true} is VALID [2022-04-15 00:32:51,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {3337#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[] {3337#true} is VALID [2022-04-15 00:32:51,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {3337#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[] {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-15 00:32:51,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {3342#(= (+ (- 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] {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-15 00:32:51,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {3342#(= (+ (- 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] {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-15 00:32:51,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {3342#(= (+ (- 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[] {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-15 00:32:51,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {3342#(= (+ (- 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] {3338#false} is VALID [2022-04-15 00:32:51,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {3338#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[] {3338#false} is VALID [2022-04-15 00:32:51,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {3338#false} [301] L177-->mainErr6ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3338#false} is VALID [2022-04-15 00:32:51,583 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-15 00:32:51,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:51,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113528366] [2022-04-15 00:32:51,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113528366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:51,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:51,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 00:32:51,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189181820] [2022-04-15 00:32:51,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:51,584 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-15 00:32:51,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:51,584 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-15 00:32:51,599 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-15 00:32:51,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 00:32:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:51,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 00:32:51,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 00:32:51,599 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-15 00:32:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:51,755 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-04-15 00:32:51,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 00:32:51,756 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-15 00:32:51,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:51,756 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-15 00:32:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-15 00:32:51,757 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-15 00:32:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-15 00:32:51,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-15 00:32:51,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:51,833 INFO L225 Difference]: With dead ends: 115 [2022-04-15 00:32:51,833 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 00:32:51,833 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-15 00:32:51,834 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:51,834 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 78 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:32:51,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 00:32:51,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-15 00:32:51,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:51,865 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-15 00:32:51,865 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-15 00:32:51,865 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-15 00:32:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:51,866 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-15 00:32:51,866 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-15 00:32:51,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:51,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:51,867 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-15 00:32:51,867 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-15 00:32:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:51,868 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-15 00:32:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-15 00:32:51,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:51,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:51,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:51,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:51,868 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-15 00:32:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-04-15 00:32:51,870 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2022-04-15 00:32:51,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:51,870 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-04-15 00:32:51,870 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-15 00:32:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-15 00:32:51,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 00:32:51,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:51,870 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-15 00:32:51,870 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 00:32:51,871 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-15 00:32:51,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:51,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1860757727, now seen corresponding path program 1 times [2022-04-15 00:32:51,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:51,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441400834] [2022-04-15 00:32:51,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:51,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {3719#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {3711#true} is VALID [2022-04-15 00:32:51,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {3711#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3711#true} is VALID [2022-04-15 00:32:51,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3711#true} {3711#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3711#true} is VALID [2022-04-15 00:32:51,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {3711#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3719#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:51,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {3719#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {3711#true} is VALID [2022-04-15 00:32:51,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {3711#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3711#true} is VALID [2022-04-15 00:32:51,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3711#true} {3711#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3711#true} is VALID [2022-04-15 00:32:51,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {3711#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3711#true} is VALID [2022-04-15 00:32:51,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {3711#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] {3711#true} is VALID [2022-04-15 00:32:51,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {3711#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[] {3711#true} is VALID [2022-04-15 00:32:51,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {3711#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[] {3711#true} is VALID [2022-04-15 00:32:51,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {3711#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[] {3711#true} is VALID [2022-04-15 00:32:51,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {3711#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[] {3711#true} is VALID [2022-04-15 00:32:51,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {3711#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[] {3711#true} is VALID [2022-04-15 00:32:51,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {3711#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[] {3711#true} is VALID [2022-04-15 00:32:51,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {3711#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[] {3711#true} is VALID [2022-04-15 00:32:51,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {3711#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[] {3711#true} is VALID [2022-04-15 00:32:51,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {3711#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[] {3711#true} is VALID [2022-04-15 00:32:51,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {3711#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[] {3711#true} is VALID [2022-04-15 00:32:51,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {3711#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] {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:51,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {3716#(< 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] {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:51,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {3716#(< 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] {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:51,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {3716#(< 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] {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:51,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {3716#(< 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] {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:51,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {3716#(< 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[] {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:51,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {3716#(< 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] {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-15 00:32:51,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} [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[] {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-15 00:32:51,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} [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] {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-15 00:32:51,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} [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] {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-15 00:32:51,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} [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[] {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-15 00:32:51,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} [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] {3718#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-15 00:32:51,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {3718#(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[] {3712#false} is VALID [2022-04-15 00:32:51,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {3712#false} [301] L177-->mainErr6ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3712#false} is VALID [2022-04-15 00:32:51,948 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-15 00:32:51,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:51,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441400834] [2022-04-15 00:32:51,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441400834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:51,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:51,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270597229] [2022-04-15 00:32:51,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:51,949 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-15 00:32:51,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:51,949 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-15 00:32:51,967 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-15 00:32:51,968 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:51,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:51,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:51,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:51,968 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-15 00:32:52,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:52,193 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-15 00:32:52,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:32:52,193 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-15 00:32:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:52,194 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-15 00:32:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-15 00:32:52,198 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-15 00:32:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-15 00:32:52,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-15 00:32:52,262 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-15 00:32:52,263 INFO L225 Difference]: With dead ends: 76 [2022-04-15 00:32:52,263 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 00:32:52,263 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-15 00:32:52,264 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 142 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:52,264 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 67 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:32:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 00:32:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-04-15 00:32:52,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:52,288 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-15 00:32:52,288 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-15 00:32:52,288 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-15 00:32:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:52,289 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-15 00:32:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-15 00:32:52,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:52,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:52,290 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-15 00:32:52,290 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-15 00:32:52,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:52,291 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-15 00:32:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-15 00:32:52,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:52,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:52,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:52,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:52,291 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-15 00:32:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-04-15 00:32:52,292 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2022-04-15 00:32:52,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:52,292 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-04-15 00:32:52,293 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-15 00:32:52,293 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-15 00:32:52,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 00:32:52,293 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:52,293 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-15 00:32:52,293 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 00:32:52,293 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-15 00:32:52,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:52,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1486248991, now seen corresponding path program 1 times [2022-04-15 00:32:52,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:52,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800915771] [2022-04-15 00:32:52,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:52,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {4056#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {4048#true} is VALID [2022-04-15 00:32:52,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {4048#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4048#true} is VALID [2022-04-15 00:32:52,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4048#true} {4048#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4048#true} is VALID [2022-04-15 00:32:52,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {4048#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4056#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:52,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {4056#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {4048#true} is VALID [2022-04-15 00:32:52,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {4048#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4048#true} is VALID [2022-04-15 00:32:52,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4048#true} {4048#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4048#true} is VALID [2022-04-15 00:32:52,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {4048#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4048#true} is VALID [2022-04-15 00:32:52,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {4048#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] {4048#true} is VALID [2022-04-15 00:32:52,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {4048#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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {4053#(< 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {4053#(< 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {4053#(< 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {4053#(< 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {4053#(< 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[] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {4053#(< 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] {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {4054#(< (+ 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] {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {4054#(< (+ 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] {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {4054#(< (+ 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {4053#(< 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {4053#(< 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] {4055#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-15 00:32:52,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {4055#(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[] {4049#false} is VALID [2022-04-15 00:32:52,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {4049#false} [285] L374-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4049#false} is VALID [2022-04-15 00:32:52,359 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-15 00:32:52,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:52,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800915771] [2022-04-15 00:32:52,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800915771] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:32:52,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89518224] [2022-04-15 00:32:52,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:52,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:32:52,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:32:52,361 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-15 00:32:52,389 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-15 00:32:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 00:32:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:32:52,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {4048#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4048#true} is VALID [2022-04-15 00:32:52,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {4048#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] {4048#true} is VALID [2022-04-15 00:32:52,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {4048#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4048#true} is VALID [2022-04-15 00:32:52,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4048#true} {4048#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4048#true} is VALID [2022-04-15 00:32:52,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {4048#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4048#true} is VALID [2022-04-15 00:32:52,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {4048#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] {4048#true} is VALID [2022-04-15 00:32:52,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {4048#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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {4053#(< 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {4053#(< 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {4053#(< 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {4053#(< 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {4053#(< 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[] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {4053#(< 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] {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {4054#(< (+ 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] {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {4054#(< (+ 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] {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {4054#(< (+ 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {4053#(< 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {4053#(< 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] {4141#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID [2022-04-15 00:32:52,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {4141#(<= 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[] {4049#false} is VALID [2022-04-15 00:32:52,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {4049#false} [285] L374-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4049#false} is VALID [2022-04-15 00:32:52,635 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-15 00:32:52,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:32:52,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {4049#false} [285] L374-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4049#false} is VALID [2022-04-15 00:32:52,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {4141#(<= 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[] {4049#false} is VALID [2022-04-15 00:32:52,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {4053#(< 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] {4141#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID [2022-04-15 00:32:52,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {4053#(< 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {4054#(< (+ 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {4054#(< (+ 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] {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {4054#(< (+ 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] {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {4053#(< 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] {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {4053#(< 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[] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {4053#(< 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {4053#(< 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {4053#(< 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {4053#(< 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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {4048#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] {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:52,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {4048#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[] {4048#true} is VALID [2022-04-15 00:32:52,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {4048#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] {4048#true} is VALID [2022-04-15 00:32:52,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {4048#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4048#true} is VALID [2022-04-15 00:32:52,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4048#true} {4048#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4048#true} is VALID [2022-04-15 00:32:52,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {4048#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4048#true} is VALID [2022-04-15 00:32:52,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {4048#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] {4048#true} is VALID [2022-04-15 00:32:52,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {4048#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4048#true} is VALID [2022-04-15 00:32:52,814 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-15 00:32:52,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89518224] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:32:52,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:32:52,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-15 00:32:52,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395190952] [2022-04-15 00:32:52,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:32:52,815 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-15 00:32:52,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:52,815 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-15 00:32:52,836 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-15 00:32:52,836 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:32:52,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:52,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:32:52,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:32:52,837 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-15 00:32:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:53,184 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-15 00:32:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:32:53,184 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-15 00:32:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:53,185 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-15 00:32:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-04-15 00:32:53,186 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-15 00:32:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-04-15 00:32:53,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2022-04-15 00:32:53,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:53,275 INFO L225 Difference]: With dead ends: 111 [2022-04-15 00:32:53,275 INFO L226 Difference]: Without dead ends: 109 [2022-04-15 00:32:53,275 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-15 00:32:53,275 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 230 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:53,276 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 87 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:32:53,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-15 00:32:53,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2022-04-15 00:32:53,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:53,302 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-15 00:32:53,302 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-15 00:32:53,302 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-15 00:32:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:53,304 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-15 00:32:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-15 00:32:53,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:53,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:53,304 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-15 00:32:53,304 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-15 00:32:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:53,306 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-15 00:32:53,306 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-15 00:32:53,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:53,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:53,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:53,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:53,306 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-15 00:32:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-15 00:32:53,307 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2022-04-15 00:32:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:53,307 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-15 00:32:53,307 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-15 00:32:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-15 00:32:53,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 00:32:53,307 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:53,307 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-15 00:32:53,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 00:32:53,523 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-15 00:32:53,524 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-15 00:32:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1848916017, now seen corresponding path program 1 times [2022-04-15 00:32:53,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:53,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649693188] [2022-04-15 00:32:53,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:53,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:53,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:53,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {4676#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {4668#true} is VALID [2022-04-15 00:32:53,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {4668#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4668#true} is VALID [2022-04-15 00:32:53,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4668#true} {4668#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4668#true} is VALID [2022-04-15 00:32:53,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {4668#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:53,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {4676#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {4668#true} is VALID [2022-04-15 00:32:53,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {4668#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4668#true} is VALID [2022-04-15 00:32:53,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4668#true} {4668#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4668#true} is VALID [2022-04-15 00:32:53,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {4668#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4668#true} is VALID [2022-04-15 00:32:53,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {4668#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] {4668#true} is VALID [2022-04-15 00:32:53,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {4668#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[] {4668#true} is VALID [2022-04-15 00:32:53,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {4668#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[] {4668#true} is VALID [2022-04-15 00:32:53,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {4668#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[] {4668#true} is VALID [2022-04-15 00:32:53,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {4668#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[] {4668#true} is VALID [2022-04-15 00:32:53,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {4668#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[] {4668#true} is VALID [2022-04-15 00:32:53,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {4668#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[] {4668#true} is VALID [2022-04-15 00:32:53,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {4668#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[] {4668#true} is VALID [2022-04-15 00:32:53,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {4668#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[] {4668#true} is VALID [2022-04-15 00:32:53,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {4668#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[] {4673#(<= 0 main_~main__scheme~0)} is VALID [2022-04-15 00:32:53,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {4673#(<= 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[] {4673#(<= 0 main_~main__scheme~0)} is VALID [2022-04-15 00:32:53,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {4673#(<= 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] {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:53,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {4674#(<= 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] {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:53,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {4674#(<= 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] {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:53,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {4674#(<= 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] {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:53,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {4674#(<= 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] {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:53,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {4674#(<= 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[] {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:53,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {4674#(<= 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] {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:53,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {4674#(<= 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[] {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:53,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {4674#(<= 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] {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:53,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {4674#(<= 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] {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:53,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {4674#(<= 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[] {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:53,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {4674#(<= 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] {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:53,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {4674#(<= 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] {4675#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-15 00:32:53,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {4675#(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[] {4669#false} is VALID [2022-04-15 00:32:53,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {4669#false} [305] L189-->mainErr7ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4669#false} is VALID [2022-04-15 00:32:53,576 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-15 00:32:53,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:53,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649693188] [2022-04-15 00:32:53,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649693188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:53,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:53,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:53,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747511161] [2022-04-15 00:32:53,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:53,577 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-15 00:32:53,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:53,577 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-15 00:32:53,592 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-15 00:32:53,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:53,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:53,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:53,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:53,593 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-15 00:32:53,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:53,797 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-15 00:32:53,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:32:53,798 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-15 00:32:53,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:53,798 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-15 00:32:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-15 00:32:53,799 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-15 00:32:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-15 00:32:53,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-04-15 00:32:53,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:53,868 INFO L225 Difference]: With dead ends: 70 [2022-04-15 00:32:53,868 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 00:32:53,868 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-15 00:32:53,869 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 170 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:53,869 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 60 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:32:53,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 00:32:53,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-15 00:32:53,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:53,892 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-15 00:32:53,892 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-15 00:32:53,892 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-15 00:32:53,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:53,896 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-15 00:32:53,896 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-15 00:32:53,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:53,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:53,897 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-15 00:32:53,897 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-15 00:32:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:53,897 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-15 00:32:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-15 00:32:53,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:53,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:53,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:53,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:53,898 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-15 00:32:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-04-15 00:32:53,899 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2022-04-15 00:32:53,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:53,899 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-04-15 00:32:53,899 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-15 00:32:53,899 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-15 00:32:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 00:32:53,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:53,900 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-15 00:32:53,900 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 00:32:53,900 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-15 00:32:53,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:53,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1170891010, now seen corresponding path program 1 times [2022-04-15 00:32:53,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:53,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108440551] [2022-04-15 00:32:53,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:53,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:53,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {4987#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {4979#true} is VALID [2022-04-15 00:32:53,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {4979#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4979#true} is VALID [2022-04-15 00:32:53,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4979#true} {4979#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4979#true} is VALID [2022-04-15 00:32:53,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {4979#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4987#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:53,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {4987#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {4979#true} is VALID [2022-04-15 00:32:53,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {4979#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4979#true} is VALID [2022-04-15 00:32:53,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4979#true} {4979#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4979#true} is VALID [2022-04-15 00:32:53,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {4979#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4979#true} is VALID [2022-04-15 00:32:53,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {4979#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] {4979#true} is VALID [2022-04-15 00:32:53,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:53,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:53,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:53,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:53,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:53,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:53,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:53,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:53,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:53,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:53,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {4979#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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:53,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {4984#(< 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:53,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {4984#(< 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:53,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {4984#(< 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:53,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {4984#(< 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:53,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {4984#(< 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[] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:53,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {4984#(< 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] {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:53,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {4985#(< (+ 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] {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:53,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {4985#(< (+ 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] {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:53,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {4985#(< (+ 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:53,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {4984#(< 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:53,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {4984#(< 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[] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:53,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {4984#(< 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] {4986#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-15 00:32:53,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {4986#(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[] {4980#false} is VALID [2022-04-15 00:32:53,961 INFO L290 TraceCheckUtils]: 30: Hoare triple {4980#false} [289] L145-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4980#false} is VALID [2022-04-15 00:32:53,961 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-15 00:32:53,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:53,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108440551] [2022-04-15 00:32:53,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108440551] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:32:53,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006139797] [2022-04-15 00:32:53,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:53,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:32:53,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:32:53,963 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-15 00:32:53,983 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-15 00:32:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:54,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 00:32:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:54,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:32:54,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {4979#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4979#true} is VALID [2022-04-15 00:32:54,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {4979#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] {4979#true} is VALID [2022-04-15 00:32:54,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {4979#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4979#true} is VALID [2022-04-15 00:32:54,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4979#true} {4979#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4979#true} is VALID [2022-04-15 00:32:54,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {4979#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4979#true} is VALID [2022-04-15 00:32:54,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {4979#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] {4979#true} is VALID [2022-04-15 00:32:54,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {4979#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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {4984#(< 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {4984#(< 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {4984#(< 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {4984#(< 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {4984#(< 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[] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {4984#(< 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] {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {4985#(< (+ 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] {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {4985#(< (+ 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] {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {4985#(< (+ 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {4984#(< 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {4984#(< 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[] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {4984#(< 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] {5075#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID [2022-04-15 00:32:54,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {5075#(<= 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[] {4980#false} is VALID [2022-04-15 00:32:54,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {4980#false} [289] L145-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4980#false} is VALID [2022-04-15 00:32:54,161 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-15 00:32:54,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:32:54,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {4980#false} [289] L145-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4980#false} is VALID [2022-04-15 00:32:54,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {5075#(<= 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[] {4980#false} is VALID [2022-04-15 00:32:54,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {4984#(< 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] {5075#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID [2022-04-15 00:32:54,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {4984#(< 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[] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {4984#(< 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {4985#(< (+ 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {4985#(< (+ 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] {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {4985#(< (+ 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] {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {4984#(< 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] {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {4984#(< 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[] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {4984#(< 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {4984#(< 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {4984#(< 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {4984#(< 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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {4979#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] {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {4979#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[] {4979#true} is VALID [2022-04-15 00:32:54,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {4979#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] {4979#true} is VALID [2022-04-15 00:32:54,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {4979#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4979#true} is VALID [2022-04-15 00:32:54,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4979#true} {4979#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4979#true} is VALID [2022-04-15 00:32:54,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {4979#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4979#true} is VALID [2022-04-15 00:32:54,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {4979#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] {4979#true} is VALID [2022-04-15 00:32:54,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {4979#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4979#true} is VALID [2022-04-15 00:32:54,296 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-15 00:32:54,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006139797] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:32:54,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:32:54,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-15 00:32:54,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359634701] [2022-04-15 00:32:54,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:32:54,296 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-15 00:32:54,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:54,297 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-15 00:32:54,321 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-15 00:32:54,321 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:32:54,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:54,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:32:54,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:32:54,322 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-15 00:32:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:54,553 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-15 00:32:54,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:32:54,553 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-15 00:32:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:54,553 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-15 00:32:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-15 00:32:54,554 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-15 00:32:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-15 00:32:54,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-15 00:32:54,602 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-15 00:32:54,603 INFO L225 Difference]: With dead ends: 69 [2022-04-15 00:32:54,603 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 00:32:54,603 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-15 00:32:54,603 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 130 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:54,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 66 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:32:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 00:32:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-04-15 00:32:54,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:54,618 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-15 00:32:54,619 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-15 00:32:54,619 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-15 00:32:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:54,620 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-15 00:32:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-15 00:32:54,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:54,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:54,620 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-15 00:32:54,620 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-15 00:32:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:54,621 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-15 00:32:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-15 00:32:54,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:54,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:54,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:54,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:54,621 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-15 00:32:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-04-15 00:32:54,622 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2022-04-15 00:32:54,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:54,622 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-04-15 00:32:54,622 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-15 00:32:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-04-15 00:32:54,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 00:32:54,622 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:54,622 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-15 00:32:54,638 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-15 00:32:54,831 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-15 00:32:54,831 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-15 00:32:54,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:54,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1897188956, now seen corresponding path program 1 times [2022-04-15 00:32:54,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:54,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843996373] [2022-04-15 00:32:54,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:54,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:54,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:54,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {5474#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {5466#true} is VALID [2022-04-15 00:32:54,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {5466#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5466#true} is VALID [2022-04-15 00:32:54,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5466#true} {5466#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5466#true} is VALID [2022-04-15 00:32:54,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {5466#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5474#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:54,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {5474#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {5466#true} is VALID [2022-04-15 00:32:54,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {5466#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5466#true} is VALID [2022-04-15 00:32:54,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5466#true} {5466#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5466#true} is VALID [2022-04-15 00:32:54,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {5466#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5466#true} is VALID [2022-04-15 00:32:54,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {5466#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] {5466#true} is VALID [2022-04-15 00:32:54,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {5466#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[] {5466#true} is VALID [2022-04-15 00:32:54,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {5466#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[] {5466#true} is VALID [2022-04-15 00:32:54,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {5466#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[] {5466#true} is VALID [2022-04-15 00:32:54,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {5466#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[] {5466#true} is VALID [2022-04-15 00:32:54,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {5466#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[] {5466#true} is VALID [2022-04-15 00:32:54,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {5466#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[] {5466#true} is VALID [2022-04-15 00:32:54,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {5466#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[] {5466#true} is VALID [2022-04-15 00:32:54,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {5466#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[] {5466#true} is VALID [2022-04-15 00:32:54,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {5466#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[] {5466#true} is VALID [2022-04-15 00:32:54,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {5466#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[] {5466#true} is VALID [2022-04-15 00:32:54,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {5466#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] {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {5471#(< 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] {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {5471#(< 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] {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {5471#(< 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] {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {5471#(< 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] {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {5471#(< 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[] {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {5471#(< 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] {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {5472#(< (+ 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[] {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {5472#(< (+ 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] {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {5472#(< (+ 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] {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {5472#(< (+ 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[] {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {5472#(< (+ 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] {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {5472#(< (+ 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] {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {5472#(< (+ 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[] {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {5472#(< (+ 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] {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:54,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {5471#(< 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] {5473#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-15 00:32:54,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {5473#(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[] {5467#false} is VALID [2022-04-15 00:32:54,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {5467#false} [313] L214-->mainErr8ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5467#false} is VALID [2022-04-15 00:32:54,898 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-15 00:32:54,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:54,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843996373] [2022-04-15 00:32:54,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843996373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:54,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:54,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:54,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455141826] [2022-04-15 00:32:54,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:54,898 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-15 00:32:54,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:54,898 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-15 00:32:54,916 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-15 00:32:54,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:54,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:54,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:54,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:54,917 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-15 00:32:55,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:55,110 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-15 00:32:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:32:55,110 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-15 00:32:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:55,110 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-15 00:32:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-15 00:32:55,111 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-15 00:32:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-15 00:32:55,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-15 00:32:55,164 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-15 00:32:55,164 INFO L225 Difference]: With dead ends: 63 [2022-04-15 00:32:55,164 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 00:32:55,165 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-15 00:32:55,165 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-15 00:32:55,165 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-15 00:32:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 00:32:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-04-15 00:32:55,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:55,189 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-15 00:32:55,189 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-15 00:32:55,189 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-15 00:32:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:55,189 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-15 00:32:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-15 00:32:55,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:55,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:55,190 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-15 00:32:55,190 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-15 00:32:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:55,191 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-15 00:32:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-15 00:32:55,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:55,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:55,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:55,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:55,191 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-15 00:32:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-15 00:32:55,192 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2022-04-15 00:32:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:55,192 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-15 00:32:55,192 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-15 00:32:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-15 00:32:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 00:32:55,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:55,192 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-15 00:32:55,192 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 00:32:55,193 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-15 00:32:55,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:55,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1316685848, now seen corresponding path program 1 times [2022-04-15 00:32:55,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:55,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008875873] [2022-04-15 00:32:55,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:55,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:55,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:55,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {5756#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {5747#true} is VALID [2022-04-15 00:32:55,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {5747#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5747#true} is VALID [2022-04-15 00:32:55,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5747#true} {5747#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5747#true} is VALID [2022-04-15 00:32:55,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {5747#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5756#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:55,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {5756#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {5747#true} is VALID [2022-04-15 00:32:55,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {5747#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5747#true} is VALID [2022-04-15 00:32:55,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5747#true} {5747#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5747#true} is VALID [2022-04-15 00:32:55,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {5747#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5747#true} is VALID [2022-04-15 00:32:55,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {5747#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] {5747#true} is VALID [2022-04-15 00:32:55,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {5747#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[] {5747#true} is VALID [2022-04-15 00:32:55,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {5747#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[] {5747#true} is VALID [2022-04-15 00:32:55,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {5747#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[] {5747#true} is VALID [2022-04-15 00:32:55,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {5747#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[] {5747#true} is VALID [2022-04-15 00:32:55,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {5747#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[] {5747#true} is VALID [2022-04-15 00:32:55,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {5747#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[] {5747#true} is VALID [2022-04-15 00:32:55,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {5747#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[] {5747#true} is VALID [2022-04-15 00:32:55,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {5747#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[] {5747#true} is VALID [2022-04-15 00:32:55,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {5747#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[] {5752#(<= 0 main_~main__scheme~0)} is VALID [2022-04-15 00:32:55,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {5752#(<= 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[] {5752#(<= 0 main_~main__scheme~0)} is VALID [2022-04-15 00:32:55,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {5752#(<= 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] {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {5753#(<= 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] {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {5753#(<= 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] {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {5753#(<= 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] {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {5753#(<= 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] {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {5753#(<= 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[] {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {5753#(<= 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] {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {5753#(<= 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[] {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {5753#(<= 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] {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {5753#(<= 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] {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {5753#(<= 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[] {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {5753#(<= 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] {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {5753#(<= 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] {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {5753#(<= 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[] {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {5753#(<= 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] {5754#(<= 1 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,246 INFO L290 TraceCheckUtils]: 31: Hoare triple {5754#(<= 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] {5754#(<= 1 main_~main__cp~0)} is VALID [2022-04-15 00:32:55,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {5754#(<= 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] {5755#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-15 00:32:55,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {5755#(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[] {5748#false} is VALID [2022-04-15 00:32:55,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {5748#false} [317] L226-->mainErr9ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5748#false} is VALID [2022-04-15 00:32:55,247 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-15 00:32:55,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:55,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008875873] [2022-04-15 00:32:55,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008875873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:55,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:55,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 00:32:55,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257453336] [2022-04-15 00:32:55,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:55,248 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-15 00:32:55,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:55,248 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-15 00:32:55,265 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-15 00:32:55,266 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:32:55,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:55,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:32:55,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:32:55,266 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-15 00:32:55,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:55,533 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-15 00:32:55,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:32:55,533 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-15 00:32:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:55,534 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-15 00:32:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-15 00:32:55,535 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-15 00:32:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-15 00:32:55,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-04-15 00:32:55,592 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-15 00:32:55,593 INFO L225 Difference]: With dead ends: 71 [2022-04-15 00:32:55,594 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 00:32:55,595 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-15 00:32:55,596 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-15 00:32:55,597 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-15 00:32:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 00:32:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-04-15 00:32:55,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:55,614 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-15 00:32:55,615 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-15 00:32:55,615 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-15 00:32:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:55,616 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-15 00:32:55,616 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-15 00:32:55,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:55,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:55,616 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-15 00:32:55,616 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-15 00:32:55,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:55,617 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-15 00:32:55,618 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-15 00:32:55,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:55,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:55,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:55,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:55,618 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-15 00:32:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-04-15 00:32:55,619 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2022-04-15 00:32:55,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:55,619 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-04-15 00:32:55,619 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-15 00:32:55,619 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-04-15 00:32:55,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 00:32:55,619 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:55,619 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-15 00:32:55,619 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 00:32:55,620 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-15 00:32:55,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:55,620 INFO L85 PathProgramCache]: Analyzing trace with hash -546914678, now seen corresponding path program 1 times [2022-04-15 00:32:55,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:55,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043784585] [2022-04-15 00:32:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:55,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:55,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:55,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {6060#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {6052#true} is VALID [2022-04-15 00:32:55,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {6052#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6052#true} is VALID [2022-04-15 00:32:55,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6052#true} {6052#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6052#true} is VALID [2022-04-15 00:32:55,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {6052#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6060#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:55,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {6060#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {6052#true} is VALID [2022-04-15 00:32:55,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {6052#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6052#true} is VALID [2022-04-15 00:32:55,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6052#true} {6052#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6052#true} is VALID [2022-04-15 00:32:55,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {6052#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6052#true} is VALID [2022-04-15 00:32:55,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {6052#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] {6052#true} is VALID [2022-04-15 00:32:55,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {6052#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[] {6052#true} is VALID [2022-04-15 00:32:55,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {6052#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[] {6052#true} is VALID [2022-04-15 00:32:55,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {6052#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[] {6052#true} is VALID [2022-04-15 00:32:55,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {6052#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[] {6052#true} is VALID [2022-04-15 00:32:55,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {6052#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[] {6052#true} is VALID [2022-04-15 00:32:55,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {6052#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[] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {6052#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[] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {6052#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[] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {6052#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[] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {6052#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[] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {6052#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] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {6052#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] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {6052#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] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {6052#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] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {6052#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] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {6052#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[] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {6052#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] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {6052#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[] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {6052#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] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {6052#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] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {6052#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[] {6052#true} is VALID [2022-04-15 00:32:55,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {6052#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] {6052#true} is VALID [2022-04-15 00:32:55,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {6052#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] {6052#true} is VALID [2022-04-15 00:32:55,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {6052#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[] {6052#true} is VALID [2022-04-15 00:32:55,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {6052#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] {6052#true} is VALID [2022-04-15 00:32:55,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {6052#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] {6057#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-15 00:32:55,705 INFO L290 TraceCheckUtils]: 32: Hoare triple {6057#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} [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] {6058#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:55,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {6058#(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[] {6058#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:55,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {6058#(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[] {6058#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:55,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {6058#(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] {6059#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-15 00:32:55,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {6059#(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[] {6053#false} is VALID [2022-04-15 00:32:55,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {6053#false} [325] L243-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6053#false} is VALID [2022-04-15 00:32:55,706 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-15 00:32:55,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:55,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043784585] [2022-04-15 00:32:55,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043784585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:55,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:55,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:55,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198022593] [2022-04-15 00:32:55,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:55,707 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-15 00:32:55,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:55,707 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-15 00:32:55,726 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-15 00:32:55,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:55,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:55,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:55,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:55,727 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-15 00:32:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:56,102 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-04-15 00:32:56,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:32:56,102 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-15 00:32:56,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:56,103 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-15 00:32:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-04-15 00:32:56,104 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-15 00:32:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-04-15 00:32:56,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 95 transitions. [2022-04-15 00:32:56,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:56,169 INFO L225 Difference]: With dead ends: 91 [2022-04-15 00:32:56,169 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 00:32:56,169 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-15 00:32:56,169 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-15 00:32:56,170 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-15 00:32:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 00:32:56,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-04-15 00:32:56,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:56,186 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-15 00:32:56,186 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-15 00:32:56,186 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-15 00:32:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:56,187 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-15 00:32:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-15 00:32:56,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:56,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:56,188 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-15 00:32:56,188 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-15 00:32:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:56,189 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-15 00:32:56,189 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-15 00:32:56,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:56,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:56,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:56,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:56,189 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-15 00:32:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-04-15 00:32:56,190 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2022-04-15 00:32:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:56,190 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-04-15 00:32:56,191 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-15 00:32:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-15 00:32:56,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 00:32:56,191 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:56,191 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-15 00:32:56,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 00:32:56,191 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-15 00:32:56,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:56,191 INFO L85 PathProgramCache]: Analyzing trace with hash 225515518, now seen corresponding path program 1 times [2022-04-15 00:32:56,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:56,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565083301] [2022-04-15 00:32:56,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:56,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:56,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:56,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {6433#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {6425#true} is VALID [2022-04-15 00:32:56,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {6425#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6425#true} is VALID [2022-04-15 00:32:56,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6425#true} {6425#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6425#true} is VALID [2022-04-15 00:32:56,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {6425#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6433#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:56,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {6433#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {6425#true} is VALID [2022-04-15 00:32:56,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {6425#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6425#true} is VALID [2022-04-15 00:32:56,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6425#true} {6425#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6425#true} is VALID [2022-04-15 00:32:56,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {6425#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6425#true} is VALID [2022-04-15 00:32:56,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {6425#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] {6425#true} is VALID [2022-04-15 00:32:56,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {6425#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[] {6425#true} is VALID [2022-04-15 00:32:56,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {6425#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[] {6425#true} is VALID [2022-04-15 00:32:56,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {6425#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[] {6425#true} is VALID [2022-04-15 00:32:56,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {6425#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[] {6425#true} is VALID [2022-04-15 00:32:56,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {6425#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[] {6425#true} is VALID [2022-04-15 00:32:56,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {6425#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[] {6425#true} is VALID [2022-04-15 00:32:56,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {6425#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[] {6425#true} is VALID [2022-04-15 00:32:56,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {6425#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[] {6425#true} is VALID [2022-04-15 00:32:56,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {6425#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[] {6425#true} is VALID [2022-04-15 00:32:56,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {6425#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[] {6425#true} is VALID [2022-04-15 00:32:56,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {6425#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] {6425#true} is VALID [2022-04-15 00:32:56,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {6425#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] {6425#true} is VALID [2022-04-15 00:32:56,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {6425#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] {6425#true} is VALID [2022-04-15 00:32:56,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {6425#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] {6425#true} is VALID [2022-04-15 00:32:56,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {6425#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] {6425#true} is VALID [2022-04-15 00:32:56,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {6425#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[] {6425#true} is VALID [2022-04-15 00:32:56,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {6425#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] {6425#true} is VALID [2022-04-15 00:32:56,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {6425#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[] {6425#true} is VALID [2022-04-15 00:32:56,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {6425#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] {6425#true} is VALID [2022-04-15 00:32:56,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {6425#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] {6425#true} is VALID [2022-04-15 00:32:56,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {6425#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[] {6425#true} is VALID [2022-04-15 00:32:56,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {6425#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] {6425#true} is VALID [2022-04-15 00:32:56,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {6425#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] {6425#true} is VALID [2022-04-15 00:32:56,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {6425#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[] {6425#true} is VALID [2022-04-15 00:32:56,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {6425#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] {6425#true} is VALID [2022-04-15 00:32:56,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {6425#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] {6425#true} is VALID [2022-04-15 00:32:56,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {6425#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] {6430#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} is VALID [2022-04-15 00:32:56,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {6430#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} [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[] {6431#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:56,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {6431#(<= 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[] {6431#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:56,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {6431#(<= 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] {6431#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:56,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {6431#(<= 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] {6432#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-15 00:32:56,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {6432#(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[] {6426#false} is VALID [2022-04-15 00:32:56,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {6426#false} [329] L255-->mainErr11ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6426#false} is VALID [2022-04-15 00:32:56,252 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-15 00:32:56,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:56,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565083301] [2022-04-15 00:32:56,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565083301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:56,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:56,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:56,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918649674] [2022-04-15 00:32:56,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:56,253 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-15 00:32:56,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:56,253 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-15 00:32:56,273 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-15 00:32:56,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:56,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:56,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:56,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:56,273 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-15 00:32:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:56,537 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-15 00:32:56,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:32:56,537 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-15 00:32:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:56,538 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-15 00:32:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-15 00:32:56,538 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-15 00:32:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-15 00:32:56,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2022-04-15 00:32:56,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:56,584 INFO L225 Difference]: With dead ends: 61 [2022-04-15 00:32:56,584 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 00:32:56,584 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-15 00:32:56,585 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-15 00:32:56,585 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-15 00:32:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 00:32:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-15 00:32:56,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:56,605 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-15 00:32:56,605 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-15 00:32:56,606 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-15 00:32:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:56,606 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-15 00:32:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-15 00:32:56,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:56,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:56,607 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-15 00:32:56,607 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-15 00:32:56,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:56,607 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-15 00:32:56,608 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-15 00:32:56,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:56,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:56,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:56,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:56,608 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-15 00:32:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-04-15 00:32:56,609 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2022-04-15 00:32:56,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:56,609 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-04-15 00:32:56,609 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-15 00:32:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-15 00:32:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 00:32:56,609 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:56,609 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-15 00:32:56,609 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 00:32:56,609 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-15 00:32:56,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:56,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1972090370, now seen corresponding path program 1 times [2022-04-15 00:32:56,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:56,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114067838] [2022-04-15 00:32:56,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:56,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:56,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:56,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {6705#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {6698#true} is VALID [2022-04-15 00:32:56,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {6698#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6698#true} is VALID [2022-04-15 00:32:56,649 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6698#true} {6698#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6698#true} is VALID [2022-04-15 00:32:56,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {6698#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6705#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:56,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {6705#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {6698#true} is VALID [2022-04-15 00:32:56,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {6698#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6698#true} is VALID [2022-04-15 00:32:56,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6698#true} {6698#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6698#true} is VALID [2022-04-15 00:32:56,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {6698#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6698#true} is VALID [2022-04-15 00:32:56,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {6698#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] {6698#true} is VALID [2022-04-15 00:32:56,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {6698#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] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {6698#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] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {6698#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] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {6698#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] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {6698#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] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {6698#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] {6698#true} is VALID [2022-04-15 00:32:56,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {6698#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] {6698#true} is VALID [2022-04-15 00:32:56,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {6698#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] {6698#true} is VALID [2022-04-15 00:32:56,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {6698#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] {6698#true} is VALID [2022-04-15 00:32:56,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {6698#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] {6698#true} is VALID [2022-04-15 00:32:56,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {6698#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] {6698#true} is VALID [2022-04-15 00:32:56,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {6698#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] {6698#true} is VALID [2022-04-15 00:32:56,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {6698#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] {6698#true} is VALID [2022-04-15 00:32:56,651 INFO L290 TraceCheckUtils]: 33: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,651 INFO L290 TraceCheckUtils]: 34: Hoare triple {6698#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[] {6698#true} is VALID [2022-04-15 00:32:56,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {6698#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] {6703#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-15 00:32:56,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {6703#(<= (+ 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] {6703#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-15 00:32:56,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {6703#(<= (+ 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] {6703#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-15 00:32:56,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {6703#(<= (+ 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] {6704#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-15 00:32:56,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {6704#(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[] {6699#false} is VALID [2022-04-15 00:32:56,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {6699#false} [336] L272-->mainErr12ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6699#false} is VALID [2022-04-15 00:32:56,654 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-15 00:32:56,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:56,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114067838] [2022-04-15 00:32:56,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114067838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:56,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:56,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 00:32:56,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713933188] [2022-04-15 00:32:56,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:56,655 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-15 00:32:56,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:56,655 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-15 00:32:56,674 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-15 00:32:56,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 00:32:56,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:56,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 00:32:56,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 00:32:56,675 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-15 00:32:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:56,880 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-15 00:32:56,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:32:56,881 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-15 00:32:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:56,881 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-15 00:32:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-15 00:32:56,882 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-15 00:32:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-15 00:32:56,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-15 00:32:56,949 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-15 00:32:56,949 INFO L225 Difference]: With dead ends: 70 [2022-04-15 00:32:56,949 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 00:32:56,949 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-15 00:32:56,950 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-15 00:32:56,951 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-15 00:32:56,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 00:32:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2022-04-15 00:32:56,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:56,972 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-15 00:32:56,972 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-15 00:32:56,972 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-15 00:32:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:56,973 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-15 00:32:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-15 00:32:56,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:56,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:56,973 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-15 00:32:56,974 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-15 00:32:56,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:56,974 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-15 00:32:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-15 00:32:56,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:56,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:56,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:56,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:56,975 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-15 00:32:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-04-15 00:32:56,975 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2022-04-15 00:32:56,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:56,976 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-04-15 00:32:56,976 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-15 00:32:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-15 00:32:56,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 00:32:56,976 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:56,976 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-15 00:32:56,976 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 00:32:56,976 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-15 00:32:56,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:56,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1005260689, now seen corresponding path program 1 times [2022-04-15 00:32:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:56,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359962819] [2022-04-15 00:32:56,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:56,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:57,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:57,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {7010#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {7002#true} is VALID [2022-04-15 00:32:57,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {7002#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7002#true} is VALID [2022-04-15 00:32:57,030 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7002#true} {7002#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7002#true} is VALID [2022-04-15 00:32:57,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {7002#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7010#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:57,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {7010#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {7002#true} is VALID [2022-04-15 00:32:57,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {7002#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7002#true} is VALID [2022-04-15 00:32:57,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7002#true} {7002#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7002#true} is VALID [2022-04-15 00:32:57,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {7002#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7002#true} is VALID [2022-04-15 00:32:57,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {7002#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] {7002#true} is VALID [2022-04-15 00:32:57,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {7002#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[] {7002#true} is VALID [2022-04-15 00:32:57,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {7002#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[] {7002#true} is VALID [2022-04-15 00:32:57,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {7002#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[] {7002#true} is VALID [2022-04-15 00:32:57,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {7002#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[] {7002#true} is VALID [2022-04-15 00:32:57,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {7002#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[] {7002#true} is VALID [2022-04-15 00:32:57,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {7002#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[] {7002#true} is VALID [2022-04-15 00:32:57,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {7002#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[] {7002#true} is VALID [2022-04-15 00:32:57,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {7002#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[] {7002#true} is VALID [2022-04-15 00:32:57,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {7002#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[] {7002#true} is VALID [2022-04-15 00:32:57,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {7002#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[] {7002#true} is VALID [2022-04-15 00:32:57,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {7002#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] {7002#true} is VALID [2022-04-15 00:32:57,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {7002#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] {7002#true} is VALID [2022-04-15 00:32:57,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {7002#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] {7002#true} is VALID [2022-04-15 00:32:57,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {7002#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] {7002#true} is VALID [2022-04-15 00:32:57,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {7002#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] {7002#true} is VALID [2022-04-15 00:32:57,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {7002#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[] {7002#true} is VALID [2022-04-15 00:32:57,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {7002#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] {7002#true} is VALID [2022-04-15 00:32:57,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {7002#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[] {7002#true} is VALID [2022-04-15 00:32:57,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {7002#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] {7002#true} is VALID [2022-04-15 00:32:57,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {7002#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] {7002#true} is VALID [2022-04-15 00:32:57,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {7002#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[] {7002#true} is VALID [2022-04-15 00:32:57,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {7002#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] {7002#true} is VALID [2022-04-15 00:32:57,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {7002#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] {7002#true} is VALID [2022-04-15 00:32:57,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {7002#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[] {7002#true} is VALID [2022-04-15 00:32:57,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {7002#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] {7002#true} is VALID [2022-04-15 00:32:57,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {7002#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] {7007#(= main_~main__c~0 0)} is VALID [2022-04-15 00:32:57,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {7007#(= 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] {7007#(= main_~main__c~0 0)} is VALID [2022-04-15 00:32:57,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {7007#(= 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[] {7007#(= main_~main__c~0 0)} is VALID [2022-04-15 00:32:57,033 INFO L290 TraceCheckUtils]: 34: Hoare triple {7007#(= 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[] {7007#(= main_~main__c~0 0)} is VALID [2022-04-15 00:32:57,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {7007#(= 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] {7007#(= main_~main__c~0 0)} is VALID [2022-04-15 00:32:57,034 INFO L290 TraceCheckUtils]: 36: Hoare triple {7007#(= 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] {7007#(= main_~main__c~0 0)} is VALID [2022-04-15 00:32:57,034 INFO L290 TraceCheckUtils]: 37: Hoare triple {7007#(= 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] {7007#(= main_~main__c~0 0)} is VALID [2022-04-15 00:32:57,034 INFO L290 TraceCheckUtils]: 38: Hoare triple {7007#(= 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] {7008#(<= 1 main_~main__c~0)} is VALID [2022-04-15 00:32:57,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {7008#(<= 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] {7009#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-15 00:32:57,035 INFO L290 TraceCheckUtils]: 40: Hoare triple {7009#(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[] {7003#false} is VALID [2022-04-15 00:32:57,035 INFO L290 TraceCheckUtils]: 41: Hoare triple {7003#false} [340] L284-->mainErr13ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7003#false} is VALID [2022-04-15 00:32:57,035 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-15 00:32:57,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:57,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359962819] [2022-04-15 00:32:57,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359962819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:57,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:57,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:57,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804546374] [2022-04-15 00:32:57,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:57,036 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-15 00:32:57,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:57,036 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-15 00:32:57,057 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-15 00:32:57,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:57,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:57,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:57,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:57,058 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-15 00:32:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:57,325 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-04-15 00:32:57,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:32:57,326 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-15 00:32:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:57,326 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-15 00:32:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-04-15 00:32:57,327 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-15 00:32:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-04-15 00:32:57,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2022-04-15 00:32:57,372 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-15 00:32:57,373 INFO L225 Difference]: With dead ends: 66 [2022-04-15 00:32:57,373 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 00:32:57,374 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-15 00:32:57,374 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-15 00:32:57,375 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-15 00:32:57,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 00:32:57,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-04-15 00:32:57,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:57,395 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-15 00:32:57,395 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-15 00:32:57,395 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-15 00:32:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:57,396 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-15 00:32:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-15 00:32:57,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:57,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:57,396 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-15 00:32:57,397 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-15 00:32:57,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:57,397 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-15 00:32:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-15 00:32:57,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:57,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:57,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:57,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:57,398 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-15 00:32:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-15 00:32:57,398 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2022-04-15 00:32:57,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:57,398 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-15 00:32:57,398 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-15 00:32:57,399 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 00:32:57,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 00:32:57,399 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:57,399 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-15 00:32:57,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 00:32:57,399 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-15 00:32:57,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:57,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1098311654, now seen corresponding path program 1 times [2022-04-15 00:32:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:57,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801070825] [2022-04-15 00:32:57,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:57,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:57,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:57,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {7296#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {7288#true} is VALID [2022-04-15 00:32:57,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {7288#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7288#true} is VALID [2022-04-15 00:32:57,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7288#true} {7288#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7288#true} is VALID [2022-04-15 00:32:57,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {7288#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7296#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:57,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {7296#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {7288#true} is VALID [2022-04-15 00:32:57,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {7288#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7288#true} is VALID [2022-04-15 00:32:57,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7288#true} {7288#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7288#true} is VALID [2022-04-15 00:32:57,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {7288#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7288#true} is VALID [2022-04-15 00:32:57,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {7288#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] {7288#true} is VALID [2022-04-15 00:32:57,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {7288#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[] {7288#true} is VALID [2022-04-15 00:32:57,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {7288#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[] {7288#true} is VALID [2022-04-15 00:32:57,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {7288#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[] {7288#true} is VALID [2022-04-15 00:32:57,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {7288#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[] {7288#true} is VALID [2022-04-15 00:32:57,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {7288#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[] {7288#true} is VALID [2022-04-15 00:32:57,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {7288#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[] {7288#true} is VALID [2022-04-15 00:32:57,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {7288#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[] {7288#true} is VALID [2022-04-15 00:32:57,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {7288#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[] {7288#true} is VALID [2022-04-15 00:32:57,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {7288#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[] {7288#true} is VALID [2022-04-15 00:32:57,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {7288#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[] {7288#true} is VALID [2022-04-15 00:32:57,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {7288#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] {7288#true} is VALID [2022-04-15 00:32:57,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {7288#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] {7288#true} is VALID [2022-04-15 00:32:57,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {7288#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] {7288#true} is VALID [2022-04-15 00:32:57,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {7288#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] {7288#true} is VALID [2022-04-15 00:32:57,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {7288#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] {7288#true} is VALID [2022-04-15 00:32:57,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {7288#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[] {7288#true} is VALID [2022-04-15 00:32:57,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {7288#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] {7288#true} is VALID [2022-04-15 00:32:57,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {7288#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[] {7288#true} is VALID [2022-04-15 00:32:57,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {7288#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] {7288#true} is VALID [2022-04-15 00:32:57,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {7288#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] {7288#true} is VALID [2022-04-15 00:32:57,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {7288#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[] {7288#true} is VALID [2022-04-15 00:32:57,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {7288#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] {7288#true} is VALID [2022-04-15 00:32:57,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {7288#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] {7288#true} is VALID [2022-04-15 00:32:57,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {7288#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[] {7288#true} is VALID [2022-04-15 00:32:57,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {7288#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] {7288#true} is VALID [2022-04-15 00:32:57,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {7288#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] {7293#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-15 00:32:57,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {7293#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} [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] {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:57,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {7294#(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[] {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:57,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {7294#(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[] {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:57,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {7294#(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] {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:57,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {7294#(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] {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:57,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {7294#(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] {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:57,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {7294#(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] {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:57,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {7294#(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] {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:57,459 INFO L290 TraceCheckUtils]: 40: Hoare triple {7294#(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] {7295#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-15 00:32:57,459 INFO L290 TraceCheckUtils]: 41: Hoare triple {7295#(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[] {7289#false} is VALID [2022-04-15 00:32:57,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {7289#false} [344] L296-->mainErr14ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7289#false} is VALID [2022-04-15 00:32:57,459 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-15 00:32:57,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:57,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801070825] [2022-04-15 00:32:57,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801070825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:57,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:57,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:57,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520342910] [2022-04-15 00:32:57,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:57,460 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-15 00:32:57,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:57,460 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-15 00:32:57,482 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-15 00:32:57,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:57,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:57,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:57,482 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-15 00:32:57,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:57,848 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-04-15 00:32:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:32:57,848 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-15 00:32:57,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:57,848 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-15 00:32:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2022-04-15 00:32:57,849 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-15 00:32:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2022-04-15 00:32:57,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 93 transitions. [2022-04-15 00:32:57,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:57,912 INFO L225 Difference]: With dead ends: 88 [2022-04-15 00:32:57,913 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 00:32:57,913 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-15 00:32:57,913 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-15 00:32:57,913 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-15 00:32:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 00:32:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2022-04-15 00:32:57,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:57,947 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-15 00:32:57,947 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-15 00:32:57,948 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-15 00:32:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:57,949 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-15 00:32:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-15 00:32:57,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:57,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:57,949 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-15 00:32:57,949 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-15 00:32:57,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:57,950 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-15 00:32:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-15 00:32:57,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:57,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:57,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:57,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:57,950 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-15 00:32:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-04-15 00:32:57,951 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2022-04-15 00:32:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:57,951 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-04-15 00:32:57,951 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-15 00:32:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-04-15 00:32:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 00:32:57,952 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:57,952 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-15 00:32:57,952 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 00:32:57,952 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-15 00:32:57,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:57,952 INFO L85 PathProgramCache]: Analyzing trace with hash -312075723, now seen corresponding path program 1 times [2022-04-15 00:32:57,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:57,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430273365] [2022-04-15 00:32:57,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:57,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:58,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:58,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {7662#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {7654#true} is VALID [2022-04-15 00:32:58,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {7654#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7654#true} is VALID [2022-04-15 00:32:58,009 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7654#true} {7654#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7654#true} is VALID [2022-04-15 00:32:58,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {7654#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7662#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:58,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {7662#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [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] {7654#true} is VALID [2022-04-15 00:32:58,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {7654#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7654#true} is VALID [2022-04-15 00:32:58,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7654#true} {7654#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7654#true} is VALID [2022-04-15 00:32:58,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {7654#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7654#true} is VALID [2022-04-15 00:32:58,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {7654#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] {7654#true} is VALID [2022-04-15 00:32:58,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {7654#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[] {7654#true} is VALID [2022-04-15 00:32:58,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {7654#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[] {7654#true} is VALID [2022-04-15 00:32:58,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {7654#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[] {7654#true} is VALID [2022-04-15 00:32:58,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {7654#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[] {7654#true} is VALID [2022-04-15 00:32:58,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {7654#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[] {7654#true} is VALID [2022-04-15 00:32:58,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {7654#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[] {7654#true} is VALID [2022-04-15 00:32:58,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {7654#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[] {7654#true} is VALID [2022-04-15 00:32:58,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {7654#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[] {7654#true} is VALID [2022-04-15 00:32:58,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {7654#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[] {7654#true} is VALID [2022-04-15 00:32:58,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {7654#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[] {7654#true} is VALID [2022-04-15 00:32:58,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {7654#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] {7654#true} is VALID [2022-04-15 00:32:58,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {7654#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] {7654#true} is VALID [2022-04-15 00:32:58,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {7654#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] {7654#true} is VALID [2022-04-15 00:32:58,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {7654#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] {7654#true} is VALID [2022-04-15 00:32:58,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {7654#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] {7654#true} is VALID [2022-04-15 00:32:58,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {7654#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[] {7654#true} is VALID [2022-04-15 00:32:58,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {7654#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] {7654#true} is VALID [2022-04-15 00:32:58,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {7654#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[] {7654#true} is VALID [2022-04-15 00:32:58,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {7654#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] {7654#true} is VALID [2022-04-15 00:32:58,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {7654#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] {7654#true} is VALID [2022-04-15 00:32:58,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {7654#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[] {7654#true} is VALID [2022-04-15 00:32:58,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {7654#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] {7654#true} is VALID [2022-04-15 00:32:58,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {7654#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] {7654#true} is VALID [2022-04-15 00:32:58,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {7654#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[] {7654#true} is VALID [2022-04-15 00:32:58,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {7654#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] {7654#true} is VALID [2022-04-15 00:32:58,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {7654#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] {7654#true} is VALID [2022-04-15 00:32:58,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {7654#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] {7659#(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-15 00:32:58,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {7659#(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[] {7660#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:58,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {7660#(<= 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[] {7660#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:58,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {7660#(<= 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] {7660#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:58,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {7660#(<= 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] {7660#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:58,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {7660#(<= 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] {7660#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:58,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {7660#(<= 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] {7660#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:58,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {7660#(<= 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] {7660#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:58,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {7660#(<= 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] {7660#(<= 0 main_~main__cp~0)} is VALID [2022-04-15 00:32:58,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {7660#(<= 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] {7661#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-15 00:32:58,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {7661#(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[] {7655#false} is VALID [2022-04-15 00:32:58,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {7655#false} [348] L308-->mainErr15ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7655#false} is VALID [2022-04-15 00:32:58,021 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-15 00:32:58,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:58,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430273365] [2022-04-15 00:32:58,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430273365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:58,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:58,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:58,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983089126] [2022-04-15 00:32:58,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:58,021 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-15 00:32:58,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:58,021 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-15 00:32:58,046 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-15 00:32:58,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:58,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:58,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:58,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:58,046 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-15 00:32:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:58,318 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-15 00:32:58,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:32:58,318 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-15 00:32:58,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:58,318 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-15 00:32:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-15 00:32:58,319 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-15 00:32:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-15 00:32:58,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-04-15 00:32:58,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:58,364 INFO L225 Difference]: With dead ends: 73 [2022-04-15 00:32:58,364 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 00:32:58,364 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-15 00:32:58,364 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-15 00:32:58,365 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-15 00:32:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 00:32:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2022-04-15 00:32:58,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:58,399 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-15 00:32:58,400 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-15 00:32:58,400 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-15 00:32:58,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:58,400 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-15 00:32:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-15 00:32:58,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:58,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:58,401 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-15 00:32:58,401 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-15 00:32:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:58,402 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-15 00:32:58,402 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-15 00:32:58,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:58,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:58,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:58,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:58,402 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-15 00:32:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-04-15 00:32:58,403 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2022-04-15 00:32:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:58,403 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-04-15 00:32:58,403 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-15 00:32:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-15 00:32:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 00:32:58,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:58,404 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-15 00:32:58,404 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 00:32:58,404 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-15 00:32:58,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash -283140749, now seen corresponding path program 1 times [2022-04-15 00:32:58,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:58,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676711572] [2022-04-15 00:32:58,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:58,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:58,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:58,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {7972#(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] {7964#true} is VALID [2022-04-15 00:32:58,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {7964#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7964#true} is VALID [2022-04-15 00:32:58,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7964#true} {7964#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7964#true} is VALID [2022-04-15 00:32:58,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {7964#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7972#(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-15 00:32:58,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {7972#(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] {7964#true} is VALID [2022-04-15 00:32:58,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {7964#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7964#true} is VALID [2022-04-15 00:32:58,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7964#true} {7964#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7964#true} is VALID [2022-04-15 00:32:58,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {7964#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7964#true} is VALID [2022-04-15 00:32:58,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {7964#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] {7964#true} is VALID [2022-04-15 00:32:58,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {7964#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#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {7969#(< 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] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {7969#(< 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] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {7969#(< 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] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {7969#(< 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] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {7969#(< 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[] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {7969#(< 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {7970#(< (+ 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] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {7969#(< 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[] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,469 INFO L290 TraceCheckUtils]: 41: Hoare triple {7969#(< 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] {7971#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-15 00:32:58,470 INFO L290 TraceCheckUtils]: 42: Hoare triple {7971#(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[] {7965#false} is VALID [2022-04-15 00:32:58,470 INFO L290 TraceCheckUtils]: 43: Hoare triple {7965#false} [325] L243-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7965#false} is VALID [2022-04-15 00:32:58,470 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-15 00:32:58,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:58,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676711572] [2022-04-15 00:32:58,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676711572] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:32:58,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155867577] [2022-04-15 00:32:58,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:58,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:32:58,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:32:58,471 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-15 00:32:58,472 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-15 00:32:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:58,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 00:32:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:58,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:32:58,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {7964#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7964#true} is VALID [2022-04-15 00:32:58,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {7964#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] {7964#true} is VALID [2022-04-15 00:32:58,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {7964#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7964#true} is VALID [2022-04-15 00:32:58,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7964#true} {7964#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7964#true} is VALID [2022-04-15 00:32:58,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {7964#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7964#true} is VALID [2022-04-15 00:32:58,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {7964#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] {7964#true} is VALID [2022-04-15 00:32:58,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {7964#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#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {7969#(< 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] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {7969#(< 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] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {7969#(< 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] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {7969#(< 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] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {7969#(< 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[] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {7969#(< 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,741 INFO L290 TraceCheckUtils]: 39: Hoare triple {7970#(< (+ 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] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {7969#(< 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[] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {7969#(< 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] {8099#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID [2022-04-15 00:32:58,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {8099#(<= 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[] {7965#false} is VALID [2022-04-15 00:32:58,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {7965#false} [325] L243-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7965#false} is VALID [2022-04-15 00:32:58,743 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-15 00:32:58,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:32:58,921 INFO L290 TraceCheckUtils]: 43: Hoare triple {7965#false} [325] L243-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7965#false} is VALID [2022-04-15 00:32:58,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {8099#(<= 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[] {7965#false} is VALID [2022-04-15 00:32:58,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {7969#(< 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] {8099#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID [2022-04-15 00:32:58,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {7969#(< 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[] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,923 INFO L290 TraceCheckUtils]: 39: Hoare triple {7970#(< (+ 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] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {7970#(< (+ 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {7970#(< (+ 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[] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {7969#(< 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] {7970#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {7969#(< 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[] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {7969#(< 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] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {7969#(< 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] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {7969#(< 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] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {7969#(< 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] {7969#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {7964#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#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-15 00:32:58,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {7964#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[] {7964#true} is VALID [2022-04-15 00:32:58,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {7964#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] {7964#true} is VALID [2022-04-15 00:32:58,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {7964#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7964#true} is VALID [2022-04-15 00:32:58,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7964#true} {7964#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7964#true} is VALID [2022-04-15 00:32:58,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {7964#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7964#true} is VALID [2022-04-15 00:32:58,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {7964#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] {7964#true} is VALID [2022-04-15 00:32:58,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {7964#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7964#true} is VALID [2022-04-15 00:32:58,931 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-15 00:32:58,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155867577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:32:58,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:32:58,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-15 00:32:58,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679135054] [2022-04-15 00:32:58,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:32:58,932 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-15 00:32:58,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:58,932 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-15 00:32:58,954 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-15 00:32:58,955 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:32:58,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:58,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:32:58,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:32:58,955 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-15 00:32:59,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:59,162 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-15 00:32:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:32:59,162 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-15 00:32:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:59,162 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-15 00:32:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-15 00:32:59,163 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-15 00:32:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-15 00:32:59,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-15 00:32:59,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:59,212 INFO L225 Difference]: With dead ends: 58 [2022-04-15 00:32:59,212 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 00:32:59,212 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-15 00:32:59,212 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 89 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:59,213 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 47 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:32:59,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 00:32:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-15 00:32:59,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:59,237 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-15 00:32:59,237 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-15 00:32:59,237 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-15 00:32:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:59,238 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-04-15 00:32:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-15 00:32:59,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:59,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:59,238 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-15 00:32:59,238 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-15 00:32:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:59,239 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-04-15 00:32:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-15 00:32:59,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:59,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:59,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:59,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:59,239 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-15 00:32:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-04-15 00:32:59,239 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2022-04-15 00:32:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:59,240 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-04-15 00:32:59,240 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-15 00:32:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-15 00:32:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 00:32:59,240 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:59,240 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-15 00:32:59,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 00:32:59,456 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-15 00:32:59,456 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-15 00:32:59,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:59,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1506676067, now seen corresponding path program 1 times [2022-04-15 00:32:59,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:59,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107040991] [2022-04-15 00:32:59,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:59,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:59,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:59,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {8497#(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] {8489#true} is VALID [2022-04-15 00:32:59,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {8489#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8489#true} is VALID [2022-04-15 00:32:59,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8489#true} {8489#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8489#true} is VALID [2022-04-15 00:32:59,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {8489#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8497#(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-15 00:32:59,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {8497#(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] {8489#true} is VALID [2022-04-15 00:32:59,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {8489#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8489#true} is VALID [2022-04-15 00:32:59,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8489#true} {8489#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8489#true} is VALID [2022-04-15 00:32:59,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {8489#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8489#true} is VALID [2022-04-15 00:32:59,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {8489#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] {8489#true} is VALID [2022-04-15 00:32:59,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {8489#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[] {8489#true} is VALID [2022-04-15 00:32:59,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {8489#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] {8494#(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-15 00:32:59,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {8494#(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] {8495#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:59,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {8495#(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] {8495#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:59,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {8495#(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] {8495#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:59,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {8495#(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] {8495#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-15 00:32:59,523 INFO L290 TraceCheckUtils]: 46: Hoare triple {8495#(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] {8496#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-15 00:32:59,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {8496#(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[] {8490#false} is VALID [2022-04-15 00:32:59,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {8490#false} [344] L296-->mainErr14ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8490#false} is VALID [2022-04-15 00:32:59,523 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-15 00:32:59,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:59,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107040991] [2022-04-15 00:32:59,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107040991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:59,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:59,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:59,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825104705] [2022-04-15 00:32:59,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:59,524 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-15 00:32:59,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:59,524 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-15 00:32:59,548 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-15 00:32:59,548 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:59,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:59,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:59,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:59,549 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-15 00:32:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:59,858 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-15 00:32:59,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 00:32:59,858 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-15 00:32:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:59,858 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-15 00:32:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-15 00:32:59,859 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-15 00:32:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-15 00:32:59,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 71 transitions. [2022-04-15 00:32:59,919 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-15 00:32:59,919 INFO L225 Difference]: With dead ends: 75 [2022-04-15 00:32:59,919 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:32:59,920 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-15 00:32:59,920 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-15 00:32:59,920 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-15 00:32:59,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:32:59,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:32:59,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:59,921 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-15 00:32:59,921 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-15 00:32:59,921 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-15 00:32:59,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:59,921 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:32:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:32:59,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:59,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:59,921 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-15 00:32:59,921 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-15 00:32:59,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:59,921 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:32:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:32:59,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:59,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:59,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:59,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:59,921 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-15 00:32:59,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:32:59,921 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-04-15 00:32:59,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:59,922 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:32:59,922 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-15 00:32:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:32:59,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:59,923 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-04-15 00:32:59,924 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-04-15 00:32:59,924 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-04-15 00:32:59,924 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-04-15 00:32:59,924 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-04-15 00:32:59,924 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-04-15 00:32:59,924 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-04-15 00:32:59,924 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-04-15 00:32:59,924 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-04-15 00:32:59,924 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-04-15 00:32:59,924 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-04-15 00:32:59,924 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-04-15 00:32:59,924 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-04-15 00:32:59,925 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-04-15 00:32:59,925 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-04-15 00:32:59,925 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-04-15 00:32:59,925 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-04-15 00:32:59,925 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-04-15 00:32:59,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 00:32:59,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:33:10,387 WARN L232 SmtUtils]: Spent 10.46s on a formula simplification. DAG size of input: 127 DAG size of output: 122 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 00:33:52,226 WARN L232 SmtUtils]: Spent 40.69s on a formula simplification. DAG size of input: 133 DAG size of output: 128 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 00:33:52,868 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:33:52,869 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point L23(lines 23 438) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 13 439) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point L29(lines 29 437) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 13 439) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point L35(lines 35 436) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point L41(lines 41 435) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point L47(lines 47 434) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point L53(lines 53 433) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point L59(lines 59 432) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point L61(lines 61 427) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point L63(lines 63 422) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point L65(lines 65 417) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point L71(lines 71 416) no Hoare annotation was computed. [2022-04-15 00:33:52,869 INFO L882 garLoopResultBuilder]: For program point L83(lines 83 414) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point L95(lines 95 412) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point L104(lines 104 411) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point L111(lines 111 405) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L878 garLoopResultBuilder]: At program point L410(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point L123(lines 123 403) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L878 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (and (< main_~main__cp~0 main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 (<= 1 main_~__VERIFIER_assert__cond~16) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5)))) [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point L135(lines 135 397) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L878 garLoopResultBuilder]: At program point L401(lines 131 402) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (not (<= main_~main__urilen~0 main_~main__cp~0))) [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point L372(lines 372 395) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point L143(lines 143 362) no Hoare annotation was computed. [2022-04-15 00:33:52,870 INFO L882 garLoopResultBuilder]: For program point L374(line 374) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L384(lines 384 393) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L155(lines 155 360) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L386(line 386) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L162(lines 162 359) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L175(lines 175 357) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L187(lines 187 355) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L194(lines 194 354) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L204(lines 204 353) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L212(lines 212 346) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L224(lines 224 344) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2022-04-15 00:33:52,871 INFO L882 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L878 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse8 (= main_~main__c~0 0)) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse4 (< main_~main__cp~0 main_~main__urilen~0)) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse9 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse10 (< 0 main_~main__scheme~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse12 (<= 1 main_~main__cp~0)) (.cse13 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~8 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< (+ main_~main__cp~0 1) main_~main__urilen~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (let ((.cse15 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse7 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) (or (and .cse8 .cse15) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse15))) (<= 1 main_~__VERIFIER_assert__cond~10)))) [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point L234(lines 234 338) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point L241(lines 241 331) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point L253(lines 253 329) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point L262(lines 262 328) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point L270(lines 270 322) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L878 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (and (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (let ((.cse1 (= main_~__VERIFIER_assert__cond~9 1)) (.cse2 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (not (= main_~__VERIFIER_assert__cond~9 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse15 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and .cse0 (= main_~main__c~0 0)) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse0)))) [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point L272(line 272) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point L282(lines 282 320) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point L294(lines 294 318) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point L296(line 296) no Hoare annotation was computed. [2022-04-15 00:33:52,872 INFO L882 garLoopResultBuilder]: For program point L306(lines 306 316) no Hoare annotation was computed. [2022-04-15 00:33:52,873 INFO L882 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2022-04-15 00:33:52,873 INFO L882 garLoopResultBuilder]: For program point L308(line 308) no Hoare annotation was computed. [2022-04-15 00:33:52,873 INFO L882 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2022-04-15 00:33:52,874 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-15 00:33:52,875 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:33:52,879 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-04-15 00:33:52,880 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-04-15 00:33:52,881 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L374 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L374 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L386 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L386 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-04-15 00:33:52,883 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-04-15 00:33:52,884 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-04-15 00:33:52,884 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-04-15 00:33:52,884 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-04-15 00:33:52,884 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-04-15 00:33:52,884 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-04-15 00:33:52,884 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-04-15 00:33:52,884 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2022-04-15 00:33:52,884 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2022-04-15 00:33:52,884 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2022-04-15 00:33:52,884 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2022-04-15 00:33:52,884 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-04-15 00:33:52,884 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-04-15 00:33:52,884 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-04-15 00:33:52,886 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-04-15 00:33:52,886 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-04-15 00:33:52,886 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2022-04-15 00:33:52,886 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2022-04-15 00:33:52,886 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2022-04-15 00:33:52,886 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2022-04-15 00:33:52,886 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2022-04-15 00:33:52,886 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2022-04-15 00:33:52,886 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2022-04-15 00:33:52,886 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2022-04-15 00:33:52,886 WARN L170 areAnnotationChecker]: L262 has no Hoare annotation [2022-04-15 00:33:52,886 WARN L170 areAnnotationChecker]: L262 has no Hoare annotation [2022-04-15 00:33:52,887 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2022-04-15 00:33:52,887 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2022-04-15 00:33:52,889 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-04-15 00:33:52,889 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-04-15 00:33:52,889 WARN L170 areAnnotationChecker]: L282 has no Hoare annotation [2022-04-15 00:33:52,889 WARN L170 areAnnotationChecker]: L282 has no Hoare annotation [2022-04-15 00:33:52,889 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2022-04-15 00:33:52,889 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2022-04-15 00:33:52,889 WARN L170 areAnnotationChecker]: L294 has no Hoare annotation [2022-04-15 00:33:52,889 WARN L170 areAnnotationChecker]: L294 has no Hoare annotation [2022-04-15 00:33:52,889 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-04-15 00:33:52,889 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-04-15 00:33:52,889 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2022-04-15 00:33:52,889 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2022-04-15 00:33:52,889 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-04-15 00:33:52,889 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-04-15 00:33:52,889 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:33:52,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:33:52 BasicIcfg [2022-04-15 00:33:52,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:33:52,911 INFO L158 Benchmark]: Toolchain (without parser) took 66880.73ms. Allocated memory was 192.9MB in the beginning and 443.5MB in the end (delta: 250.6MB). Free memory was 141.1MB in the beginning and 264.1MB in the end (delta: -122.9MB). Peak memory consumption was 244.7MB. Max. memory is 8.0GB. [2022-04-15 00:33:52,911 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 192.9MB. Free memory was 157.3MB in the beginning and 157.1MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:33:52,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.54ms. Allocated memory is still 192.9MB. Free memory was 141.0MB in the beginning and 159.3MB in the end (delta: -18.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 00:33:52,911 INFO L158 Benchmark]: Boogie Preprocessor took 37.20ms. Allocated memory is still 192.9MB. Free memory was 159.3MB in the beginning and 157.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:33:52,912 INFO L158 Benchmark]: RCFGBuilder took 483.39ms. Allocated memory is still 192.9MB. Free memory was 157.2MB in the beginning and 137.8MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-04-15 00:33:52,912 INFO L158 Benchmark]: IcfgTransformer took 69.12ms. Allocated memory is still 192.9MB. Free memory was 137.8MB in the beginning and 134.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-15 00:33:52,912 INFO L158 Benchmark]: TraceAbstraction took 66020.66ms. Allocated memory was 192.9MB in the beginning and 443.5MB in the end (delta: 250.6MB). Free memory was 134.2MB in the beginning and 264.1MB in the end (delta: -129.9MB). Peak memory consumption was 238.4MB. Max. memory is 8.0GB. [2022-04-15 00:33:52,912 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.08ms. Allocated memory is still 192.9MB. Free memory was 157.3MB in the beginning and 157.1MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.54ms. Allocated memory is still 192.9MB. Free memory was 141.0MB in the beginning and 159.3MB in the end (delta: -18.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.20ms. Allocated memory is still 192.9MB. Free memory was 159.3MB in the beginning and 157.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 483.39ms. Allocated memory is still 192.9MB. Free memory was 157.2MB in the beginning and 137.8MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * IcfgTransformer took 69.12ms. Allocated memory is still 192.9MB. Free memory was 137.8MB in the beginning and 134.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 66020.66ms. Allocated memory was 192.9MB in the beginning and 443.5MB in the end (delta: 250.6MB). Free memory was 134.2MB in the beginning and 264.1MB in the end (delta: -129.9MB). Peak memory consumption was 238.4MB. 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: 65.9s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 52.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3700 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3700 mSDsluCounter, 1687 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 360 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2540 IncrementalHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 1327 mSDtfsCounter, 2540 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 269 SyntacticMatches, 18 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 298 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 732 HoareAnnotationTreeSize, 9 FomulaSimplifications, 75985 FormulaSimplificationTreeSizeReduction, 52.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 370018 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 2199 SizeOfPredicates, 12 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (\old(__return_375) == __return_375 && __VERIFIER_assert__cond == 1) && ((((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)) && main__c == 0) || ((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)))) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (main__cp < main__urilen && \old(__return_375) == __return_375) && ((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(main__urilen <= main__cp) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) && \old(__return_375) == __return_375 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) || (((main__c == 0 && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)))) || ((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0))))) && 1 <= __VERIFIER_assert__cond) RESULT: Ultimate proved your program to be correct! [2022-04-15 00:33:52,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...