/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:45:15,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:45:15,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:45:15,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:45:15,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:45:15,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:45:15,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:45:15,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:45:15,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:45:15,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:45:15,229 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:45:15,230 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:45:15,231 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:45:15,232 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:45:15,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:45:15,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:45:15,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:45:15,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:45:15,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:45:15,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:45:15,244 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:45:15,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:45:15,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:45:15,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:45:15,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:45:15,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:45:15,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:45:15,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:45:15,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:45:15,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:45:15,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:45:15,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:45:15,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:45:15,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:45:15,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:45:15,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:45:15,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:45:15,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:45:15,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:45:15,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:45:15,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:45:15,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:45:15,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:45:15,283 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:45:15,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:45:15,284 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:45:15,284 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:45:15,284 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:45:15,284 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:45:15,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:45:15,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:45:15,285 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:45:15,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:45:15,286 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:45:15,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:45:15,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:45:15,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:45:15,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:45:15,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:45:15,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:45:15,287 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:45:15,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:45:15,288 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:45:15,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:45:15,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:45:15,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:45:15,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:45:15,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:45:15,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:45:15,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:45:15,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:45:15,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:45:15,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:45:15,289 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:45:15,289 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:45:15,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:45:15,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:45:15,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:45:15,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:45:15,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:45:15,497 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:45:15,498 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:45:15,499 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-27 10:45:15,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958c811a8/59e2183dfe27417090869d0b5d2e8c70/FLAGb0044799b [2022-04-27 10:45:15,934 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:45:15,935 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-04-27 10:45:15,943 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958c811a8/59e2183dfe27417090869d0b5d2e8c70/FLAGb0044799b [2022-04-27 10:45:15,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958c811a8/59e2183dfe27417090869d0b5d2e8c70 [2022-04-27 10:45:15,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:45:15,959 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:45:15,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:45:15,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:45:15,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:45:15,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:45:15" (1/1) ... [2022-04-27 10:45:15,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@171c7a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:15, skipping insertion in model container [2022-04-27 10:45:15,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:45:15" (1/1) ... [2022-04-27 10:45:15,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:45:16,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:45:16,179 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-27 10:45:16,187 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-27 10:45:16,189 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-27 10:45:16,190 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-27 10:45:16,191 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-27 10:45:16,192 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-27 10:45:16,193 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-27 10:45:16,194 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-27 10:45:16,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[3914,3927] [2022-04-27 10:45:16,197 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-27 10:45:16,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[4426,4439] [2022-04-27 10:45:16,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[4630,4643] [2022-04-27 10:45:16,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[4995,5008] [2022-04-27 10:45:16,212 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-27 10:45:16,215 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-27 10:45:16,223 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-27 10:45:16,230 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-27 10:45:16,232 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-27 10:45:16,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:45:16,242 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:45:16,257 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-27 10:45:16,266 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-27 10:45:16,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-04-27 10:45:16,268 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-27 10:45:16,269 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-27 10:45:16,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[2902,2915] [2022-04-27 10:45:16,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[3228,3241] [2022-04-27 10:45:16,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[3435,3448] [2022-04-27 10:45:16,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[3914,3927] [2022-04-27 10:45:16,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[4118,4131] [2022-04-27 10:45:16,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[4426,4439] [2022-04-27 10:45:16,276 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-27 10:45:16,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[4995,5008] [2022-04-27 10:45:16,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[5198,5211] [2022-04-27 10:45:16,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[5412,5425] [2022-04-27 10:45:16,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[5616,5629] [2022-04-27 10:45:16,291 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-27 10:45:16,293 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-27 10:45:16,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:45:16,308 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:45:16,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:16 WrapperNode [2022-04-27 10:45:16,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:45:16,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:45:16,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:45:16,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:45:16,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:16" (1/1) ... [2022-04-27 10:45:16,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:16" (1/1) ... [2022-04-27 10:45:16,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:16" (1/1) ... [2022-04-27 10:45:16,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:16" (1/1) ... [2022-04-27 10:45:16,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:16" (1/1) ... [2022-04-27 10:45:16,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:16" (1/1) ... [2022-04-27 10:45:16,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:16" (1/1) ... [2022-04-27 10:45:16,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:45:16,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:45:16,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:45:16,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:45:16,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:16" (1/1) ... [2022-04-27 10:45:16,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:45:16,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:45:16,379 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-27 10:45:16,399 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-27 10:45:16,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:45:16,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:45:16,413 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:45:16,413 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:45:16,414 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:45:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:45:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:45:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:45:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:45:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:45:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:45:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:45:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:45:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:45:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:45:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:45:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:45:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:45:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:45:16,494 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:45:16,495 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:45:16,842 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:45:16,847 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:45:16,847 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 10:45:16,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:45:16 BoogieIcfgContainer [2022-04-27 10:45:16,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:45:16,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:45:16,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:45:16,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:45:16,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:45:15" (1/3) ... [2022-04-27 10:45:16,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a927be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:45:16, skipping insertion in model container [2022-04-27 10:45:16,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:16" (2/3) ... [2022-04-27 10:45:16,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a927be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:45:16, skipping insertion in model container [2022-04-27 10:45:16,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:45:16" (3/3) ... [2022-04-27 10:45:16,858 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2022-04-27 10:45:16,867 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:45:16,868 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-04-27 10:45:16,914 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:45:16,920 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1e02fa92, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a8d0fc5 [2022-04-27 10:45:16,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-04-27 10:45:16,928 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-27 10:45:16,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:45:16,935 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:16,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:16,936 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:16,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:16,941 INFO L85 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 1 times [2022-04-27 10:45:16,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:16,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594437779] [2022-04-27 10:45:16,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:16,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:17,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:17,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {90#true} is VALID [2022-04-27 10:45:17,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} assume true; {90#true} is VALID [2022-04-27 10:45:17,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} #225#return; {90#true} is VALID [2022-04-27 10:45:17,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {90#true} call ULTIMATE.init(); {96#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:17,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {90#true} is VALID [2022-04-27 10:45:17,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2022-04-27 10:45:17,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #225#return; {90#true} is VALID [2022-04-27 10:45:17,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} call #t~ret11 := main(); {90#true} is VALID [2022-04-27 10:45:17,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {90#true} is VALID [2022-04-27 10:45:17,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} assume !!(~main__urilen~0 <= 1000000); {90#true} is VALID [2022-04-27 10:45:17,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {90#true} assume !!(~main__urilen~0 >= -1000000); {90#true} is VALID [2022-04-27 10:45:17,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {90#true} assume !!(~main__tokenlen~0 <= 1000000); {90#true} is VALID [2022-04-27 10:45:17,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {90#true} assume !!(~main__tokenlen~0 >= -1000000); {90#true} is VALID [2022-04-27 10:45:17,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {90#true} assume !!(~main__scheme~0 <= 1000000); {90#true} is VALID [2022-04-27 10:45:17,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {90#true} assume !!(~main__scheme~0 >= -1000000); {90#true} is VALID [2022-04-27 10:45:17,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {90#true} assume ~main__urilen~0 > 0; {90#true} is VALID [2022-04-27 10:45:17,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {90#true} assume ~main__tokenlen~0 > 0; {90#true} is VALID [2022-04-27 10:45:17,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {90#true} assume ~main__scheme~0 >= 0; {90#true} is VALID [2022-04-27 10:45:17,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {90#true} assume !(0 == ~main__scheme~0); {90#true} is VALID [2022-04-27 10:45:17,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {90#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {95#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 10:45:17,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {95#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {91#false} is VALID [2022-04-27 10:45:17,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {91#false} assume !false; {91#false} is VALID [2022-04-27 10:45:17,134 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-27 10:45:17,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:17,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594437779] [2022-04-27 10:45:17,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594437779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:17,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:17,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:45:17,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69856838] [2022-04-27 10:45:17,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:17,140 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-27 10:45:17,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:17,144 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-27 10:45:17,165 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-27 10:45:17,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:45:17,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:17,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:45:17,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:45:17,185 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-27 10:45:17,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:17,429 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2022-04-27 10:45:17,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:45:17,430 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-27 10:45:17,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:17,431 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-27 10:45:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-27 10:45:17,439 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-27 10:45:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-27 10:45:17,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2022-04-27 10:45:17,547 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-27 10:45:17,555 INFO L225 Difference]: With dead ends: 93 [2022-04-27 10:45:17,555 INFO L226 Difference]: Without dead ends: 80 [2022-04-27 10:45:17,557 INFO L412 NwaCegarLoop]: 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-27 10:45:17,559 INFO L413 NwaCegarLoop]: 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-27 10:45:17,560 INFO L414 NwaCegarLoop]: 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-27 10:45:17,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-27 10:45:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-27 10:45:17,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:17,582 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-27 10:45:17,583 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-27 10:45:17,583 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-27 10:45:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:17,587 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-27 10:45:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-27 10:45:17,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:17,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:17,588 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-27 10:45:17,589 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-27 10:45:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:17,592 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-27 10:45:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-27 10:45:17,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:17,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:17,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:17,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:17,594 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-27 10:45:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-04-27 10:45:17,597 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2022-04-27 10:45:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:17,597 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-04-27 10:45:17,598 INFO L496 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-27 10:45:17,598 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-27 10:45:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:45:17,598 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:17,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:17,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:45:17,599 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:17,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 1 times [2022-04-27 10:45:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:17,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770660340] [2022-04-27 10:45:17,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:17,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:17,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:17,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {451#true} is VALID [2022-04-27 10:45:17,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {451#true} assume true; {451#true} is VALID [2022-04-27 10:45:17,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {451#true} {451#true} #225#return; {451#true} is VALID [2022-04-27 10:45:17,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {451#true} call ULTIMATE.init(); {460#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:17,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {451#true} is VALID [2022-04-27 10:45:17,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {451#true} assume true; {451#true} is VALID [2022-04-27 10:45:17,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {451#true} {451#true} #225#return; {451#true} is VALID [2022-04-27 10:45:17,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {451#true} call #t~ret11 := main(); {451#true} is VALID [2022-04-27 10:45:17,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {451#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {451#true} is VALID [2022-04-27 10:45:17,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {451#true} assume !!(~main__urilen~0 <= 1000000); {451#true} is VALID [2022-04-27 10:45:17,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {451#true} assume !!(~main__urilen~0 >= -1000000); {451#true} is VALID [2022-04-27 10:45:17,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {451#true} assume !!(~main__tokenlen~0 <= 1000000); {451#true} is VALID [2022-04-27 10:45:17,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {451#true} assume !!(~main__tokenlen~0 >= -1000000); {451#true} is VALID [2022-04-27 10:45:17,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {451#true} assume !!(~main__scheme~0 <= 1000000); {451#true} is VALID [2022-04-27 10:45:17,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {451#true} assume !!(~main__scheme~0 >= -1000000); {451#true} is VALID [2022-04-27 10:45:17,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {451#true} assume ~main__urilen~0 > 0; {451#true} is VALID [2022-04-27 10:45:17,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {451#true} assume ~main__tokenlen~0 > 0; {451#true} is VALID [2022-04-27 10:45:17,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {451#true} assume ~main__scheme~0 >= 0; {456#(< 0 (+ main_~main__scheme~0 1))} is VALID [2022-04-27 10:45:17,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {456#(< 0 (+ main_~main__scheme~0 1))} assume !(0 == ~main__scheme~0); {457#(not (<= main_~main__scheme~0 0))} is VALID [2022-04-27 10:45:17,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {457#(not (<= main_~main__scheme~0 0))} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {458#(<= 1 main_~main__cp~0)} is VALID [2022-04-27 10:45:17,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {458#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {459#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-27 10:45:17,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {459#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {452#false} is VALID [2022-04-27 10:45:17,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {452#false} assume !false; {452#false} is VALID [2022-04-27 10:45:17,675 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-27 10:45:17,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:17,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770660340] [2022-04-27 10:45:17,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770660340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:17,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:17,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:45:17,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620700357] [2022-04-27 10:45:17,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:17,677 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-27 10:45:17,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:17,677 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-27 10:45:17,690 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-27 10:45:17,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:17,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:17,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:17,691 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-27 10:45:18,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:18,012 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-27 10:45:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:18,012 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-27 10:45:18,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:18,013 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-27 10:45:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-04-27 10:45:18,014 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-27 10:45:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-04-27 10:45:18,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 83 transitions. [2022-04-27 10:45:18,078 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-27 10:45:18,082 INFO L225 Difference]: With dead ends: 80 [2022-04-27 10:45:18,082 INFO L226 Difference]: Without dead ends: 78 [2022-04-27 10:45:18,083 INFO L412 NwaCegarLoop]: 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-27 10:45:18,084 INFO L413 NwaCegarLoop]: 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-27 10:45:18,087 INFO L414 NwaCegarLoop]: 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-27 10:45:18,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-27 10:45:18,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-27 10:45:18,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:18,102 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-27 10:45:18,102 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-27 10:45:18,103 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-27 10:45:18,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:18,107 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-27 10:45:18,107 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-27 10:45:18,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:18,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:18,114 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-27 10:45:18,114 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-27 10:45:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:18,118 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-27 10:45:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-27 10:45:18,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:18,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:18,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:18,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:18,123 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-27 10:45:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-27 10:45:18,125 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2022-04-27 10:45:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:18,125 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-27 10:45:18,125 INFO L496 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-27 10:45:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-27 10:45:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:45:18,126 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:18,126 INFO L195 NwaCegarLoop]: 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-27 10:45:18,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:45:18,126 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:18,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:18,127 INFO L85 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 1 times [2022-04-27 10:45:18,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:18,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085143597] [2022-04-27 10:45:18,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:18,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:18,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:18,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {808#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {801#true} is VALID [2022-04-27 10:45:18,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {801#true} assume true; {801#true} is VALID [2022-04-27 10:45:18,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {801#true} {801#true} #225#return; {801#true} is VALID [2022-04-27 10:45:18,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {801#true} call ULTIMATE.init(); {808#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:18,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {801#true} is VALID [2022-04-27 10:45:18,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {801#true} assume true; {801#true} is VALID [2022-04-27 10:45:18,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {801#true} {801#true} #225#return; {801#true} is VALID [2022-04-27 10:45:18,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {801#true} call #t~ret11 := main(); {801#true} is VALID [2022-04-27 10:45:18,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {801#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {801#true} is VALID [2022-04-27 10:45:18,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {801#true} assume !!(~main__urilen~0 <= 1000000); {801#true} is VALID [2022-04-27 10:45:18,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {801#true} assume !!(~main__urilen~0 >= -1000000); {801#true} is VALID [2022-04-27 10:45:18,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {801#true} assume !!(~main__tokenlen~0 <= 1000000); {801#true} is VALID [2022-04-27 10:45:18,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {801#true} assume !!(~main__tokenlen~0 >= -1000000); {801#true} is VALID [2022-04-27 10:45:18,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {801#true} assume !!(~main__scheme~0 <= 1000000); {801#true} is VALID [2022-04-27 10:45:18,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {801#true} assume !!(~main__scheme~0 >= -1000000); {801#true} is VALID [2022-04-27 10:45:18,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {801#true} assume ~main__urilen~0 > 0; {801#true} is VALID [2022-04-27 10:45:18,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {801#true} assume ~main__tokenlen~0 > 0; {801#true} is VALID [2022-04-27 10:45:18,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {801#true} assume ~main__scheme~0 >= 0; {801#true} is VALID [2022-04-27 10:45:18,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {801#true} assume !(0 == ~main__scheme~0); {801#true} is VALID [2022-04-27 10:45:18,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {801#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:18,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:18,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:18,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {807#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-27 10:45:18,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {807#(not (= main_~__VERIFIER_assert__cond~2 0))} assume 0 == ~__VERIFIER_assert__cond~2; {802#false} is VALID [2022-04-27 10:45:18,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {802#false} assume !false; {802#false} is VALID [2022-04-27 10:45:18,205 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-27 10:45:18,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:18,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085143597] [2022-04-27 10:45:18,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085143597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:18,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:18,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:45:18,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879336365] [2022-04-27 10:45:18,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:18,206 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-27 10:45:18,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:18,206 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-27 10:45:18,220 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-27 10:45:18,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:45:18,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:18,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:45:18,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:45:18,221 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-27 10:45:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:18,488 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-04-27 10:45:18,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:45:18,488 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-27 10:45:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:18,488 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-27 10:45:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-04-27 10:45:18,490 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-27 10:45:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-04-27 10:45:18,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 106 transitions. [2022-04-27 10:45:18,572 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-27 10:45:18,575 INFO L225 Difference]: With dead ends: 101 [2022-04-27 10:45:18,575 INFO L226 Difference]: Without dead ends: 99 [2022-04-27 10:45:18,576 INFO L412 NwaCegarLoop]: 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-27 10:45:18,578 INFO L413 NwaCegarLoop]: 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-27 10:45:18,583 INFO L414 NwaCegarLoop]: 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-27 10:45:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-27 10:45:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2022-04-27 10:45:18,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:18,598 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-27 10:45:18,598 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-27 10:45:18,598 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-27 10:45:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:18,603 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-27 10:45:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-27 10:45:18,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:18,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:18,604 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-27 10:45:18,604 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-27 10:45:18,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:18,608 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-27 10:45:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-27 10:45:18,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:18,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:18,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:18,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:18,610 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-27 10:45:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-27 10:45:18,612 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2022-04-27 10:45:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:18,612 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-27 10:45:18,612 INFO L496 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-27 10:45:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-27 10:45:18,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 10:45:18,613 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:18,613 INFO L195 NwaCegarLoop]: 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-27 10:45:18,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:45:18,614 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:18,615 INFO L85 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 1 times [2022-04-27 10:45:18,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:18,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632174485] [2022-04-27 10:45:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:18,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:18,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:18,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {1218#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1210#true} is VALID [2022-04-27 10:45:18,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-27 10:45:18,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1210#true} {1210#true} #225#return; {1210#true} is VALID [2022-04-27 10:45:18,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1218#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:18,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {1218#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1210#true} is VALID [2022-04-27 10:45:18,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-27 10:45:18,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #225#return; {1210#true} is VALID [2022-04-27 10:45:18,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret11 := main(); {1210#true} is VALID [2022-04-27 10:45:18,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {1210#true} is VALID [2022-04-27 10:45:18,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {1210#true} assume !!(~main__urilen~0 <= 1000000); {1210#true} is VALID [2022-04-27 10:45:18,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {1210#true} assume !!(~main__urilen~0 >= -1000000); {1210#true} is VALID [2022-04-27 10:45:18,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {1210#true} assume !!(~main__tokenlen~0 <= 1000000); {1210#true} is VALID [2022-04-27 10:45:18,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {1210#true} assume !!(~main__tokenlen~0 >= -1000000); {1210#true} is VALID [2022-04-27 10:45:18,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {1210#true} assume !!(~main__scheme~0 <= 1000000); {1210#true} is VALID [2022-04-27 10:45:18,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {1210#true} assume !!(~main__scheme~0 >= -1000000); {1210#true} is VALID [2022-04-27 10:45:18,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {1210#true} assume ~main__urilen~0 > 0; {1210#true} is VALID [2022-04-27 10:45:18,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {1210#true} assume ~main__tokenlen~0 > 0; {1210#true} is VALID [2022-04-27 10:45:18,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {1210#true} assume ~main__scheme~0 >= 0; {1215#(<= 0 main_~main__scheme~0)} is VALID [2022-04-27 10:45:18,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {1215#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {1215#(<= 0 main_~main__scheme~0)} is VALID [2022-04-27 10:45:18,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {1215#(<= 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1216#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:18,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {1216#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1216#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:18,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {1216#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {1216#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:18,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {1216#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1216#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:18,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {1216#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1217#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-27 10:45:18,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {1217#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {1211#false} is VALID [2022-04-27 10:45:18,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2022-04-27 10:45:18,729 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-27 10:45:18,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:18,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632174485] [2022-04-27 10:45:18,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632174485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:18,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:18,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:18,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086309391] [2022-04-27 10:45:18,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:18,730 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-27 10:45:18,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:18,730 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-27 10:45:18,741 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-27 10:45:18,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:18,742 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-27 10:45:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:18,952 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-27 10:45:18,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:45:18,952 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-27 10:45:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:18,953 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-27 10:45:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-27 10:45:18,954 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-27 10:45:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-27 10:45:18,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2022-04-27 10:45:19,012 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-27 10:45:19,013 INFO L225 Difference]: With dead ends: 76 [2022-04-27 10:45:19,013 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 10:45:19,013 INFO L412 NwaCegarLoop]: 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-27 10:45:19,014 INFO L413 NwaCegarLoop]: 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-27 10:45:19,014 INFO L414 NwaCegarLoop]: 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-27 10:45:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 10:45:19,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-27 10:45:19,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:19,026 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-27 10:45:19,027 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-27 10:45:19,027 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-27 10:45:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:19,028 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-27 10:45:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-27 10:45:19,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:19,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:19,029 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-27 10:45:19,029 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-27 10:45:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:19,031 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-27 10:45:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-27 10:45:19,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:19,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:19,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:19,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:19,031 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-27 10:45:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-04-27 10:45:19,033 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2022-04-27 10:45:19,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:19,033 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-04-27 10:45:19,033 INFO L496 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-27 10:45:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-27 10:45:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 10:45:19,033 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:19,033 INFO L195 NwaCegarLoop]: 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-27 10:45:19,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:45:19,034 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:19,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 1 times [2022-04-27 10:45:19,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:19,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034488093] [2022-04-27 10:45:19,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:19,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:19,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:19,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {1549#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1541#true} is VALID [2022-04-27 10:45:19,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {1541#true} assume true; {1541#true} is VALID [2022-04-27 10:45:19,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1541#true} {1541#true} #225#return; {1541#true} is VALID [2022-04-27 10:45:19,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {1541#true} call ULTIMATE.init(); {1549#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:19,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {1549#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1541#true} is VALID [2022-04-27 10:45:19,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {1541#true} assume true; {1541#true} is VALID [2022-04-27 10:45:19,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1541#true} {1541#true} #225#return; {1541#true} is VALID [2022-04-27 10:45:19,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {1541#true} call #t~ret11 := main(); {1541#true} is VALID [2022-04-27 10:45:19,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {1541#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {1541#true} is VALID [2022-04-27 10:45:19,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {1541#true} assume !!(~main__urilen~0 <= 1000000); {1541#true} is VALID [2022-04-27 10:45:19,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {1541#true} assume !!(~main__urilen~0 >= -1000000); {1541#true} is VALID [2022-04-27 10:45:19,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {1541#true} assume !!(~main__tokenlen~0 <= 1000000); {1541#true} is VALID [2022-04-27 10:45:19,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {1541#true} assume !!(~main__tokenlen~0 >= -1000000); {1541#true} is VALID [2022-04-27 10:45:19,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {1541#true} assume !!(~main__scheme~0 <= 1000000); {1541#true} is VALID [2022-04-27 10:45:19,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {1541#true} assume !!(~main__scheme~0 >= -1000000); {1541#true} is VALID [2022-04-27 10:45:19,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {1541#true} assume ~main__urilen~0 > 0; {1541#true} is VALID [2022-04-27 10:45:19,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {1541#true} assume ~main__tokenlen~0 > 0; {1541#true} is VALID [2022-04-27 10:45:19,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {1541#true} assume ~main__scheme~0 >= 0; {1541#true} is VALID [2022-04-27 10:45:19,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {1541#true} assume !(0 == ~main__scheme~0); {1541#true} is VALID [2022-04-27 10:45:19,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {1541#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1541#true} is VALID [2022-04-27 10:45:19,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {1541#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1541#true} is VALID [2022-04-27 10:45:19,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {1541#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {1541#true} is VALID [2022-04-27 10:45:19,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {1541#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1546#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-27 10:45:19,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {1546#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1547#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:19,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {1547#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~3); {1547#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:19,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {1547#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {1547#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:19,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {1547#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {1548#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-27 10:45:19,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {1548#(not (= main_~__VERIFIER_assert__cond~16 0))} assume 0 == ~__VERIFIER_assert__cond~16; {1542#false} is VALID [2022-04-27 10:45:19,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {1542#false} assume !false; {1542#false} is VALID [2022-04-27 10:45:19,121 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-27 10:45:19,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:19,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034488093] [2022-04-27 10:45:19,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034488093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:19,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:19,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:19,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206142411] [2022-04-27 10:45:19,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:19,122 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-27 10:45:19,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:19,122 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-27 10:45:19,135 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-27 10:45:19,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:19,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:19,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:19,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:19,136 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-27 10:45:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:19,674 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-04-27 10:45:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:45:19,674 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-27 10:45:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:19,674 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-27 10:45:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2022-04-27 10:45:19,676 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-27 10:45:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2022-04-27 10:45:19,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 147 transitions. [2022-04-27 10:45:19,779 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-27 10:45:19,780 INFO L225 Difference]: With dead ends: 141 [2022-04-27 10:45:19,781 INFO L226 Difference]: Without dead ends: 139 [2022-04-27 10:45:19,781 INFO L412 NwaCegarLoop]: 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-27 10:45:19,781 INFO L413 NwaCegarLoop]: 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-27 10:45:19,782 INFO L414 NwaCegarLoop]: 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-27 10:45:19,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-27 10:45:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2022-04-27 10:45:19,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:19,800 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-27 10:45:19,800 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-27 10:45:19,800 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-27 10:45:19,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:19,803 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-27 10:45:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-27 10:45:19,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:19,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:19,804 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-27 10:45:19,804 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-27 10:45:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:19,812 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-27 10:45:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-27 10:45:19,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:19,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:19,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:19,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:19,813 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-27 10:45:19,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-27 10:45:19,814 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2022-04-27 10:45:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:19,814 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-27 10:45:19,814 INFO L496 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-27 10:45:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-27 10:45:19,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 10:45:19,815 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:19,815 INFO L195 NwaCegarLoop]: 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-27 10:45:19,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:45:19,815 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:19,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:19,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 1 times [2022-04-27 10:45:19,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:19,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41629219] [2022-04-27 10:45:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:19,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:19,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:19,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {2088#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2080#true} is VALID [2022-04-27 10:45:19,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {2080#true} assume true; {2080#true} is VALID [2022-04-27 10:45:19,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2080#true} {2080#true} #225#return; {2080#true} is VALID [2022-04-27 10:45:19,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {2080#true} call ULTIMATE.init(); {2088#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:19,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {2088#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2080#true} is VALID [2022-04-27 10:45:19,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {2080#true} assume true; {2080#true} is VALID [2022-04-27 10:45:19,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2080#true} {2080#true} #225#return; {2080#true} is VALID [2022-04-27 10:45:19,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {2080#true} call #t~ret11 := main(); {2080#true} is VALID [2022-04-27 10:45:19,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {2080#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {2080#true} is VALID [2022-04-27 10:45:19,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {2080#true} assume !!(~main__urilen~0 <= 1000000); {2080#true} is VALID [2022-04-27 10:45:19,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {2080#true} assume !!(~main__urilen~0 >= -1000000); {2080#true} is VALID [2022-04-27 10:45:19,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {2080#true} assume !!(~main__tokenlen~0 <= 1000000); {2080#true} is VALID [2022-04-27 10:45:19,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {2080#true} assume !!(~main__tokenlen~0 >= -1000000); {2080#true} is VALID [2022-04-27 10:45:19,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {2080#true} assume !!(~main__scheme~0 <= 1000000); {2080#true} is VALID [2022-04-27 10:45:19,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {2080#true} assume !!(~main__scheme~0 >= -1000000); {2080#true} is VALID [2022-04-27 10:45:19,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {2080#true} assume ~main__urilen~0 > 0; {2080#true} is VALID [2022-04-27 10:45:19,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {2080#true} assume ~main__tokenlen~0 > 0; {2080#true} is VALID [2022-04-27 10:45:19,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {2080#true} assume ~main__scheme~0 >= 0; {2080#true} is VALID [2022-04-27 10:45:19,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {2080#true} assume !(0 == ~main__scheme~0); {2080#true} is VALID [2022-04-27 10:45:19,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {2080#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2080#true} is VALID [2022-04-27 10:45:19,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {2080#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2080#true} is VALID [2022-04-27 10:45:19,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {2080#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {2080#true} is VALID [2022-04-27 10:45:19,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {2080#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2085#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-27 10:45:19,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {2085#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2086#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:19,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {2086#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~3); {2086#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:19,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {2086#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(~main__cp~0 != ~main__urilen~0 - 1); {2086#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:19,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {2086#(not (<= main_~main__urilen~0 main_~main__cp~0))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2087#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-27 10:45:19,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {2087#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {2081#false} is VALID [2022-04-27 10:45:19,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {2081#false} assume !false; {2081#false} is VALID [2022-04-27 10:45:19,905 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-27 10:45:19,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:19,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41629219] [2022-04-27 10:45:19,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41629219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:19,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:19,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:19,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676424529] [2022-04-27 10:45:19,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:19,906 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-27 10:45:19,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:19,906 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-27 10:45:19,919 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-27 10:45:19,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:19,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:19,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:19,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:19,919 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-27 10:45:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:20,310 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2022-04-27 10:45:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:45:20,310 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-27 10:45:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:20,311 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-27 10:45:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-04-27 10:45:20,312 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-27 10:45:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-04-27 10:45:20,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 114 transitions. [2022-04-27 10:45:20,391 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-27 10:45:20,392 INFO L225 Difference]: With dead ends: 108 [2022-04-27 10:45:20,392 INFO L226 Difference]: Without dead ends: 106 [2022-04-27 10:45:20,392 INFO L412 NwaCegarLoop]: 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-27 10:45:20,393 INFO L413 NwaCegarLoop]: 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-27 10:45:20,393 INFO L414 NwaCegarLoop]: 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-27 10:45:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-27 10:45:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2022-04-27 10:45:20,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:20,424 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-27 10:45:20,424 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-27 10:45:20,425 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-27 10:45:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:20,426 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-27 10:45:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-27 10:45:20,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:20,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:20,427 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-27 10:45:20,427 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-27 10:45:20,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:20,429 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-27 10:45:20,429 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-27 10:45:20,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:20,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:20,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:20,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:20,429 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-27 10:45:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-04-27 10:45:20,431 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2022-04-27 10:45:20,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:20,431 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-04-27 10:45:20,431 INFO L496 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-27 10:45:20,431 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-27 10:45:20,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 10:45:20,431 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:20,431 INFO L195 NwaCegarLoop]: 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-27 10:45:20,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 10:45:20,432 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:20,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:20,432 INFO L85 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 1 times [2022-04-27 10:45:20,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:20,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326773283] [2022-04-27 10:45:20,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:20,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:20,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:20,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {2530#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2522#true} is VALID [2022-04-27 10:45:20,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {2522#true} assume true; {2522#true} is VALID [2022-04-27 10:45:20,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2522#true} {2522#true} #225#return; {2522#true} is VALID [2022-04-27 10:45:20,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {2522#true} call ULTIMATE.init(); {2530#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:20,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {2530#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2522#true} is VALID [2022-04-27 10:45:20,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {2522#true} assume true; {2522#true} is VALID [2022-04-27 10:45:20,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2522#true} {2522#true} #225#return; {2522#true} is VALID [2022-04-27 10:45:20,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {2522#true} call #t~ret11 := main(); {2522#true} is VALID [2022-04-27 10:45:20,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {2522#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {2522#true} is VALID [2022-04-27 10:45:20,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {2522#true} assume !!(~main__urilen~0 <= 1000000); {2522#true} is VALID [2022-04-27 10:45:20,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {2522#true} assume !!(~main__urilen~0 >= -1000000); {2522#true} is VALID [2022-04-27 10:45:20,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {2522#true} assume !!(~main__tokenlen~0 <= 1000000); {2522#true} is VALID [2022-04-27 10:45:20,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {2522#true} assume !!(~main__tokenlen~0 >= -1000000); {2522#true} is VALID [2022-04-27 10:45:20,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {2522#true} assume !!(~main__scheme~0 <= 1000000); {2522#true} is VALID [2022-04-27 10:45:20,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {2522#true} assume !!(~main__scheme~0 >= -1000000); {2522#true} is VALID [2022-04-27 10:45:20,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {2522#true} assume ~main__urilen~0 > 0; {2522#true} is VALID [2022-04-27 10:45:20,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {2522#true} assume ~main__tokenlen~0 > 0; {2522#true} is VALID [2022-04-27 10:45:20,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {2522#true} assume ~main__scheme~0 >= 0; {2522#true} is VALID [2022-04-27 10:45:20,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {2522#true} assume !(0 == ~main__scheme~0); {2522#true} is VALID [2022-04-27 10:45:20,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {2522#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2522#true} is VALID [2022-04-27 10:45:20,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {2522#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2522#true} is VALID [2022-04-27 10:45:20,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {2522#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {2522#true} is VALID [2022-04-27 10:45:20,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {2522#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2522#true} is VALID [2022-04-27 10:45:20,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {2522#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2527#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} is VALID [2022-04-27 10:45:20,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {2527#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~3); {2528#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:20,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {2528#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {2528#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:20,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {2528#(<= 0 main_~main__cp~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {2528#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:20,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {2528#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {2529#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-27 10:45:20,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {2529#(not (= main_~__VERIFIER_assert__cond~17 0))} assume 0 == ~__VERIFIER_assert__cond~17; {2523#false} is VALID [2022-04-27 10:45:20,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {2523#false} assume !false; {2523#false} is VALID [2022-04-27 10:45:20,492 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-27 10:45:20,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:20,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326773283] [2022-04-27 10:45:20,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326773283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:20,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:20,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:20,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227641742] [2022-04-27 10:45:20,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:20,492 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-27 10:45:20,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:20,493 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-27 10:45:20,506 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-27 10:45:20,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:20,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:20,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:20,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:20,507 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-27 10:45:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:20,860 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2022-04-27 10:45:20,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:45:20,860 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-27 10:45:20,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:20,861 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-27 10:45:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2022-04-27 10:45:20,862 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-27 10:45:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2022-04-27 10:45:20,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 125 transitions. [2022-04-27 10:45:20,970 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-27 10:45:20,971 INFO L225 Difference]: With dead ends: 121 [2022-04-27 10:45:20,972 INFO L226 Difference]: Without dead ends: 119 [2022-04-27 10:45:20,972 INFO L412 NwaCegarLoop]: 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-27 10:45:20,972 INFO L413 NwaCegarLoop]: 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-27 10:45:20,972 INFO L414 NwaCegarLoop]: 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-27 10:45:20,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-27 10:45:20,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2022-04-27 10:45:20,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:20,995 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-27 10:45:20,995 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-27 10:45:20,996 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-27 10:45:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:20,998 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-27 10:45:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-27 10:45:20,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:20,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:20,998 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-27 10:45:20,998 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-27 10:45:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:21,000 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-27 10:45:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-27 10:45:21,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:21,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:21,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:21,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:21,001 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-27 10:45:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-27 10:45:21,002 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2022-04-27 10:45:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:21,002 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-27 10:45:21,002 INFO L496 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-27 10:45:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-27 10:45:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 10:45:21,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:21,002 INFO L195 NwaCegarLoop]: 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-27 10:45:21,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 10:45:21,003 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:21,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 1 times [2022-04-27 10:45:21,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:21,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616979273] [2022-04-27 10:45:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:21,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:21,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:21,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {3006#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2998#true} is VALID [2022-04-27 10:45:21,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {2998#true} assume true; {2998#true} is VALID [2022-04-27 10:45:21,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2998#true} {2998#true} #225#return; {2998#true} is VALID [2022-04-27 10:45:21,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {2998#true} call ULTIMATE.init(); {3006#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:21,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {3006#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2998#true} is VALID [2022-04-27 10:45:21,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {2998#true} assume true; {2998#true} is VALID [2022-04-27 10:45:21,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2998#true} {2998#true} #225#return; {2998#true} is VALID [2022-04-27 10:45:21,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {2998#true} call #t~ret11 := main(); {2998#true} is VALID [2022-04-27 10:45:21,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {2998#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {2998#true} is VALID [2022-04-27 10:45:21,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {2998#true} assume !!(~main__urilen~0 <= 1000000); {2998#true} is VALID [2022-04-27 10:45:21,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {2998#true} assume !!(~main__urilen~0 >= -1000000); {2998#true} is VALID [2022-04-27 10:45:21,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {2998#true} assume !!(~main__tokenlen~0 <= 1000000); {2998#true} is VALID [2022-04-27 10:45:21,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {2998#true} assume !!(~main__tokenlen~0 >= -1000000); {2998#true} is VALID [2022-04-27 10:45:21,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {2998#true} assume !!(~main__scheme~0 <= 1000000); {2998#true} is VALID [2022-04-27 10:45:21,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {2998#true} assume !!(~main__scheme~0 >= -1000000); {2998#true} is VALID [2022-04-27 10:45:21,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {2998#true} assume ~main__urilen~0 > 0; {2998#true} is VALID [2022-04-27 10:45:21,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {2998#true} assume ~main__tokenlen~0 > 0; {2998#true} is VALID [2022-04-27 10:45:21,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {2998#true} assume ~main__scheme~0 >= 0; {2998#true} is VALID [2022-04-27 10:45:21,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {2998#true} assume !(0 == ~main__scheme~0); {2998#true} is VALID [2022-04-27 10:45:21,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {2998#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2998#true} is VALID [2022-04-27 10:45:21,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {2998#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2998#true} is VALID [2022-04-27 10:45:21,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {2998#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {2998#true} is VALID [2022-04-27 10:45:21,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {2998#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2998#true} is VALID [2022-04-27 10:45:21,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {2998#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3003#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} is VALID [2022-04-27 10:45:21,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {3003#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~3); {3004#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:21,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {3004#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 != ~main__urilen~0 - 1); {3004#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:21,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {3004#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3004#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:21,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {3004#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {3005#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-27 10:45:21,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {3005#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {2999#false} is VALID [2022-04-27 10:45:21,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {2999#false} assume !false; {2999#false} is VALID [2022-04-27 10:45:21,072 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-27 10:45:21,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:21,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616979273] [2022-04-27 10:45:21,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616979273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:21,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:21,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:21,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085792270] [2022-04-27 10:45:21,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:21,073 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-27 10:45:21,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:21,073 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-27 10:45:21,086 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-27 10:45:21,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:21,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:21,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:21,087 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-27 10:45:21,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:21,358 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-04-27 10:45:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:45:21,359 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-27 10:45:21,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:21,359 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-27 10:45:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-27 10:45:21,360 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-27 10:45:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-27 10:45:21,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-27 10:45:21,421 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-27 10:45:21,422 INFO L225 Difference]: With dead ends: 77 [2022-04-27 10:45:21,422 INFO L226 Difference]: Without dead ends: 75 [2022-04-27 10:45:21,422 INFO L412 NwaCegarLoop]: 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-27 10:45:21,422 INFO L413 NwaCegarLoop]: 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-27 10:45:21,423 INFO L414 NwaCegarLoop]: 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-27 10:45:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-27 10:45:21,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-27 10:45:21,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:21,452 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-27 10:45:21,453 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-27 10:45:21,453 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-27 10:45:21,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:21,454 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-27 10:45:21,454 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-27 10:45:21,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:21,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:21,454 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-27 10:45:21,455 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-27 10:45:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:21,456 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-27 10:45:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-27 10:45:21,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:21,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:21,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:21,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:21,456 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-27 10:45:21,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-04-27 10:45:21,457 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2022-04-27 10:45:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:21,457 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-04-27 10:45:21,458 INFO L496 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-27 10:45:21,458 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-27 10:45:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 10:45:21,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:21,458 INFO L195 NwaCegarLoop]: 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-27 10:45:21,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 10:45:21,458 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:21,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:21,458 INFO L85 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 1 times [2022-04-27 10:45:21,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:21,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001890463] [2022-04-27 10:45:21,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:21,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:21,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:21,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {3343#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {3337#true} is VALID [2022-04-27 10:45:21,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {3337#true} assume true; {3337#true} is VALID [2022-04-27 10:45:21,492 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3337#true} {3337#true} #225#return; {3337#true} is VALID [2022-04-27 10:45:21,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {3337#true} call ULTIMATE.init(); {3343#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:21,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {3343#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {3337#true} is VALID [2022-04-27 10:45:21,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {3337#true} assume true; {3337#true} is VALID [2022-04-27 10:45:21,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3337#true} {3337#true} #225#return; {3337#true} is VALID [2022-04-27 10:45:21,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {3337#true} call #t~ret11 := main(); {3337#true} is VALID [2022-04-27 10:45:21,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {3337#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {3337#true} is VALID [2022-04-27 10:45:21,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {3337#true} assume !!(~main__urilen~0 <= 1000000); {3337#true} is VALID [2022-04-27 10:45:21,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {3337#true} assume !!(~main__urilen~0 >= -1000000); {3337#true} is VALID [2022-04-27 10:45:21,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {3337#true} assume !!(~main__tokenlen~0 <= 1000000); {3337#true} is VALID [2022-04-27 10:45:21,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {3337#true} assume !!(~main__tokenlen~0 >= -1000000); {3337#true} is VALID [2022-04-27 10:45:21,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {3337#true} assume !!(~main__scheme~0 <= 1000000); {3337#true} is VALID [2022-04-27 10:45:21,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {3337#true} assume !!(~main__scheme~0 >= -1000000); {3337#true} is VALID [2022-04-27 10:45:21,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {3337#true} assume ~main__urilen~0 > 0; {3337#true} is VALID [2022-04-27 10:45:21,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {3337#true} assume ~main__tokenlen~0 > 0; {3337#true} is VALID [2022-04-27 10:45:21,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {3337#true} assume ~main__scheme~0 >= 0; {3337#true} is VALID [2022-04-27 10:45:21,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {3337#true} assume !(0 == ~main__scheme~0); {3337#true} is VALID [2022-04-27 10:45:21,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {3337#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3337#true} is VALID [2022-04-27 10:45:21,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {3337#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3337#true} is VALID [2022-04-27 10:45:21,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {3337#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {3337#true} is VALID [2022-04-27 10:45:21,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {3337#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3337#true} is VALID [2022-04-27 10:45:21,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {3337#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3337#true} is VALID [2022-04-27 10:45:21,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {3337#true} assume !(0 == ~__VERIFIER_assert__cond~3); {3337#true} is VALID [2022-04-27 10:45:21,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {3337#true} assume !(~main__cp~0 != ~main__urilen~0 - 1); {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-27 10:45:21,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-27 10:45:21,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-27 10:45:21,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} assume !(0 == ~__VERIFIER_assert__cond~5); {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-27 10:45:21,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {3342#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3338#false} is VALID [2022-04-27 10:45:21,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {3338#false} assume 0 == ~__VERIFIER_assert__cond~6; {3338#false} is VALID [2022-04-27 10:45:21,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {3338#false} assume !false; {3338#false} is VALID [2022-04-27 10:45:21,496 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-27 10:45:21,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:21,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001890463] [2022-04-27 10:45:21,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001890463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:21,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:21,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:45:21,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582226473] [2022-04-27 10:45:21,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:21,497 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-27 10:45:21,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:21,498 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-27 10:45:21,512 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-27 10:45:21,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:45:21,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:21,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:45:21,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:45:21,513 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-27 10:45:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:21,679 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-04-27 10:45:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:45:21,679 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-27 10:45:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:21,680 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-27 10:45:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-27 10:45:21,681 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-27 10:45:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-27 10:45:21,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-27 10:45:21,763 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-27 10:45:21,764 INFO L225 Difference]: With dead ends: 115 [2022-04-27 10:45:21,764 INFO L226 Difference]: Without dead ends: 75 [2022-04-27 10:45:21,764 INFO L412 NwaCegarLoop]: 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-27 10:45:21,765 INFO L413 NwaCegarLoop]: 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-27 10:45:21,765 INFO L414 NwaCegarLoop]: 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-27 10:45:21,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-27 10:45:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-27 10:45:21,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:21,786 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-27 10:45:21,787 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-27 10:45:21,787 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-27 10:45:21,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:21,790 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-27 10:45:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-27 10:45:21,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:21,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:21,790 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-27 10:45:21,791 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-27 10:45:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:21,794 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-27 10:45:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-27 10:45:21,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:21,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:21,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:21,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:21,794 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-27 10:45:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-04-27 10:45:21,795 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2022-04-27 10:45:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:21,796 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-04-27 10:45:21,796 INFO L496 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-27 10:45:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-27 10:45:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 10:45:21,796 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:21,796 INFO L195 NwaCegarLoop]: 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-27 10:45:21,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 10:45:21,797 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:21,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:21,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 1 times [2022-04-27 10:45:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:21,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150929791] [2022-04-27 10:45:21,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:21,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:21,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:21,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {3719#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {3711#true} is VALID [2022-04-27 10:45:21,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {3711#true} assume true; {3711#true} is VALID [2022-04-27 10:45:21,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3711#true} {3711#true} #225#return; {3711#true} is VALID [2022-04-27 10:45:21,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {3711#true} call ULTIMATE.init(); {3719#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:21,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {3719#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {3711#true} is VALID [2022-04-27 10:45:21,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {3711#true} assume true; {3711#true} is VALID [2022-04-27 10:45:21,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3711#true} {3711#true} #225#return; {3711#true} is VALID [2022-04-27 10:45:21,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {3711#true} call #t~ret11 := main(); {3711#true} is VALID [2022-04-27 10:45:21,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {3711#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {3711#true} is VALID [2022-04-27 10:45:21,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {3711#true} assume !!(~main__urilen~0 <= 1000000); {3711#true} is VALID [2022-04-27 10:45:21,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {3711#true} assume !!(~main__urilen~0 >= -1000000); {3711#true} is VALID [2022-04-27 10:45:21,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {3711#true} assume !!(~main__tokenlen~0 <= 1000000); {3711#true} is VALID [2022-04-27 10:45:21,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {3711#true} assume !!(~main__tokenlen~0 >= -1000000); {3711#true} is VALID [2022-04-27 10:45:21,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {3711#true} assume !!(~main__scheme~0 <= 1000000); {3711#true} is VALID [2022-04-27 10:45:21,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {3711#true} assume !!(~main__scheme~0 >= -1000000); {3711#true} is VALID [2022-04-27 10:45:21,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {3711#true} assume ~main__urilen~0 > 0; {3711#true} is VALID [2022-04-27 10:45:21,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {3711#true} assume ~main__tokenlen~0 > 0; {3711#true} is VALID [2022-04-27 10:45:21,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {3711#true} assume ~main__scheme~0 >= 0; {3711#true} is VALID [2022-04-27 10:45:21,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {3711#true} assume !(0 == ~main__scheme~0); {3711#true} is VALID [2022-04-27 10:45:21,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {3711#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:21,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {3716#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:21,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {3716#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:21,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {3716#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:21,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {3716#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:21,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {3716#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {3716#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:21,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {3716#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-27 10:45:21,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(0 == ~main____CPAchecker_TMP_1~0); {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-27 10:45:21,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-27 10:45:21,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-27 10:45:21,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(0 == ~__VERIFIER_assert__cond~5); {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-27 10:45:21,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {3717#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3718#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-27 10:45:21,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {3718#(not (= main_~__VERIFIER_assert__cond~6 0))} assume 0 == ~__VERIFIER_assert__cond~6; {3712#false} is VALID [2022-04-27 10:45:21,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {3712#false} assume !false; {3712#false} is VALID [2022-04-27 10:45:21,875 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-27 10:45:21,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:21,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150929791] [2022-04-27 10:45:21,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150929791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:21,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:21,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558300598] [2022-04-27 10:45:21,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:21,876 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-27 10:45:21,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:21,876 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-27 10:45:21,892 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-27 10:45:21,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:21,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:21,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:21,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:21,893 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-27 10:45:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:22,137 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-27 10:45:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:22,137 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-27 10:45:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:22,137 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-27 10:45:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-27 10:45:22,138 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-27 10:45:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-27 10:45:22,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-27 10:45:22,195 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-27 10:45:22,196 INFO L225 Difference]: With dead ends: 76 [2022-04-27 10:45:22,196 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 10:45:22,196 INFO L412 NwaCegarLoop]: 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-27 10:45:22,196 INFO L413 NwaCegarLoop]: 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-27 10:45:22,197 INFO L414 NwaCegarLoop]: 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-27 10:45:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 10:45:22,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-04-27 10:45:22,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:22,216 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-27 10:45:22,216 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-27 10:45:22,216 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-27 10:45:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:22,217 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-27 10:45:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-27 10:45:22,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:22,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:22,217 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-27 10:45:22,218 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-27 10:45:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:22,218 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-27 10:45:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-27 10:45:22,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:22,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:22,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:22,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:22,219 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-27 10:45:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-04-27 10:45:22,220 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2022-04-27 10:45:22,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:22,220 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-04-27 10:45:22,220 INFO L496 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-27 10:45:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-27 10:45:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 10:45:22,220 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:22,220 INFO L195 NwaCegarLoop]: 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-27 10:45:22,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 10:45:22,221 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:22,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:22,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 1 times [2022-04-27 10:45:22,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:22,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536878961] [2022-04-27 10:45:22,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:22,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:22,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:22,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {4056#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4048#true} is VALID [2022-04-27 10:45:22,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {4048#true} assume true; {4048#true} is VALID [2022-04-27 10:45:22,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4048#true} {4048#true} #225#return; {4048#true} is VALID [2022-04-27 10:45:22,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {4048#true} call ULTIMATE.init(); {4056#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:22,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {4056#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4048#true} is VALID [2022-04-27 10:45:22,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {4048#true} assume true; {4048#true} is VALID [2022-04-27 10:45:22,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4048#true} {4048#true} #225#return; {4048#true} is VALID [2022-04-27 10:45:22,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {4048#true} call #t~ret11 := main(); {4048#true} is VALID [2022-04-27 10:45:22,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {4048#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {4048#true} is VALID [2022-04-27 10:45:22,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {4048#true} assume !!(~main__urilen~0 <= 1000000); {4048#true} is VALID [2022-04-27 10:45:22,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {4048#true} assume !!(~main__urilen~0 >= -1000000); {4048#true} is VALID [2022-04-27 10:45:22,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {4048#true} assume !!(~main__tokenlen~0 <= 1000000); {4048#true} is VALID [2022-04-27 10:45:22,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {4048#true} assume !!(~main__tokenlen~0 >= -1000000); {4048#true} is VALID [2022-04-27 10:45:22,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {4048#true} assume !!(~main__scheme~0 <= 1000000); {4048#true} is VALID [2022-04-27 10:45:22,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {4048#true} assume !!(~main__scheme~0 >= -1000000); {4048#true} is VALID [2022-04-27 10:45:22,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {4048#true} assume ~main__urilen~0 > 0; {4048#true} is VALID [2022-04-27 10:45:22,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {4048#true} assume ~main__tokenlen~0 > 0; {4048#true} is VALID [2022-04-27 10:45:22,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {4048#true} assume ~main__scheme~0 >= 0; {4048#true} is VALID [2022-04-27 10:45:22,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {4048#true} assume !(0 == ~main__scheme~0); {4048#true} is VALID [2022-04-27 10:45:22,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {4048#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4055#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-27 10:45:22,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {4055#(not (= main_~__VERIFIER_assert__cond~16 0))} assume 0 == ~__VERIFIER_assert__cond~16; {4049#false} is VALID [2022-04-27 10:45:22,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {4049#false} assume !false; {4049#false} is VALID [2022-04-27 10:45:22,280 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-27 10:45:22,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:22,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536878961] [2022-04-27 10:45:22,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536878961] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:45:22,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088262897] [2022-04-27 10:45:22,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:22,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:45:22,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:45:22,282 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-27 10:45:22,305 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-27 10:45:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:22,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:45:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:22,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:45:22,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {4048#true} call ULTIMATE.init(); {4048#true} is VALID [2022-04-27 10:45:22,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {4048#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4048#true} is VALID [2022-04-27 10:45:22,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {4048#true} assume true; {4048#true} is VALID [2022-04-27 10:45:22,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4048#true} {4048#true} #225#return; {4048#true} is VALID [2022-04-27 10:45:22,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {4048#true} call #t~ret11 := main(); {4048#true} is VALID [2022-04-27 10:45:22,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {4048#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {4048#true} is VALID [2022-04-27 10:45:22,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {4048#true} assume !!(~main__urilen~0 <= 1000000); {4048#true} is VALID [2022-04-27 10:45:22,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {4048#true} assume !!(~main__urilen~0 >= -1000000); {4048#true} is VALID [2022-04-27 10:45:22,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {4048#true} assume !!(~main__tokenlen~0 <= 1000000); {4048#true} is VALID [2022-04-27 10:45:22,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {4048#true} assume !!(~main__tokenlen~0 >= -1000000); {4048#true} is VALID [2022-04-27 10:45:22,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {4048#true} assume !!(~main__scheme~0 <= 1000000); {4048#true} is VALID [2022-04-27 10:45:22,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {4048#true} assume !!(~main__scheme~0 >= -1000000); {4048#true} is VALID [2022-04-27 10:45:22,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {4048#true} assume ~main__urilen~0 > 0; {4048#true} is VALID [2022-04-27 10:45:22,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {4048#true} assume ~main__tokenlen~0 > 0; {4048#true} is VALID [2022-04-27 10:45:22,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {4048#true} assume ~main__scheme~0 >= 0; {4048#true} is VALID [2022-04-27 10:45:22,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {4048#true} assume !(0 == ~main__scheme~0); {4048#true} is VALID [2022-04-27 10:45:22,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {4048#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4141#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID [2022-04-27 10:45:22,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {4141#(<= 1 main_~__VERIFIER_assert__cond~16)} assume 0 == ~__VERIFIER_assert__cond~16; {4049#false} is VALID [2022-04-27 10:45:22,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {4049#false} assume !false; {4049#false} is VALID [2022-04-27 10:45:22,545 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-27 10:45:22,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:45:22,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {4049#false} assume !false; {4049#false} is VALID [2022-04-27 10:45:22,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {4141#(<= 1 main_~__VERIFIER_assert__cond~16)} assume 0 == ~__VERIFIER_assert__cond~16; {4049#false} is VALID [2022-04-27 10:45:22,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4141#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID [2022-04-27 10:45:22,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {4053#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {4048#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4053#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:22,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {4048#true} assume !(0 == ~main__scheme~0); {4048#true} is VALID [2022-04-27 10:45:22,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {4048#true} assume ~main__scheme~0 >= 0; {4048#true} is VALID [2022-04-27 10:45:22,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {4048#true} assume ~main__tokenlen~0 > 0; {4048#true} is VALID [2022-04-27 10:45:22,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {4048#true} assume ~main__urilen~0 > 0; {4048#true} is VALID [2022-04-27 10:45:22,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {4048#true} assume !!(~main__scheme~0 >= -1000000); {4048#true} is VALID [2022-04-27 10:45:22,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {4048#true} assume !!(~main__scheme~0 <= 1000000); {4048#true} is VALID [2022-04-27 10:45:22,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {4048#true} assume !!(~main__tokenlen~0 >= -1000000); {4048#true} is VALID [2022-04-27 10:45:22,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {4048#true} assume !!(~main__tokenlen~0 <= 1000000); {4048#true} is VALID [2022-04-27 10:45:22,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {4048#true} assume !!(~main__urilen~0 >= -1000000); {4048#true} is VALID [2022-04-27 10:45:22,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {4048#true} assume !!(~main__urilen~0 <= 1000000); {4048#true} is VALID [2022-04-27 10:45:22,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {4048#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {4048#true} is VALID [2022-04-27 10:45:22,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {4048#true} call #t~ret11 := main(); {4048#true} is VALID [2022-04-27 10:45:22,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4048#true} {4048#true} #225#return; {4048#true} is VALID [2022-04-27 10:45:22,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {4048#true} assume true; {4048#true} is VALID [2022-04-27 10:45:22,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {4048#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4048#true} is VALID [2022-04-27 10:45:22,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {4048#true} call ULTIMATE.init(); {4048#true} is VALID [2022-04-27 10:45:22,692 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-27 10:45:22,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088262897] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:45:22,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:45:22,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-27 10:45:22,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295539022] [2022-04-27 10:45:22,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:45:22,693 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-27 10:45:22,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:22,693 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-27 10:45:22,710 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-27 10:45:22,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:22,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:22,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:22,711 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-27 10:45:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:23,042 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-27 10:45:23,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:23,042 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-27 10:45:23,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:23,042 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-27 10:45:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-04-27 10:45:23,044 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-27 10:45:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-04-27 10:45:23,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2022-04-27 10:45:23,134 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-27 10:45:23,135 INFO L225 Difference]: With dead ends: 111 [2022-04-27 10:45:23,135 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 10:45:23,136 INFO L412 NwaCegarLoop]: 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-27 10:45:23,136 INFO L413 NwaCegarLoop]: 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-27 10:45:23,136 INFO L414 NwaCegarLoop]: 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-27 10:45:23,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 10:45:23,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2022-04-27 10:45:23,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:23,161 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-27 10:45:23,162 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-27 10:45:23,162 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-27 10:45:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:23,163 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-27 10:45:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-27 10:45:23,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:23,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:23,164 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-27 10:45:23,164 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-27 10:45:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:23,165 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-27 10:45:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-27 10:45:23,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:23,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:23,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:23,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:23,165 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-27 10:45:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-27 10:45:23,166 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2022-04-27 10:45:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:23,166 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-27 10:45:23,166 INFO L496 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-27 10:45:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-27 10:45:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 10:45:23,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:23,167 INFO L195 NwaCegarLoop]: 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-27 10:45:23,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:45:23,382 WARN L477 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-27 10:45:23,382 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 1 times [2022-04-27 10:45:23,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:23,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845581719] [2022-04-27 10:45:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:23,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:23,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {4676#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4668#true} is VALID [2022-04-27 10:45:23,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {4668#true} assume true; {4668#true} is VALID [2022-04-27 10:45:23,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4668#true} {4668#true} #225#return; {4668#true} is VALID [2022-04-27 10:45:23,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {4668#true} call ULTIMATE.init(); {4676#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:23,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {4676#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4668#true} is VALID [2022-04-27 10:45:23,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {4668#true} assume true; {4668#true} is VALID [2022-04-27 10:45:23,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4668#true} {4668#true} #225#return; {4668#true} is VALID [2022-04-27 10:45:23,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {4668#true} call #t~ret11 := main(); {4668#true} is VALID [2022-04-27 10:45:23,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {4668#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {4668#true} is VALID [2022-04-27 10:45:23,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {4668#true} assume !!(~main__urilen~0 <= 1000000); {4668#true} is VALID [2022-04-27 10:45:23,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {4668#true} assume !!(~main__urilen~0 >= -1000000); {4668#true} is VALID [2022-04-27 10:45:23,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {4668#true} assume !!(~main__tokenlen~0 <= 1000000); {4668#true} is VALID [2022-04-27 10:45:23,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {4668#true} assume !!(~main__tokenlen~0 >= -1000000); {4668#true} is VALID [2022-04-27 10:45:23,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {4668#true} assume !!(~main__scheme~0 <= 1000000); {4668#true} is VALID [2022-04-27 10:45:23,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {4668#true} assume !!(~main__scheme~0 >= -1000000); {4668#true} is VALID [2022-04-27 10:45:23,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {4668#true} assume ~main__urilen~0 > 0; {4668#true} is VALID [2022-04-27 10:45:23,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {4668#true} assume ~main__tokenlen~0 > 0; {4668#true} is VALID [2022-04-27 10:45:23,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {4668#true} assume ~main__scheme~0 >= 0; {4673#(<= 0 main_~main__scheme~0)} is VALID [2022-04-27 10:45:23,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {4673#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {4673#(<= 0 main_~main__scheme~0)} is VALID [2022-04-27 10:45:23,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {4673#(<= 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:23,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {4674#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:23,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {4674#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:23,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {4674#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:23,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {4674#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:23,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {4674#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:23,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {4674#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:23,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {4674#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:23,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {4674#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:23,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {4674#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:23,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {4674#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:23,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {4674#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4674#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:23,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {4674#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4675#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-27 10:45:23,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {4675#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {4669#false} is VALID [2022-04-27 10:45:23,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {4669#false} assume !false; {4669#false} is VALID [2022-04-27 10:45:23,476 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-27 10:45:23,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:23,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845581719] [2022-04-27 10:45:23,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845581719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:23,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:23,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:23,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105887401] [2022-04-27 10:45:23,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:23,477 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-27 10:45:23,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:23,477 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-27 10:45:23,493 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-27 10:45:23,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:23,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:23,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:23,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:23,494 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-27 10:45:23,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:23,691 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-27 10:45:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:45:23,692 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-27 10:45:23,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:23,692 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-27 10:45:23,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-27 10:45:23,693 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-27 10:45:23,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-27 10:45:23,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-04-27 10:45:23,745 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-27 10:45:23,746 INFO L225 Difference]: With dead ends: 70 [2022-04-27 10:45:23,746 INFO L226 Difference]: Without dead ends: 68 [2022-04-27 10:45:23,746 INFO L412 NwaCegarLoop]: 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-27 10:45:23,747 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 170 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:23,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 60 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:45:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-27 10:45:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-27 10:45:23,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:23,770 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-27 10:45:23,770 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-27 10:45:23,770 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-27 10:45:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:23,771 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-27 10:45:23,771 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-27 10:45:23,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:23,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:23,771 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-27 10:45:23,771 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-27 10:45:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:23,772 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-27 10:45:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-27 10:45:23,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:23,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:23,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:23,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:23,772 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-27 10:45:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-04-27 10:45:23,773 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2022-04-27 10:45:23,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:23,773 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-04-27 10:45:23,773 INFO L496 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-27 10:45:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-27 10:45:23,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 10:45:23,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:23,774 INFO L195 NwaCegarLoop]: 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-27 10:45:23,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 10:45:23,774 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:23,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:23,774 INFO L85 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 1 times [2022-04-27 10:45:23,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:23,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619391357] [2022-04-27 10:45:23,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:23,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:23,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:23,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {4987#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4979#true} is VALID [2022-04-27 10:45:23,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {4979#true} assume true; {4979#true} is VALID [2022-04-27 10:45:23,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4979#true} {4979#true} #225#return; {4979#true} is VALID [2022-04-27 10:45:23,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {4979#true} call ULTIMATE.init(); {4987#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:23,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {4987#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4979#true} is VALID [2022-04-27 10:45:23,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {4979#true} assume true; {4979#true} is VALID [2022-04-27 10:45:23,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4979#true} {4979#true} #225#return; {4979#true} is VALID [2022-04-27 10:45:23,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {4979#true} call #t~ret11 := main(); {4979#true} is VALID [2022-04-27 10:45:23,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {4979#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {4979#true} is VALID [2022-04-27 10:45:23,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {4979#true} assume !!(~main__urilen~0 <= 1000000); {4979#true} is VALID [2022-04-27 10:45:23,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {4979#true} assume !!(~main__urilen~0 >= -1000000); {4979#true} is VALID [2022-04-27 10:45:23,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {4979#true} assume !!(~main__tokenlen~0 <= 1000000); {4979#true} is VALID [2022-04-27 10:45:23,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {4979#true} assume !!(~main__tokenlen~0 >= -1000000); {4979#true} is VALID [2022-04-27 10:45:23,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {4979#true} assume !!(~main__scheme~0 <= 1000000); {4979#true} is VALID [2022-04-27 10:45:23,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {4979#true} assume !!(~main__scheme~0 >= -1000000); {4979#true} is VALID [2022-04-27 10:45:23,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {4979#true} assume ~main__urilen~0 > 0; {4979#true} is VALID [2022-04-27 10:45:23,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {4979#true} assume ~main__tokenlen~0 > 0; {4979#true} is VALID [2022-04-27 10:45:23,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {4979#true} assume ~main__scheme~0 >= 0; {4979#true} is VALID [2022-04-27 10:45:23,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {4979#true} assume !(0 == ~main__scheme~0); {4979#true} is VALID [2022-04-27 10:45:23,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {4979#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:23,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:23,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:23,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:23,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:23,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:23,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:23,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:23,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:23,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:23,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:23,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:23,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4986#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-27 10:45:23,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {4986#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {4980#false} is VALID [2022-04-27 10:45:23,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {4980#false} assume !false; {4980#false} is VALID [2022-04-27 10:45:23,834 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-27 10:45:23,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:23,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619391357] [2022-04-27 10:45:23,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619391357] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:45:23,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089132616] [2022-04-27 10:45:23,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:23,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:45:23,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:45:23,835 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-27 10:45:23,837 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-27 10:45:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:23,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:45:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:23,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:45:24,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {4979#true} call ULTIMATE.init(); {4979#true} is VALID [2022-04-27 10:45:24,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {4979#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4979#true} is VALID [2022-04-27 10:45:24,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {4979#true} assume true; {4979#true} is VALID [2022-04-27 10:45:24,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4979#true} {4979#true} #225#return; {4979#true} is VALID [2022-04-27 10:45:24,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {4979#true} call #t~ret11 := main(); {4979#true} is VALID [2022-04-27 10:45:24,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {4979#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {4979#true} is VALID [2022-04-27 10:45:24,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {4979#true} assume !!(~main__urilen~0 <= 1000000); {4979#true} is VALID [2022-04-27 10:45:24,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {4979#true} assume !!(~main__urilen~0 >= -1000000); {4979#true} is VALID [2022-04-27 10:45:24,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {4979#true} assume !!(~main__tokenlen~0 <= 1000000); {4979#true} is VALID [2022-04-27 10:45:24,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {4979#true} assume !!(~main__tokenlen~0 >= -1000000); {4979#true} is VALID [2022-04-27 10:45:24,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {4979#true} assume !!(~main__scheme~0 <= 1000000); {4979#true} is VALID [2022-04-27 10:45:24,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {4979#true} assume !!(~main__scheme~0 >= -1000000); {4979#true} is VALID [2022-04-27 10:45:24,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {4979#true} assume ~main__urilen~0 > 0; {4979#true} is VALID [2022-04-27 10:45:24,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {4979#true} assume ~main__tokenlen~0 > 0; {4979#true} is VALID [2022-04-27 10:45:24,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {4979#true} assume ~main__scheme~0 >= 0; {4979#true} is VALID [2022-04-27 10:45:24,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {4979#true} assume !(0 == ~main__scheme~0); {4979#true} is VALID [2022-04-27 10:45:24,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {4979#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5075#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID [2022-04-27 10:45:24,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {5075#(<= 1 main_~__VERIFIER_assert__cond~4)} assume 0 == ~__VERIFIER_assert__cond~4; {4980#false} is VALID [2022-04-27 10:45:24,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {4980#false} assume !false; {4980#false} is VALID [2022-04-27 10:45:24,050 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-27 10:45:24,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:45:24,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {4980#false} assume !false; {4980#false} is VALID [2022-04-27 10:45:24,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {5075#(<= 1 main_~__VERIFIER_assert__cond~4)} assume 0 == ~__VERIFIER_assert__cond~4; {4980#false} is VALID [2022-04-27 10:45:24,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5075#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID [2022-04-27 10:45:24,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {4985#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {4984#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {4979#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4984#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {4979#true} assume !(0 == ~main__scheme~0); {4979#true} is VALID [2022-04-27 10:45:24,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {4979#true} assume ~main__scheme~0 >= 0; {4979#true} is VALID [2022-04-27 10:45:24,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {4979#true} assume ~main__tokenlen~0 > 0; {4979#true} is VALID [2022-04-27 10:45:24,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {4979#true} assume ~main__urilen~0 > 0; {4979#true} is VALID [2022-04-27 10:45:24,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {4979#true} assume !!(~main__scheme~0 >= -1000000); {4979#true} is VALID [2022-04-27 10:45:24,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {4979#true} assume !!(~main__scheme~0 <= 1000000); {4979#true} is VALID [2022-04-27 10:45:24,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {4979#true} assume !!(~main__tokenlen~0 >= -1000000); {4979#true} is VALID [2022-04-27 10:45:24,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {4979#true} assume !!(~main__tokenlen~0 <= 1000000); {4979#true} is VALID [2022-04-27 10:45:24,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {4979#true} assume !!(~main__urilen~0 >= -1000000); {4979#true} is VALID [2022-04-27 10:45:24,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {4979#true} assume !!(~main__urilen~0 <= 1000000); {4979#true} is VALID [2022-04-27 10:45:24,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {4979#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {4979#true} is VALID [2022-04-27 10:45:24,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {4979#true} call #t~ret11 := main(); {4979#true} is VALID [2022-04-27 10:45:24,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4979#true} {4979#true} #225#return; {4979#true} is VALID [2022-04-27 10:45:24,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {4979#true} assume true; {4979#true} is VALID [2022-04-27 10:45:24,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {4979#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4979#true} is VALID [2022-04-27 10:45:24,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {4979#true} call ULTIMATE.init(); {4979#true} is VALID [2022-04-27 10:45:24,185 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-27 10:45:24,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089132616] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:45:24,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:45:24,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-27 10:45:24,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113499687] [2022-04-27 10:45:24,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:45:24,186 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-27 10:45:24,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:24,186 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-27 10:45:24,207 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-27 10:45:24,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:24,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:24,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:24,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:24,208 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-27 10:45:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:24,459 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-27 10:45:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:24,460 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-27 10:45:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:24,460 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-27 10:45:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-27 10:45:24,460 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-27 10:45:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-27 10:45:24,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-27 10:45:24,512 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-27 10:45:24,512 INFO L225 Difference]: With dead ends: 69 [2022-04-27 10:45:24,512 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 10:45:24,513 INFO L412 NwaCegarLoop]: 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-27 10:45:24,513 INFO L413 NwaCegarLoop]: 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-27 10:45:24,513 INFO L414 NwaCegarLoop]: 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-27 10:45:24,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 10:45:24,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-04-27 10:45:24,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:24,530 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-27 10:45:24,530 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-27 10:45:24,531 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-27 10:45:24,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:24,531 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-27 10:45:24,531 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-27 10:45:24,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:24,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:24,532 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-27 10:45:24,532 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-27 10:45:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:24,533 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-27 10:45:24,533 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-27 10:45:24,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:24,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:24,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:24,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:24,533 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-27 10:45:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-04-27 10:45:24,534 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2022-04-27 10:45:24,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:24,534 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-04-27 10:45:24,534 INFO L496 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-27 10:45:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-04-27 10:45:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 10:45:24,534 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:24,534 INFO L195 NwaCegarLoop]: 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-27 10:45:24,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:45:24,751 WARN L477 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-27 10:45:24,752 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:24,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:24,752 INFO L85 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 1 times [2022-04-27 10:45:24,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:24,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393416556] [2022-04-27 10:45:24,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:24,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:24,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:24,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {5474#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5466#true} is VALID [2022-04-27 10:45:24,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-27 10:45:24,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5466#true} {5466#true} #225#return; {5466#true} is VALID [2022-04-27 10:45:24,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {5466#true} call ULTIMATE.init(); {5474#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:24,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {5474#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5466#true} is VALID [2022-04-27 10:45:24,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-27 10:45:24,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5466#true} {5466#true} #225#return; {5466#true} is VALID [2022-04-27 10:45:24,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {5466#true} call #t~ret11 := main(); {5466#true} is VALID [2022-04-27 10:45:24,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {5466#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {5466#true} is VALID [2022-04-27 10:45:24,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {5466#true} assume !!(~main__urilen~0 <= 1000000); {5466#true} is VALID [2022-04-27 10:45:24,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {5466#true} assume !!(~main__urilen~0 >= -1000000); {5466#true} is VALID [2022-04-27 10:45:24,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {5466#true} assume !!(~main__tokenlen~0 <= 1000000); {5466#true} is VALID [2022-04-27 10:45:24,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {5466#true} assume !!(~main__tokenlen~0 >= -1000000); {5466#true} is VALID [2022-04-27 10:45:24,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {5466#true} assume !!(~main__scheme~0 <= 1000000); {5466#true} is VALID [2022-04-27 10:45:24,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {5466#true} assume !!(~main__scheme~0 >= -1000000); {5466#true} is VALID [2022-04-27 10:45:24,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {5466#true} assume ~main__urilen~0 > 0; {5466#true} is VALID [2022-04-27 10:45:24,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {5466#true} assume ~main__tokenlen~0 > 0; {5466#true} is VALID [2022-04-27 10:45:24,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {5466#true} assume ~main__scheme~0 >= 0; {5466#true} is VALID [2022-04-27 10:45:24,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {5466#true} assume !(0 == ~main__scheme~0); {5466#true} is VALID [2022-04-27 10:45:24,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {5466#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {5471#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {5471#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {5471#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {5471#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {5471#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {5471#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {5472#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {5471#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:24,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {5471#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5473#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-27 10:45:24,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {5473#(not (= main_~__VERIFIER_assert__cond~8 0))} assume 0 == ~__VERIFIER_assert__cond~8; {5467#false} is VALID [2022-04-27 10:45:24,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {5467#false} assume !false; {5467#false} is VALID [2022-04-27 10:45:24,833 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-27 10:45:24,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:24,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393416556] [2022-04-27 10:45:24,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393416556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:24,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:24,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:24,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131991859] [2022-04-27 10:45:24,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:24,840 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-27 10:45:24,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:24,840 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-27 10:45:24,858 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-27 10:45:24,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:24,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:24,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:24,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:24,859 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-27 10:45:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:25,060 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-27 10:45:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:25,060 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-27 10:45:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:25,060 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-27 10:45:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-27 10:45:25,061 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-27 10:45:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-27 10:45:25,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-27 10:45:25,118 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-27 10:45:25,119 INFO L225 Difference]: With dead ends: 63 [2022-04-27 10:45:25,119 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 10:45:25,119 INFO L412 NwaCegarLoop]: 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-27 10:45:25,120 INFO L413 NwaCegarLoop]: 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-27 10:45:25,120 INFO L414 NwaCegarLoop]: 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-27 10:45:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 10:45:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-04-27 10:45:25,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:25,135 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-27 10:45:25,135 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-27 10:45:25,135 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-27 10:45:25,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:25,136 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-27 10:45:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-27 10:45:25,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:25,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:25,136 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-27 10:45:25,137 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-27 10:45:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:25,137 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-27 10:45:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-27 10:45:25,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:25,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:25,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:25,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:25,138 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-27 10:45:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-27 10:45:25,138 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2022-04-27 10:45:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:25,138 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-27 10:45:25,139 INFO L496 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-27 10:45:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-27 10:45:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 10:45:25,139 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:25,139 INFO L195 NwaCegarLoop]: 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-27 10:45:25,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 10:45:25,139 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:25,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 1 times [2022-04-27 10:45:25,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:25,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558276488] [2022-04-27 10:45:25,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:25,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:25,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:25,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {5756#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5747#true} is VALID [2022-04-27 10:45:25,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {5747#true} assume true; {5747#true} is VALID [2022-04-27 10:45:25,186 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5747#true} {5747#true} #225#return; {5747#true} is VALID [2022-04-27 10:45:25,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {5747#true} call ULTIMATE.init(); {5756#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:25,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {5756#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5747#true} is VALID [2022-04-27 10:45:25,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {5747#true} assume true; {5747#true} is VALID [2022-04-27 10:45:25,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5747#true} {5747#true} #225#return; {5747#true} is VALID [2022-04-27 10:45:25,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {5747#true} call #t~ret11 := main(); {5747#true} is VALID [2022-04-27 10:45:25,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {5747#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {5747#true} is VALID [2022-04-27 10:45:25,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {5747#true} assume !!(~main__urilen~0 <= 1000000); {5747#true} is VALID [2022-04-27 10:45:25,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {5747#true} assume !!(~main__urilen~0 >= -1000000); {5747#true} is VALID [2022-04-27 10:45:25,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {5747#true} assume !!(~main__tokenlen~0 <= 1000000); {5747#true} is VALID [2022-04-27 10:45:25,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {5747#true} assume !!(~main__tokenlen~0 >= -1000000); {5747#true} is VALID [2022-04-27 10:45:25,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {5747#true} assume !!(~main__scheme~0 <= 1000000); {5747#true} is VALID [2022-04-27 10:45:25,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {5747#true} assume !!(~main__scheme~0 >= -1000000); {5747#true} is VALID [2022-04-27 10:45:25,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {5747#true} assume ~main__urilen~0 > 0; {5747#true} is VALID [2022-04-27 10:45:25,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {5747#true} assume ~main__tokenlen~0 > 0; {5747#true} is VALID [2022-04-27 10:45:25,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {5747#true} assume ~main__scheme~0 >= 0; {5752#(<= 0 main_~main__scheme~0)} is VALID [2022-04-27 10:45:25,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {5752#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {5752#(<= 0 main_~main__scheme~0)} is VALID [2022-04-27 10:45:25,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {5752#(<= 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {5753#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {5753#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {5753#(<= 0 main_~main__cp~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {5754#(<= 1 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {5754#(<= 1 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5754#(<= 1 main_~main__cp~0)} is VALID [2022-04-27 10:45:25,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {5754#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {5755#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-27 10:45:25,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {5755#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {5748#false} is VALID [2022-04-27 10:45:25,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {5748#false} assume !false; {5748#false} is VALID [2022-04-27 10:45:25,192 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-27 10:45:25,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:25,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558276488] [2022-04-27 10:45:25,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558276488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:25,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:25,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:45:25,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126039611] [2022-04-27 10:45:25,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:25,193 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-27 10:45:25,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:25,193 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-27 10:45:25,210 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-27 10:45:25,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:25,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:25,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:25,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:25,211 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-27 10:45:25,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:25,465 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-27 10:45:25,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:25,465 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-27 10:45:25,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:25,465 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-27 10:45:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-27 10:45:25,468 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-27 10:45:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-27 10:45:25,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-04-27 10:45:25,520 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-27 10:45:25,520 INFO L225 Difference]: With dead ends: 71 [2022-04-27 10:45:25,520 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 10:45:25,521 INFO L412 NwaCegarLoop]: 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-27 10:45:25,521 INFO L413 NwaCegarLoop]: 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-27 10:45:25,521 INFO L414 NwaCegarLoop]: 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-27 10:45:25,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 10:45:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-04-27 10:45:25,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:25,540 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-27 10:45:25,540 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-27 10:45:25,541 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-27 10:45:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:25,541 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-27 10:45:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-27 10:45:25,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:25,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:25,542 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-27 10:45:25,542 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-27 10:45:25,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:25,543 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-27 10:45:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-27 10:45:25,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:25,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:25,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:25,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:25,543 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-27 10:45:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-04-27 10:45:25,544 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2022-04-27 10:45:25,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:25,544 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-04-27 10:45:25,544 INFO L496 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-27 10:45:25,544 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-04-27 10:45:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 10:45:25,544 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:25,544 INFO L195 NwaCegarLoop]: 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-27 10:45:25,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 10:45:25,545 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:25,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:25,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 1 times [2022-04-27 10:45:25,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:25,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152483378] [2022-04-27 10:45:25,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:25,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:25,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:25,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {6060#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6052#true} is VALID [2022-04-27 10:45:25,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {6052#true} assume true; {6052#true} is VALID [2022-04-27 10:45:25,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6052#true} {6052#true} #225#return; {6052#true} is VALID [2022-04-27 10:45:25,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {6052#true} call ULTIMATE.init(); {6060#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:25,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {6060#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6052#true} is VALID [2022-04-27 10:45:25,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {6052#true} assume true; {6052#true} is VALID [2022-04-27 10:45:25,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6052#true} {6052#true} #225#return; {6052#true} is VALID [2022-04-27 10:45:25,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {6052#true} call #t~ret11 := main(); {6052#true} is VALID [2022-04-27 10:45:25,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {6052#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {6052#true} is VALID [2022-04-27 10:45:25,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {6052#true} assume !!(~main__urilen~0 <= 1000000); {6052#true} is VALID [2022-04-27 10:45:25,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {6052#true} assume !!(~main__urilen~0 >= -1000000); {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {6052#true} assume !!(~main__tokenlen~0 <= 1000000); {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {6052#true} assume !!(~main__tokenlen~0 >= -1000000); {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {6052#true} assume !!(~main__scheme~0 <= 1000000); {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {6052#true} assume !!(~main__scheme~0 >= -1000000); {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {6052#true} assume ~main__urilen~0 > 0; {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {6052#true} assume ~main__tokenlen~0 > 0; {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {6052#true} assume ~main__scheme~0 >= 0; {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {6052#true} assume !(0 == ~main__scheme~0); {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {6052#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {6052#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {6052#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {6052#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {6052#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {6052#true} assume !(0 == ~__VERIFIER_assert__cond~3); {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {6052#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {6052#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {6052#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {6052#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {6052#true} assume !(0 == ~__VERIFIER_assert__cond~5); {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {6052#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {6052#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6052#true} is VALID [2022-04-27 10:45:25,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {6052#true} assume !(0 == ~__VERIFIER_assert__cond~7); {6052#true} is VALID [2022-04-27 10:45:25,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {6052#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {6052#true} is VALID [2022-04-27 10:45:25,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {6052#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6057#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-27 10:45:25,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {6057#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6058#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:25,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {6058#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~9); {6058#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:25,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {6058#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__cp~0 != ~main__urilen~0 - 1; {6058#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:25,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {6058#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6059#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-27 10:45:25,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {6059#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {6053#false} is VALID [2022-04-27 10:45:25,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {6053#false} assume !false; {6053#false} is VALID [2022-04-27 10:45:25,601 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-27 10:45:25,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:25,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152483378] [2022-04-27 10:45:25,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152483378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:25,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:25,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129309464] [2022-04-27 10:45:25,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:25,601 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-27 10:45:25,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:25,602 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-27 10:45:25,621 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-27 10:45:25,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:25,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:25,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:25,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:25,622 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-27 10:45:25,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:25,976 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-04-27 10:45:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:45:25,976 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-27 10:45:25,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:25,976 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-27 10:45:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-04-27 10:45:25,977 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-27 10:45:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-04-27 10:45:25,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 95 transitions. [2022-04-27 10:45:26,045 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-27 10:45:26,046 INFO L225 Difference]: With dead ends: 91 [2022-04-27 10:45:26,046 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 10:45:26,046 INFO L412 NwaCegarLoop]: 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-27 10:45:26,047 INFO L413 NwaCegarLoop]: 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-27 10:45:26,047 INFO L414 NwaCegarLoop]: 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-27 10:45:26,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 10:45:26,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-04-27 10:45:26,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:26,076 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-27 10:45:26,077 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-27 10:45:26,077 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-27 10:45:26,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:26,078 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-27 10:45:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-27 10:45:26,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:26,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:26,078 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-27 10:45:26,078 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-27 10:45:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:26,079 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-27 10:45:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-27 10:45:26,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:26,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:26,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:26,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:26,080 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-27 10:45:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-04-27 10:45:26,080 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2022-04-27 10:45:26,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:26,081 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-04-27 10:45:26,081 INFO L496 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-27 10:45:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-27 10:45:26,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 10:45:26,081 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:26,081 INFO L195 NwaCegarLoop]: 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-27 10:45:26,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 10:45:26,081 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:26,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:26,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 1 times [2022-04-27 10:45:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:26,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054721567] [2022-04-27 10:45:26,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:26,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:26,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:26,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {6433#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6425#true} is VALID [2022-04-27 10:45:26,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-27 10:45:26,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6425#true} {6425#true} #225#return; {6425#true} is VALID [2022-04-27 10:45:26,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {6425#true} call ULTIMATE.init(); {6433#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:26,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {6433#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6425#true} is VALID [2022-04-27 10:45:26,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-27 10:45:26,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6425#true} {6425#true} #225#return; {6425#true} is VALID [2022-04-27 10:45:26,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {6425#true} call #t~ret11 := main(); {6425#true} is VALID [2022-04-27 10:45:26,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {6425#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {6425#true} is VALID [2022-04-27 10:45:26,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {6425#true} assume !!(~main__urilen~0 <= 1000000); {6425#true} is VALID [2022-04-27 10:45:26,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {6425#true} assume !!(~main__urilen~0 >= -1000000); {6425#true} is VALID [2022-04-27 10:45:26,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {6425#true} assume !!(~main__tokenlen~0 <= 1000000); {6425#true} is VALID [2022-04-27 10:45:26,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {6425#true} assume !!(~main__tokenlen~0 >= -1000000); {6425#true} is VALID [2022-04-27 10:45:26,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {6425#true} assume !!(~main__scheme~0 <= 1000000); {6425#true} is VALID [2022-04-27 10:45:26,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {6425#true} assume !!(~main__scheme~0 >= -1000000); {6425#true} is VALID [2022-04-27 10:45:26,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {6425#true} assume ~main__urilen~0 > 0; {6425#true} is VALID [2022-04-27 10:45:26,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {6425#true} assume ~main__tokenlen~0 > 0; {6425#true} is VALID [2022-04-27 10:45:26,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {6425#true} assume ~main__scheme~0 >= 0; {6425#true} is VALID [2022-04-27 10:45:26,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {6425#true} assume !(0 == ~main__scheme~0); {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {6425#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {6425#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {6425#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {6425#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {6425#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {6425#true} assume !(0 == ~__VERIFIER_assert__cond~3); {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {6425#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {6425#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {6425#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {6425#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {6425#true} assume !(0 == ~__VERIFIER_assert__cond~5); {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {6425#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {6425#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {6425#true} assume !(0 == ~__VERIFIER_assert__cond~7); {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {6425#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {6425#true} is VALID [2022-04-27 10:45:26,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {6425#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6425#true} is VALID [2022-04-27 10:45:26,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {6425#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6430#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} is VALID [2022-04-27 10:45:26,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {6430#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~9); {6431#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:26,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {6431#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {6431#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:26,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {6431#(<= 0 main_~main__cp~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6431#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:26,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {6431#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {6432#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 10:45:26,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {6432#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {6426#false} is VALID [2022-04-27 10:45:26,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {6426#false} assume !false; {6426#false} is VALID [2022-04-27 10:45:26,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-27 10:45:26,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:26,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054721567] [2022-04-27 10:45:26,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054721567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:26,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:26,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:26,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608045947] [2022-04-27 10:45:26,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:26,151 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-27 10:45:26,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:26,152 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-27 10:45:26,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:26,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:26,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:26,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:26,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:26,175 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-27 10:45:26,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:26,448 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-27 10:45:26,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:45:26,448 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-27 10:45:26,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:26,448 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-27 10:45:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-27 10:45:26,449 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-27 10:45:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-27 10:45:26,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2022-04-27 10:45:26,494 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-27 10:45:26,495 INFO L225 Difference]: With dead ends: 61 [2022-04-27 10:45:26,495 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 10:45:26,495 INFO L412 NwaCegarLoop]: 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-27 10:45:26,495 INFO L413 NwaCegarLoop]: 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-27 10:45:26,496 INFO L414 NwaCegarLoop]: 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-27 10:45:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 10:45:26,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-27 10:45:26,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:26,517 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-27 10:45:26,517 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-27 10:45:26,517 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-27 10:45:26,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:26,518 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-27 10:45:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-27 10:45:26,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:26,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:26,518 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-27 10:45:26,518 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-27 10:45:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:26,519 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-27 10:45:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-27 10:45:26,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:26,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:26,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:26,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:26,519 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-27 10:45:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-04-27 10:45:26,520 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2022-04-27 10:45:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:26,520 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-04-27 10:45:26,520 INFO L496 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-27 10:45:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-27 10:45:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 10:45:26,521 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:26,521 INFO L195 NwaCegarLoop]: 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-27 10:45:26,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 10:45:26,521 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:26,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:26,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 1 times [2022-04-27 10:45:26,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:26,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700407822] [2022-04-27 10:45:26,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:26,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:26,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:26,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {6705#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6698#true} is VALID [2022-04-27 10:45:26,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {6698#true} assume true; {6698#true} is VALID [2022-04-27 10:45:26,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6698#true} {6698#true} #225#return; {6698#true} is VALID [2022-04-27 10:45:26,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {6698#true} call ULTIMATE.init(); {6705#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:26,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {6705#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6698#true} is VALID [2022-04-27 10:45:26,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {6698#true} assume true; {6698#true} is VALID [2022-04-27 10:45:26,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6698#true} {6698#true} #225#return; {6698#true} is VALID [2022-04-27 10:45:26,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {6698#true} call #t~ret11 := main(); {6698#true} is VALID [2022-04-27 10:45:26,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {6698#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {6698#true} is VALID [2022-04-27 10:45:26,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {6698#true} assume !!(~main__urilen~0 <= 1000000); {6698#true} is VALID [2022-04-27 10:45:26,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {6698#true} assume !!(~main__urilen~0 >= -1000000); {6698#true} is VALID [2022-04-27 10:45:26,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {6698#true} assume !!(~main__tokenlen~0 <= 1000000); {6698#true} is VALID [2022-04-27 10:45:26,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {6698#true} assume !!(~main__tokenlen~0 >= -1000000); {6698#true} is VALID [2022-04-27 10:45:26,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {6698#true} assume !!(~main__scheme~0 <= 1000000); {6698#true} is VALID [2022-04-27 10:45:26,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {6698#true} assume !!(~main__scheme~0 >= -1000000); {6698#true} is VALID [2022-04-27 10:45:26,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {6698#true} assume ~main__urilen~0 > 0; {6698#true} is VALID [2022-04-27 10:45:26,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {6698#true} assume ~main__tokenlen~0 > 0; {6698#true} is VALID [2022-04-27 10:45:26,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {6698#true} assume ~main__scheme~0 >= 0; {6698#true} is VALID [2022-04-27 10:45:26,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {6698#true} assume !(0 == ~main__scheme~0); {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {6698#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {6698#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {6698#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {6698#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {6698#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {6698#true} assume !(0 == ~__VERIFIER_assert__cond~3); {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {6698#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {6698#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {6698#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {6698#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {6698#true} assume !(0 == ~__VERIFIER_assert__cond~5); {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {6698#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {6698#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {6698#true} assume !(0 == ~__VERIFIER_assert__cond~7); {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {6698#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {6698#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {6698#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {6698#true} assume !(0 == ~__VERIFIER_assert__cond~9); {6698#true} is VALID [2022-04-27 10:45:26,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {6698#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {6698#true} is VALID [2022-04-27 10:45:26,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {6698#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6703#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-27 10:45:26,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {6703#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {6703#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-27 10:45:26,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {6703#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {6703#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-27 10:45:26,566 INFO L290 TraceCheckUtils]: 38: Hoare triple {6703#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {6704#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-27 10:45:26,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {6704#(not (= main_~__VERIFIER_assert__cond~12 0))} assume 0 == ~__VERIFIER_assert__cond~12; {6699#false} is VALID [2022-04-27 10:45:26,566 INFO L290 TraceCheckUtils]: 40: Hoare triple {6699#false} assume !false; {6699#false} is VALID [2022-04-27 10:45:26,566 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-27 10:45:26,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:26,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700407822] [2022-04-27 10:45:26,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700407822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:26,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:26,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:45:26,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662286769] [2022-04-27 10:45:26,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:26,567 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-27 10:45:26,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:26,567 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-27 10:45:26,588 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-27 10:45:26,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:45:26,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:26,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:45:26,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:45:26,589 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-27 10:45:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:26,802 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-27 10:45:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:45:26,803 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-27 10:45:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:26,803 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-27 10:45:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-27 10:45:26,803 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-27 10:45:26,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-27 10:45:26,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-27 10:45:26,854 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-27 10:45:26,854 INFO L225 Difference]: With dead ends: 70 [2022-04-27 10:45:26,854 INFO L226 Difference]: Without dead ends: 68 [2022-04-27 10:45:26,855 INFO L412 NwaCegarLoop]: 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-27 10:45:26,855 INFO L413 NwaCegarLoop]: 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-27 10:45:26,855 INFO L414 NwaCegarLoop]: 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-27 10:45:26,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-27 10:45:26,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2022-04-27 10:45:26,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:26,876 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-27 10:45:26,876 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-27 10:45:26,876 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-27 10:45:26,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:26,877 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-27 10:45:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-27 10:45:26,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:26,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:26,877 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-27 10:45:26,877 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-27 10:45:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:26,878 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-27 10:45:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-27 10:45:26,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:26,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:26,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:26,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:26,878 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-27 10:45:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-04-27 10:45:26,879 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2022-04-27 10:45:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:26,879 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-04-27 10:45:26,879 INFO L496 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-27 10:45:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-27 10:45:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 10:45:26,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:26,880 INFO L195 NwaCegarLoop]: 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-27 10:45:26,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 10:45:26,880 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:26,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:26,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 1 times [2022-04-27 10:45:26,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:26,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127647201] [2022-04-27 10:45:26,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:26,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:26,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:26,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {7010#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7002#true} is VALID [2022-04-27 10:45:26,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {7002#true} assume true; {7002#true} is VALID [2022-04-27 10:45:26,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7002#true} {7002#true} #225#return; {7002#true} is VALID [2022-04-27 10:45:26,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {7002#true} call ULTIMATE.init(); {7010#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:26,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {7010#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7002#true} is VALID [2022-04-27 10:45:26,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {7002#true} assume true; {7002#true} is VALID [2022-04-27 10:45:26,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7002#true} {7002#true} #225#return; {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {7002#true} call #t~ret11 := main(); {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {7002#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {7002#true} assume !!(~main__urilen~0 <= 1000000); {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {7002#true} assume !!(~main__urilen~0 >= -1000000); {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {7002#true} assume !!(~main__tokenlen~0 <= 1000000); {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {7002#true} assume !!(~main__tokenlen~0 >= -1000000); {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {7002#true} assume !!(~main__scheme~0 <= 1000000); {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {7002#true} assume !!(~main__scheme~0 >= -1000000); {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {7002#true} assume ~main__urilen~0 > 0; {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {7002#true} assume ~main__tokenlen~0 > 0; {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {7002#true} assume ~main__scheme~0 >= 0; {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {7002#true} assume !(0 == ~main__scheme~0); {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {7002#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {7002#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {7002#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {7002#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {7002#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {7002#true} assume !(0 == ~__VERIFIER_assert__cond~3); {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {7002#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {7002#true} is VALID [2022-04-27 10:45:26,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {7002#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {7002#true} is VALID [2022-04-27 10:45:26,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {7002#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7002#true} is VALID [2022-04-27 10:45:26,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {7002#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7002#true} is VALID [2022-04-27 10:45:26,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {7002#true} assume !(0 == ~__VERIFIER_assert__cond~5); {7002#true} is VALID [2022-04-27 10:45:26,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {7002#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7002#true} is VALID [2022-04-27 10:45:26,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {7002#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7002#true} is VALID [2022-04-27 10:45:26,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {7002#true} assume !(0 == ~__VERIFIER_assert__cond~7); {7002#true} is VALID [2022-04-27 10:45:26,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {7002#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {7002#true} is VALID [2022-04-27 10:45:26,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {7002#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7007#(= main_~main__c~0 0)} is VALID [2022-04-27 10:45:26,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {7007#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7007#(= main_~main__c~0 0)} is VALID [2022-04-27 10:45:26,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {7007#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~9); {7007#(= main_~main__c~0 0)} is VALID [2022-04-27 10:45:26,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {7007#(= main_~main__c~0 0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7007#(= main_~main__c~0 0)} is VALID [2022-04-27 10:45:26,966 INFO L290 TraceCheckUtils]: 35: Hoare triple {7007#(= main_~main__c~0 0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7007#(= main_~main__c~0 0)} is VALID [2022-04-27 10:45:26,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {7007#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {7007#(= main_~main__c~0 0)} is VALID [2022-04-27 10:45:26,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {7007#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {7007#(= main_~main__c~0 0)} is VALID [2022-04-27 10:45:26,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {7007#(= main_~main__c~0 0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {7008#(<= 1 main_~main__c~0)} is VALID [2022-04-27 10:45:26,967 INFO L290 TraceCheckUtils]: 39: Hoare triple {7008#(<= 1 main_~main__c~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {7009#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-27 10:45:26,968 INFO L290 TraceCheckUtils]: 40: Hoare triple {7009#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {7003#false} is VALID [2022-04-27 10:45:26,968 INFO L290 TraceCheckUtils]: 41: Hoare triple {7003#false} assume !false; {7003#false} is VALID [2022-04-27 10:45:26,968 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-27 10:45:26,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:26,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127647201] [2022-04-27 10:45:26,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127647201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:26,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:26,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:26,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567842906] [2022-04-27 10:45:26,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:26,969 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-27 10:45:26,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:26,969 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-27 10:45:26,989 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-27 10:45:26,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:26,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:26,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:26,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:26,989 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-27 10:45:27,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:27,256 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-04-27 10:45:27,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:45:27,256 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-27 10:45:27,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:27,256 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-27 10:45:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-04-27 10:45:27,257 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-27 10:45:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-04-27 10:45:27,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2022-04-27 10:45:27,302 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-27 10:45:27,303 INFO L225 Difference]: With dead ends: 66 [2022-04-27 10:45:27,303 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 10:45:27,303 INFO L412 NwaCegarLoop]: 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-27 10:45:27,304 INFO L413 NwaCegarLoop]: 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-27 10:45:27,304 INFO L414 NwaCegarLoop]: 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-27 10:45:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 10:45:27,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-04-27 10:45:27,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:27,325 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-27 10:45:27,325 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-27 10:45:27,325 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-27 10:45:27,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:27,326 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-27 10:45:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-27 10:45:27,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:27,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:27,326 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-27 10:45:27,327 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-27 10:45:27,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:27,327 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-27 10:45:27,327 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-27 10:45:27,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:27,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:27,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:27,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:27,328 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-27 10:45:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-27 10:45:27,328 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2022-04-27 10:45:27,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:27,328 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-27 10:45:27,329 INFO L496 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-27 10:45:27,329 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-27 10:45:27,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 10:45:27,329 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:27,329 INFO L195 NwaCegarLoop]: 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-27 10:45:27,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 10:45:27,329 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:27,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:27,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 1 times [2022-04-27 10:45:27,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:27,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917252435] [2022-04-27 10:45:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:27,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:27,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:27,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {7296#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7288#true} is VALID [2022-04-27 10:45:27,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {7288#true} assume true; {7288#true} is VALID [2022-04-27 10:45:27,385 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7288#true} {7288#true} #225#return; {7288#true} is VALID [2022-04-27 10:45:27,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {7288#true} call ULTIMATE.init(); {7296#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:27,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {7296#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7288#true} is VALID [2022-04-27 10:45:27,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {7288#true} assume true; {7288#true} is VALID [2022-04-27 10:45:27,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7288#true} {7288#true} #225#return; {7288#true} is VALID [2022-04-27 10:45:27,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {7288#true} call #t~ret11 := main(); {7288#true} is VALID [2022-04-27 10:45:27,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {7288#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {7288#true} is VALID [2022-04-27 10:45:27,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {7288#true} assume !!(~main__urilen~0 <= 1000000); {7288#true} is VALID [2022-04-27 10:45:27,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {7288#true} assume !!(~main__urilen~0 >= -1000000); {7288#true} is VALID [2022-04-27 10:45:27,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {7288#true} assume !!(~main__tokenlen~0 <= 1000000); {7288#true} is VALID [2022-04-27 10:45:27,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {7288#true} assume !!(~main__tokenlen~0 >= -1000000); {7288#true} is VALID [2022-04-27 10:45:27,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {7288#true} assume !!(~main__scheme~0 <= 1000000); {7288#true} is VALID [2022-04-27 10:45:27,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {7288#true} assume !!(~main__scheme~0 >= -1000000); {7288#true} is VALID [2022-04-27 10:45:27,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {7288#true} assume ~main__urilen~0 > 0; {7288#true} is VALID [2022-04-27 10:45:27,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {7288#true} assume ~main__tokenlen~0 > 0; {7288#true} is VALID [2022-04-27 10:45:27,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {7288#true} assume ~main__scheme~0 >= 0; {7288#true} is VALID [2022-04-27 10:45:27,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {7288#true} assume !(0 == ~main__scheme~0); {7288#true} is VALID [2022-04-27 10:45:27,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {7288#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7288#true} is VALID [2022-04-27 10:45:27,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {7288#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7288#true} is VALID [2022-04-27 10:45:27,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {7288#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {7288#true} is VALID [2022-04-27 10:45:27,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {7288#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7288#true} is VALID [2022-04-27 10:45:27,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {7288#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7288#true} is VALID [2022-04-27 10:45:27,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {7288#true} assume !(0 == ~__VERIFIER_assert__cond~3); {7288#true} is VALID [2022-04-27 10:45:27,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {7288#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {7288#true} is VALID [2022-04-27 10:45:27,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {7288#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {7288#true} is VALID [2022-04-27 10:45:27,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {7288#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7288#true} is VALID [2022-04-27 10:45:27,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {7288#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7288#true} is VALID [2022-04-27 10:45:27,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {7288#true} assume !(0 == ~__VERIFIER_assert__cond~5); {7288#true} is VALID [2022-04-27 10:45:27,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {7288#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7288#true} is VALID [2022-04-27 10:45:27,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {7288#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7288#true} is VALID [2022-04-27 10:45:27,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {7288#true} assume !(0 == ~__VERIFIER_assert__cond~7); {7288#true} is VALID [2022-04-27 10:45:27,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {7288#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {7288#true} is VALID [2022-04-27 10:45:27,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {7288#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7293#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-27 10:45:27,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {7293#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:27,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~9); {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:27,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__cp~0 != ~main__urilen~0 - 1; {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:27,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:27,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:27,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:27,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:27,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:27,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {7294#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {7295#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-27 10:45:27,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {7295#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {7289#false} is VALID [2022-04-27 10:45:27,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {7289#false} assume !false; {7289#false} is VALID [2022-04-27 10:45:27,390 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-27 10:45:27,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:27,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917252435] [2022-04-27 10:45:27,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917252435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:27,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:27,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:27,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799200193] [2022-04-27 10:45:27,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:27,392 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-27 10:45:27,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:27,392 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-27 10:45:27,413 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-27 10:45:27,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:27,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:27,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:27,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:27,414 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-27 10:45:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:27,783 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-04-27 10:45:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:45:27,783 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-27 10:45:27,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:27,783 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-27 10:45:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2022-04-27 10:45:27,793 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-27 10:45:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2022-04-27 10:45:27,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 93 transitions. [2022-04-27 10:45:27,855 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-27 10:45:27,856 INFO L225 Difference]: With dead ends: 88 [2022-04-27 10:45:27,856 INFO L226 Difference]: Without dead ends: 86 [2022-04-27 10:45:27,857 INFO L412 NwaCegarLoop]: 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-27 10:45:27,857 INFO L413 NwaCegarLoop]: 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-27 10:45:27,857 INFO L414 NwaCegarLoop]: 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-27 10:45:27,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-27 10:45:27,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2022-04-27 10:45:27,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:27,884 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-27 10:45:27,884 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-27 10:45:27,884 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-27 10:45:27,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:27,885 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-27 10:45:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-27 10:45:27,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:27,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:27,885 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-27 10:45:27,886 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-27 10:45:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:27,886 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-27 10:45:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-27 10:45:27,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:27,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:27,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:27,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:27,887 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-27 10:45:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-04-27 10:45:27,887 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2022-04-27 10:45:27,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:27,888 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-04-27 10:45:27,888 INFO L496 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-27 10:45:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-04-27 10:45:27,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 10:45:27,888 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:27,888 INFO L195 NwaCegarLoop]: 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-27 10:45:27,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 10:45:27,888 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:27,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:27,889 INFO L85 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 1 times [2022-04-27 10:45:27,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:27,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366575538] [2022-04-27 10:45:27,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:27,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:27,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:27,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {7662#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7654#true} is VALID [2022-04-27 10:45:27,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {7654#true} assume true; {7654#true} is VALID [2022-04-27 10:45:27,944 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7654#true} {7654#true} #225#return; {7654#true} is VALID [2022-04-27 10:45:27,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {7654#true} call ULTIMATE.init(); {7662#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:27,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {7662#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7654#true} is VALID [2022-04-27 10:45:27,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {7654#true} assume true; {7654#true} is VALID [2022-04-27 10:45:27,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7654#true} {7654#true} #225#return; {7654#true} is VALID [2022-04-27 10:45:27,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {7654#true} call #t~ret11 := main(); {7654#true} is VALID [2022-04-27 10:45:27,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {7654#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {7654#true} is VALID [2022-04-27 10:45:27,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {7654#true} assume !!(~main__urilen~0 <= 1000000); {7654#true} is VALID [2022-04-27 10:45:27,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {7654#true} assume !!(~main__urilen~0 >= -1000000); {7654#true} is VALID [2022-04-27 10:45:27,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {7654#true} assume !!(~main__tokenlen~0 <= 1000000); {7654#true} is VALID [2022-04-27 10:45:27,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {7654#true} assume !!(~main__tokenlen~0 >= -1000000); {7654#true} is VALID [2022-04-27 10:45:27,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {7654#true} assume !!(~main__scheme~0 <= 1000000); {7654#true} is VALID [2022-04-27 10:45:27,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {7654#true} assume !!(~main__scheme~0 >= -1000000); {7654#true} is VALID [2022-04-27 10:45:27,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {7654#true} assume ~main__urilen~0 > 0; {7654#true} is VALID [2022-04-27 10:45:27,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {7654#true} assume ~main__tokenlen~0 > 0; {7654#true} is VALID [2022-04-27 10:45:27,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {7654#true} assume ~main__scheme~0 >= 0; {7654#true} is VALID [2022-04-27 10:45:27,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {7654#true} assume !(0 == ~main__scheme~0); {7654#true} is VALID [2022-04-27 10:45:27,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {7654#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,952 INFO L290 TraceCheckUtils]: 40: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:27,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7661#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-27 10:45:27,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {7661#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {7655#false} is VALID [2022-04-27 10:45:27,952 INFO L290 TraceCheckUtils]: 43: Hoare triple {7655#false} assume !false; {7655#false} is VALID [2022-04-27 10:45:27,952 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-27 10:45:27,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:27,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366575538] [2022-04-27 10:45:27,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366575538] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:45:27,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329367771] [2022-04-27 10:45:27,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:27,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:45:27,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:45:27,956 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-27 10:45:27,957 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-27 10:45:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:28,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 10:45:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:28,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:45:28,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {7654#true} call ULTIMATE.init(); {7654#true} is VALID [2022-04-27 10:45:28,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {7654#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7654#true} is VALID [2022-04-27 10:45:28,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {7654#true} assume true; {7654#true} is VALID [2022-04-27 10:45:28,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7654#true} {7654#true} #225#return; {7654#true} is VALID [2022-04-27 10:45:28,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {7654#true} call #t~ret11 := main(); {7654#true} is VALID [2022-04-27 10:45:28,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {7654#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {7654#true} is VALID [2022-04-27 10:45:28,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {7654#true} assume !!(~main__urilen~0 <= 1000000); {7654#true} is VALID [2022-04-27 10:45:28,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {7654#true} assume !!(~main__urilen~0 >= -1000000); {7654#true} is VALID [2022-04-27 10:45:28,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {7654#true} assume !!(~main__tokenlen~0 <= 1000000); {7654#true} is VALID [2022-04-27 10:45:28,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {7654#true} assume !!(~main__tokenlen~0 >= -1000000); {7654#true} is VALID [2022-04-27 10:45:28,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {7654#true} assume !!(~main__scheme~0 <= 1000000); {7654#true} is VALID [2022-04-27 10:45:28,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {7654#true} assume !!(~main__scheme~0 >= -1000000); {7654#true} is VALID [2022-04-27 10:45:28,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {7654#true} assume ~main__urilen~0 > 0; {7654#true} is VALID [2022-04-27 10:45:28,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {7654#true} assume ~main__tokenlen~0 > 0; {7654#true} is VALID [2022-04-27 10:45:28,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {7654#true} assume ~main__scheme~0 >= 0; {7654#true} is VALID [2022-04-27 10:45:28,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {7654#true} assume !(0 == ~main__scheme~0); {7654#true} is VALID [2022-04-27 10:45:28,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {7654#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,263 INFO L290 TraceCheckUtils]: 38: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,263 INFO L290 TraceCheckUtils]: 39: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7789#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID [2022-04-27 10:45:28,264 INFO L290 TraceCheckUtils]: 42: Hoare triple {7789#(<= 1 main_~__VERIFIER_assert__cond~10)} assume 0 == ~__VERIFIER_assert__cond~10; {7655#false} is VALID [2022-04-27 10:45:28,264 INFO L290 TraceCheckUtils]: 43: Hoare triple {7655#false} assume !false; {7655#false} is VALID [2022-04-27 10:45:28,265 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-27 10:45:28,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:45:28,456 INFO L290 TraceCheckUtils]: 43: Hoare triple {7655#false} assume !false; {7655#false} is VALID [2022-04-27 10:45:28,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {7789#(<= 1 main_~__VERIFIER_assert__cond~10)} assume 0 == ~__VERIFIER_assert__cond~10; {7655#false} is VALID [2022-04-27 10:45:28,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7789#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID [2022-04-27 10:45:28,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,459 INFO L290 TraceCheckUtils]: 35: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,459 INFO L290 TraceCheckUtils]: 32: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {7660#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {7659#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {7654#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7659#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 10:45:28,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {7654#true} assume !(0 == ~main__scheme~0); {7654#true} is VALID [2022-04-27 10:45:28,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {7654#true} assume ~main__scheme~0 >= 0; {7654#true} is VALID [2022-04-27 10:45:28,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {7654#true} assume ~main__tokenlen~0 > 0; {7654#true} is VALID [2022-04-27 10:45:28,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {7654#true} assume ~main__urilen~0 > 0; {7654#true} is VALID [2022-04-27 10:45:28,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {7654#true} assume !!(~main__scheme~0 >= -1000000); {7654#true} is VALID [2022-04-27 10:45:28,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {7654#true} assume !!(~main__scheme~0 <= 1000000); {7654#true} is VALID [2022-04-27 10:45:28,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {7654#true} assume !!(~main__tokenlen~0 >= -1000000); {7654#true} is VALID [2022-04-27 10:45:28,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {7654#true} assume !!(~main__tokenlen~0 <= 1000000); {7654#true} is VALID [2022-04-27 10:45:28,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {7654#true} assume !!(~main__urilen~0 >= -1000000); {7654#true} is VALID [2022-04-27 10:45:28,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {7654#true} assume !!(~main__urilen~0 <= 1000000); {7654#true} is VALID [2022-04-27 10:45:28,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {7654#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {7654#true} is VALID [2022-04-27 10:45:28,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {7654#true} call #t~ret11 := main(); {7654#true} is VALID [2022-04-27 10:45:28,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7654#true} {7654#true} #225#return; {7654#true} is VALID [2022-04-27 10:45:28,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {7654#true} assume true; {7654#true} is VALID [2022-04-27 10:45:28,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {7654#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7654#true} is VALID [2022-04-27 10:45:28,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {7654#true} call ULTIMATE.init(); {7654#true} is VALID [2022-04-27 10:45:28,464 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-27 10:45:28,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329367771] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:45:28,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:45:28,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-27 10:45:28,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436442657] [2022-04-27 10:45:28,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:45:28,467 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-27 10:45:28,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:28,467 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-27 10:45:28,492 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-27 10:45:28,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:28,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:28,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:28,493 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:28,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:28,742 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-04-27 10:45:28,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:28,742 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-27 10:45:28,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:28,743 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-27 10:45:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-04-27 10:45:28,743 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-27 10:45:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-04-27 10:45:28,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2022-04-27 10:45:28,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:28,798 INFO L225 Difference]: With dead ends: 60 [2022-04-27 10:45:28,798 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 10:45:28,799 INFO L412 NwaCegarLoop]: 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-27 10:45:28,799 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 84 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:28,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 54 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:45:28,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 10:45:28,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 10:45:28,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:28,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:28,821 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:28,821 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:28,822 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-27 10:45:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-27 10:45:28,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:28,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:28,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-27 10:45:28,822 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-27 10:45:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:28,823 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-27 10:45:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-27 10:45:28,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:28,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:28,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:28,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:28,823 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-27 10:45:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-04-27 10:45:28,824 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2022-04-27 10:45:28,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:28,824 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-04-27 10:45:28,824 INFO L496 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-27 10:45:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-27 10:45:28,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 10:45:28,824 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:28,824 INFO L195 NwaCegarLoop]: 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-27 10:45:28,842 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-27 10:45:29,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:45:29,025 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:29,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:29,026 INFO L85 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 1 times [2022-04-27 10:45:29,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:29,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238701487] [2022-04-27 10:45:29,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:29,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {8195#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8187#true} is VALID [2022-04-27 10:45:29,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {8187#true} assume true; {8187#true} is VALID [2022-04-27 10:45:29,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8187#true} {8187#true} #225#return; {8187#true} is VALID [2022-04-27 10:45:29,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {8187#true} call ULTIMATE.init(); {8195#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:29,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {8195#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8187#true} is VALID [2022-04-27 10:45:29,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {8187#true} assume true; {8187#true} is VALID [2022-04-27 10:45:29,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8187#true} {8187#true} #225#return; {8187#true} is VALID [2022-04-27 10:45:29,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {8187#true} call #t~ret11 := main(); {8187#true} is VALID [2022-04-27 10:45:29,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {8187#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {8187#true} is VALID [2022-04-27 10:45:29,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {8187#true} assume !!(~main__urilen~0 <= 1000000); {8187#true} is VALID [2022-04-27 10:45:29,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {8187#true} assume !!(~main__urilen~0 >= -1000000); {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {8187#true} assume !!(~main__tokenlen~0 <= 1000000); {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {8187#true} assume !!(~main__tokenlen~0 >= -1000000); {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {8187#true} assume !!(~main__scheme~0 <= 1000000); {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {8187#true} assume !!(~main__scheme~0 >= -1000000); {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {8187#true} assume ~main__urilen~0 > 0; {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {8187#true} assume ~main__tokenlen~0 > 0; {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {8187#true} assume ~main__scheme~0 >= 0; {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {8187#true} assume !(0 == ~main__scheme~0); {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {8187#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {8187#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {8187#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {8187#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {8187#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {8187#true} assume !(0 == ~__VERIFIER_assert__cond~3); {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {8187#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {8187#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {8187#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {8187#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {8187#true} assume !(0 == ~__VERIFIER_assert__cond~5); {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {8187#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {8187#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {8187#true} is VALID [2022-04-27 10:45:29,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {8187#true} assume !(0 == ~__VERIFIER_assert__cond~7); {8187#true} is VALID [2022-04-27 10:45:29,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {8187#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {8187#true} is VALID [2022-04-27 10:45:29,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {8187#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {8187#true} is VALID [2022-04-27 10:45:29,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {8187#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {8192#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} is VALID [2022-04-27 10:45:29,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {8192#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~9); {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:29,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {8193#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:29,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {8193#(<= 0 main_~main__cp~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:29,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {8193#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:29,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {8193#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:29,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {8193#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:29,094 INFO L290 TraceCheckUtils]: 39: Hoare triple {8193#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:29,094 INFO L290 TraceCheckUtils]: 40: Hoare triple {8193#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {8193#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 10:45:29,094 INFO L290 TraceCheckUtils]: 41: Hoare triple {8193#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {8194#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-27 10:45:29,094 INFO L290 TraceCheckUtils]: 42: Hoare triple {8194#(not (= main_~__VERIFIER_assert__cond~15 0))} assume 0 == ~__VERIFIER_assert__cond~15; {8188#false} is VALID [2022-04-27 10:45:29,094 INFO L290 TraceCheckUtils]: 43: Hoare triple {8188#false} assume !false; {8188#false} is VALID [2022-04-27 10:45:29,094 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-27 10:45:29,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:29,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238701487] [2022-04-27 10:45:29,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238701487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:29,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:29,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:29,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824595789] [2022-04-27 10:45:29,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:29,095 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-27 10:45:29,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:29,095 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-27 10:45:29,115 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-27 10:45:29,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:29,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:29,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:29,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:29,116 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:29,358 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-27 10:45:29,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:45:29,358 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-27 10:45:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:29,358 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-27 10:45:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-27 10:45:29,359 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-27 10:45:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-27 10:45:29,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-04-27 10:45:29,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:29,403 INFO L225 Difference]: With dead ends: 69 [2022-04-27 10:45:29,403 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 10:45:29,403 INFO L412 NwaCegarLoop]: 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-27 10:45:29,404 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:29,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 65 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:45:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 10:45:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2022-04-27 10:45:29,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:29,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:29,438 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:29,438 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:29,438 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-27 10:45:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-27 10:45:29,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:29,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:29,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-27 10:45:29,439 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-27 10:45:29,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:29,439 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-27 10:45:29,439 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-27 10:45:29,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:29,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:29,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:29,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:29,440 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-27 10:45:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-04-27 10:45:29,440 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2022-04-27 10:45:29,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:29,441 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-04-27 10:45:29,441 INFO L496 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-27 10:45:29,441 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-27 10:45:29,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 10:45:29,441 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:29,441 INFO L195 NwaCegarLoop]: 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-27 10:45:29,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 10:45:29,441 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:45:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:29,441 INFO L85 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 1 times [2022-04-27 10:45:29,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:29,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001671771] [2022-04-27 10:45:29,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:29,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {8491#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8483#true} is VALID [2022-04-27 10:45:29,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {8483#true} assume true; {8483#true} is VALID [2022-04-27 10:45:29,492 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8483#true} {8483#true} #225#return; {8483#true} is VALID [2022-04-27 10:45:29,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {8483#true} call ULTIMATE.init(); {8491#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:29,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {8491#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8483#true} is VALID [2022-04-27 10:45:29,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {8483#true} assume true; {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8483#true} {8483#true} #225#return; {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {8483#true} call #t~ret11 := main(); {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {8483#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {8483#true} assume !!(~main__urilen~0 <= 1000000); {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {8483#true} assume !!(~main__urilen~0 >= -1000000); {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {8483#true} assume !!(~main__tokenlen~0 <= 1000000); {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {8483#true} assume !!(~main__tokenlen~0 >= -1000000); {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {8483#true} assume !!(~main__scheme~0 <= 1000000); {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {8483#true} assume !!(~main__scheme~0 >= -1000000); {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {8483#true} assume ~main__urilen~0 > 0; {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {8483#true} assume ~main__tokenlen~0 > 0; {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {8483#true} assume ~main__scheme~0 >= 0; {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {8483#true} assume !(0 == ~main__scheme~0); {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {8483#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {8483#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~3); {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {8483#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {8483#true} is VALID [2022-04-27 10:45:29,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {8483#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {8483#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~5); {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {8483#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~7); {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {8483#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {8483#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~9); {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {8483#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {8483#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {8483#true} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {8483#true} assume !!(0 == ~main____CPAchecker_TMP_3~0); {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {8483#true} ~main__cp~0 := 1 + ~main__cp~0; {8483#true} is VALID [2022-04-27 10:45:29,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {8483#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {8483#true} is VALID [2022-04-27 10:45:29,495 INFO L290 TraceCheckUtils]: 41: Hoare triple {8483#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8488#(or (and (= main_~__VERIFIER_assert__cond~10 0) (<= main_~main__urilen~0 main_~main__cp~0)) (and (= main_~__VERIFIER_assert__cond~10 1) (not (<= main_~main__urilen~0 main_~main__cp~0))))} is VALID [2022-04-27 10:45:29,495 INFO L290 TraceCheckUtils]: 42: Hoare triple {8488#(or (and (= main_~__VERIFIER_assert__cond~10 0) (<= main_~main__urilen~0 main_~main__cp~0)) (and (= main_~__VERIFIER_assert__cond~10 1) (not (<= main_~main__urilen~0 main_~main__cp~0))))} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8489#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:29,495 INFO L290 TraceCheckUtils]: 43: Hoare triple {8489#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {8489#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:29,496 INFO L290 TraceCheckUtils]: 44: Hoare triple {8489#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8489#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:29,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {8489#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {8489#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 10:45:29,496 INFO L290 TraceCheckUtils]: 46: Hoare triple {8489#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {8490#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-27 10:45:29,496 INFO L290 TraceCheckUtils]: 47: Hoare triple {8490#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {8484#false} is VALID [2022-04-27 10:45:29,496 INFO L290 TraceCheckUtils]: 48: Hoare triple {8484#false} assume !false; {8484#false} is VALID [2022-04-27 10:45:29,497 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-27 10:45:29,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:29,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001671771] [2022-04-27 10:45:29,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001671771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:29,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:29,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:29,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172598099] [2022-04-27 10:45:29,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:29,497 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-27 10:45:29,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:29,498 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-27 10:45:29,518 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-27 10:45:29,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:29,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:29,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:29,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:29,519 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-27 10:45:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:29,850 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-27 10:45:29,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:45:29,850 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-27 10:45:29,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:29,850 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-27 10:45:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-27 10:45:29,851 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-27 10:45:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-27 10:45:29,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 71 transitions. [2022-04-27 10:45:29,903 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-27 10:45:29,904 INFO L225 Difference]: With dead ends: 75 [2022-04-27 10:45:29,904 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:45:29,904 INFO L412 NwaCegarLoop]: 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-27 10:45:29,904 INFO L413 NwaCegarLoop]: 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-27 10:45:29,905 INFO L414 NwaCegarLoop]: 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-27 10:45:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:45:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:45:29,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:29,905 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-27 10:45:29,905 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-27 10:45:29,905 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-27 10:45:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:29,905 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:45:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:45:29,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:29,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:29,905 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-27 10:45:29,905 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-27 10:45:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:29,906 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:45:29,906 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:45:29,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:29,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:29,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:29,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:29,906 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-27 10:45:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:45:29,906 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-04-27 10:45:29,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:29,906 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:45:29,906 INFO L496 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-27 10:45:29,906 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:45:29,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:29,908 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-04-27 10:45:29,908 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-04-27 10:45:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-04-27 10:45:29,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 10:45:29,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:45:40,433 WARN L232 SmtUtils]: Spent 10.52s on a formula simplification. DAG size of input: 127 DAG size of output: 123 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 10:46:21,428 WARN L232 SmtUtils]: Spent 39.86s 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-27 10:46:22,062 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-27 10:46:22,062 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-27 10:46:22,062 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-27 10:46:22,062 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 13 439) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point L374(line 374) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point L308(line 308) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 362) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 338) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 397) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 427) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 433) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-04-27 10:46:22,063 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 405) no Hoare annotation was computed. [2022-04-27 10:46:22,064 INFO L899 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2022-04-27 10:46:22,064 INFO L895 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-27 10:46:22,064 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 354) no Hoare annotation was computed. [2022-04-27 10:46:22,064 INFO L899 garLoopResultBuilder]: For program point L384(lines 384 393) no Hoare annotation was computed. [2022-04-27 10:46:22,064 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 412) no Hoare annotation was computed. [2022-04-27 10:46:22,064 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 437) no Hoare annotation was computed. [2022-04-27 10:46:22,064 INFO L899 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-04-27 10:46:22,064 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-04-27 10:46:22,064 INFO L895 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-27 10:46:22,064 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 13 439) no Hoare annotation was computed. [2022-04-27 10:46:22,064 INFO L899 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2022-04-27 10:46:22,064 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 411) no Hoare annotation was computed. [2022-04-27 10:46:22,064 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 416) no Hoare annotation was computed. [2022-04-27 10:46:22,064 INFO L895 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-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L294(lines 294 318) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 359) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 422) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L253(lines 253 329) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 355) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L895 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-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 346) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 434) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 322) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 353) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L262(lines 262 328) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L386(line 386) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 360) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 438) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2022-04-27 10:46:22,065 INFO L899 garLoopResultBuilder]: For program point L296(line 296) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 417) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 403) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point L272(line 272) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 435) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 395) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 414) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point L306(lines 306 316) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 344) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 432) no Hoare annotation was computed. [2022-04-27 10:46:22,066 INFO L895 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-27 10:46:22,067 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 320) no Hoare annotation was computed. [2022-04-27 10:46:22,067 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 331) no Hoare annotation was computed. [2022-04-27 10:46:22,067 INFO L899 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2022-04-27 10:46:22,067 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 357) no Hoare annotation was computed. [2022-04-27 10:46:22,067 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 436) no Hoare annotation was computed. [2022-04-27 10:46:22,067 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:46:22,067 INFO L895 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-27 10:46:22,067 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:46:22,067 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:46:22,067 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:46:22,067 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:46:22,067 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:46:22,069 INFO L356 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-27 10:46:22,070 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:46:22,072 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:46:22,072 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:46:22,073 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:46:22,073 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 10:46:22,073 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:46:22,073 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:46:22,073 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:46:22,073 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:46:22,073 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:46:22,073 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 10:46:22,073 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 10:46:22,073 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:46:22,073 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:46:22,073 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 10:46:22,073 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:46:22,073 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:46:22,073 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-27 10:46:22,074 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-27 10:46:22,075 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-27 10:46:22,075 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-04-27 10:46:22,075 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-04-27 10:46:22,075 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L374 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L374 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L386 has no Hoare annotation [2022-04-27 10:46:22,076 WARN L170 areAnnotationChecker]: L386 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-04-27 10:46:22,077 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-04-27 10:46:22,079 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-04-27 10:46:22,079 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-04-27 10:46:22,079 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2022-04-27 10:46:22,079 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2022-04-27 10:46:22,080 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2022-04-27 10:46:22,080 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2022-04-27 10:46:22,080 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2022-04-27 10:46:22,080 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2022-04-27 10:46:22,080 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2022-04-27 10:46:22,080 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2022-04-27 10:46:22,080 WARN L170 areAnnotationChecker]: L262 has no Hoare annotation [2022-04-27 10:46:22,080 WARN L170 areAnnotationChecker]: L262 has no Hoare annotation [2022-04-27 10:46:22,080 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2022-04-27 10:46:22,080 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2022-04-27 10:46:22,082 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-04-27 10:46:22,082 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-04-27 10:46:22,082 WARN L170 areAnnotationChecker]: L282 has no Hoare annotation [2022-04-27 10:46:22,082 WARN L170 areAnnotationChecker]: L282 has no Hoare annotation [2022-04-27 10:46:22,082 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2022-04-27 10:46:22,082 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2022-04-27 10:46:22,082 WARN L170 areAnnotationChecker]: L294 has no Hoare annotation [2022-04-27 10:46:22,082 WARN L170 areAnnotationChecker]: L294 has no Hoare annotation [2022-04-27 10:46:22,082 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-04-27 10:46:22,082 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-04-27 10:46:22,082 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2022-04-27 10:46:22,082 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2022-04-27 10:46:22,082 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-04-27 10:46:22,082 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-04-27 10:46:22,082 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-27 10:46:22,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:46:22 BoogieIcfgContainer [2022-04-27 10:46:22,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:46:22,094 INFO L158 Benchmark]: Toolchain (without parser) took 66135.73ms. Allocated memory was 174.1MB in the beginning and 286.3MB in the end (delta: 112.2MB). Free memory was 123.1MB in the beginning and 158.4MB in the end (delta: -35.3MB). Peak memory consumption was 146.8MB. Max. memory is 8.0GB. [2022-04-27 10:46:22,094 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 174.1MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:46:22,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.37ms. Allocated memory is still 174.1MB. Free memory was 122.9MB in the beginning and 138.4MB in the end (delta: -15.5MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-04-27 10:46:22,095 INFO L158 Benchmark]: Boogie Preprocessor took 45.85ms. Allocated memory is still 174.1MB. Free memory was 138.4MB in the beginning and 136.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:46:22,095 INFO L158 Benchmark]: RCFGBuilder took 492.15ms. Allocated memory is still 174.1MB. Free memory was 136.3MB in the beginning and 117.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-04-27 10:46:22,095 INFO L158 Benchmark]: TraceAbstraction took 65243.89ms. Allocated memory was 174.1MB in the beginning and 286.3MB in the end (delta: 112.2MB). Free memory was 116.8MB in the beginning and 158.4MB in the end (delta: -41.6MB). Peak memory consumption was 138.9MB. Max. memory is 8.0GB. [2022-04-27 10:46:22,095 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.40ms. Allocated memory is still 174.1MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 348.37ms. Allocated memory is still 174.1MB. Free memory was 122.9MB in the beginning and 138.4MB in the end (delta: -15.5MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.85ms. Allocated memory is still 174.1MB. Free memory was 138.4MB in the beginning and 136.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 492.15ms. Allocated memory is still 174.1MB. Free memory was 136.3MB in the beginning and 117.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 65243.89ms. Allocated memory was 174.1MB in the beginning and 286.3MB in the end (delta: 112.2MB). Free memory was 116.8MB in the beginning and 158.4MB in the end (delta: -41.6MB). Peak memory consumption was 138.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 94 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 65.2s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 52.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3687 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3687 mSDsluCounter, 1690 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 365 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2571 IncrementalHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 1325 mSDtfsCounter, 2571 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 269 SyntacticMatches, 18 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 296 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 732 HoareAnnotationTreeSize, 9 FomulaSimplifications, 75971 FormulaSimplificationTreeSizeReduction, 51.5s HoareSimplificationTime, 9 FomulaSimplificationsInter, 370060 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-27 10:46:22,124 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...