/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 03:50:49,321 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 03:50:49,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 03:50:49,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 03:50:49,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 03:50:49,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 03:50:49,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 03:50:49,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 03:50:49,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 03:50:49,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 03:50:49,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 03:50:49,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 03:50:49,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 03:50:49,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 03:50:49,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 03:50:49,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 03:50:49,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 03:50:49,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 03:50:49,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 03:50:49,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 03:50:49,387 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 03:50:49,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 03:50:49,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 03:50:49,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 03:50:49,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 03:50:49,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 03:50:49,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 03:50:49,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 03:50:49,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 03:50:49,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 03:50:49,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 03:50:49,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 03:50:49,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 03:50:49,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 03:50:49,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 03:50:49,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 03:50:49,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 03:50:49,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 03:50:49,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 03:50:49,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 03:50:49,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 03:50:49,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 03:50:49,421 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf
[2022-04-08 03:50:49,434 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 03:50:49,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 03:50:49,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 03:50:49,435 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-08 03:50:49,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 03:50:49,436 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-08 03:50:49,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 03:50:49,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 03:50:49,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 03:50:49,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 03:50:49,437 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-08 03:50:49,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 03:50:49,437 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 03:50:49,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 03:50:49,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 03:50:49,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 03:50:49,438 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-08 03:50:49,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 03:50:49,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 03:50:49,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 03:50:49,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-08 03:50:49,438 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-08 03:50:49,438 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-08 03:50:49,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 03:50:49,439 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN
[2022-04-08 03:50:49,439 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-08 03:50:49,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 03:50:49,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 03:50:49,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 03:50:49,714 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 03:50:49,716 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 03:50:49,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c
[2022-04-08 03:50:49,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afdf4e62/4ffcb1c6747549dbb349f1179843aa44/FLAGd321d12d3
[2022-04-08 03:50:50,237 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 03:50:50,238 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c
[2022-04-08 03:50:50,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afdf4e62/4ffcb1c6747549dbb349f1179843aa44/FLAGd321d12d3
[2022-04-08 03:50:50,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afdf4e62/4ffcb1c6747549dbb349f1179843aa44
[2022-04-08 03:50:50,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 03:50:50,646 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-08 03:50:50,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 03:50:50,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 03:50:50,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 03:50:50,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:50:50" (1/1) ...
[2022-04-08 03:50:50,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488b8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:50, skipping insertion in model container
[2022-04-08 03:50:50,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:50:50" (1/1) ...
[2022-04-08 03:50:50,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 03:50:50,699 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 03:50:50,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564]
[2022-04-08 03:50:50,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771]
[2022-04-08 03:50:50,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108]
[2022-04-08 03:50:50,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309]
[2022-04-08 03:50:50,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714]
[2022-04-08 03:50:50,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915]
[2022-04-08 03:50:50,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241]
[2022-04-08 03:50:50,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448]
[2022-04-08 03:50:50,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927]
[2022-04-08 03:50:50,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131]
[2022-04-08 03:50:50,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439]
[2022-04-08 03:50:50,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643]
[2022-04-08 03:50:50,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008]
[2022-04-08 03:50:50,914 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211]
[2022-04-08 03:50:50,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425]
[2022-04-08 03:50:50,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629]
[2022-04-08 03:50:50,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151]
[2022-04-08 03:50:50,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355]
[2022-04-08 03:50:50,923 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 03:50:50,931 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 03:50:50,958 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564]
[2022-04-08 03:50:50,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771]
[2022-04-08 03:50:50,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108]
[2022-04-08 03:50:50,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309]
[2022-04-08 03:50:50,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714]
[2022-04-08 03:50:50,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915]
[2022-04-08 03:50:50,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241]
[2022-04-08 03:50:50,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448]
[2022-04-08 03:50:50,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927]
[2022-04-08 03:50:50,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131]
[2022-04-08 03:50:50,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439]
[2022-04-08 03:50:50,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643]
[2022-04-08 03:50:50,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008]
[2022-04-08 03:50:51,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211]
[2022-04-08 03:50:51,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425]
[2022-04-08 03:50:51,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629]
[2022-04-08 03:50:51,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151]
[2022-04-08 03:50:51,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355]
[2022-04-08 03:50:51,019 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 03:50:51,040 INFO L208 MainTranslator]: Completed translation
[2022-04-08 03:50:51,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:51 WrapperNode
[2022-04-08 03:50:51,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 03:50:51,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 03:50:51,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 03:50:51,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 03:50:51,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:51" (1/1) ...
[2022-04-08 03:50:51,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:51" (1/1) ...
[2022-04-08 03:50:51,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:51" (1/1) ...
[2022-04-08 03:50:51,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:51" (1/1) ...
[2022-04-08 03:50:51,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:51" (1/1) ...
[2022-04-08 03:50:51,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:51" (1/1) ...
[2022-04-08 03:50:51,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:51" (1/1) ...
[2022-04-08 03:50:51,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 03:50:51,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 03:50:51,105 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 03:50:51,105 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 03:50:51,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:51" (1/1) ...
[2022-04-08 03:50:51,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 03:50:51,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 03:50:51,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-08 03:50:51,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-08 03:50:51,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 03:50:51,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 03:50:51,193 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 03:50:51,193 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-08 03:50:51,193 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 03:50:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 03:50:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 03:50:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 03:50:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 03:50:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-08 03:50:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 03:50:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-08 03:50:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 03:50:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 03:50:51,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 03:50:51,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 03:50:51,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 03:50:51,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 03:50:51,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 03:50:51,301 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 03:50:51,302 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 03:50:51,708 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 03:50:51,715 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 03:50:51,716 INFO L299 CfgBuilder]: Removed 0 assume(true) statements.
[2022-04-08 03:50:51,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:50:51 BoogieIcfgContainer
[2022-04-08 03:50:51,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 03:50:51,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 03:50:51,719 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 03:50:51,725 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 03:50:51,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:50:50" (1/3) ...
[2022-04-08 03:50:51,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ff5f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:50:51, skipping insertion in model container
[2022-04-08 03:50:51,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:51" (2/3) ...
[2022-04-08 03:50:51,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ff5f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:50:51, skipping insertion in model container
[2022-04-08 03:50:51,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:50:51" (3/3) ...
[2022-04-08 03:50:51,728 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c
[2022-04-08 03:50:51,734 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-08 03:50:51,734 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations.
[2022-04-08 03:50:51,788 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 03:50:51,794 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP
[2022-04-08 03:50:51,795 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2022-04-08 03:50:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 03:50:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2022-04-08 03:50:51,838 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:50:51,839 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:50:51,839 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:50:51,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:50:51,844 INFO L85 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 1 times
[2022-04-08 03:50:51,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:50:51,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1584377987]
[2022-04-08 03:50:51,864 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:50:51,864 INFO L85 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 2 times
[2022-04-08 03:50:51,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:50:51,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120290920]
[2022-04-08 03:50:51,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:50:51,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:50:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:50:52,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:50:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:50:52,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {90#true} is VALID
[2022-04-08 03:50:52,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} assume true; {90#true} is VALID
[2022-04-08 03:50:52,100 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} #225#return; {90#true} is VALID
[2022-04-08 03:50:52,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {90#true} call ULTIMATE.init(); {96#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:50:52,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {90#true} is VALID
[2022-04-08 03:50:52,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID
[2022-04-08 03:50:52,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #225#return; {90#true} is VALID
[2022-04-08 03:50:52,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} call #t~ret11 := main(); {90#true} is VALID
[2022-04-08 03:50:52,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {90#true} is VALID
[2022-04-08 03:50:52,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} assume !!(~main__urilen~0 <= 1000000); {90#true} is VALID
[2022-04-08 03:50:52,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {90#true} assume !!(~main__urilen~0 >= -1000000); {90#true} is VALID
[2022-04-08 03:50:52,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {90#true} assume !!(~main__tokenlen~0 <= 1000000); {90#true} is VALID
[2022-04-08 03:50:52,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {90#true} assume !!(~main__tokenlen~0 >= -1000000); {90#true} is VALID
[2022-04-08 03:50:52,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {90#true} assume !!(~main__scheme~0 <= 1000000); {90#true} is VALID
[2022-04-08 03:50:52,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {90#true} assume !!(~main__scheme~0 >= -1000000); {90#true} is VALID
[2022-04-08 03:50:52,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {90#true} assume ~main__urilen~0 > 0; {90#true} is VALID
[2022-04-08 03:50:52,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {90#true} assume ~main__tokenlen~0 > 0; {90#true} is VALID
[2022-04-08 03:50:52,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {90#true} assume ~main__scheme~0 >= 0; {90#true} is VALID
[2022-04-08 03:50:52,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {90#true} assume !(0 == ~main__scheme~0); {90#true} is VALID
[2022-04-08 03:50:52,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {90#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {95#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID
[2022-04-08 03:50:52,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {95#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {91#false} is VALID
[2022-04-08 03:50:52,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {91#false} assume !false; {91#false} is VALID
[2022-04-08 03:50:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:50:52,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:50:52,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120290920]
[2022-04-08 03:50:52,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120290920] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:50:52,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:50:52,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 03:50:52,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:50:52,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1584377987]
[2022-04-08 03:50:52,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1584377987] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:50:52,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:50:52,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 03:50:52,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13677155]
[2022-04-08 03:50:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:50:52,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19
[2022-04-08 03:50:52,124 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:50:52,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:52,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:52,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 03:50:52,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:50:52,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 03:50:52,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 03:50:52,168 INFO L87 Difference]: Start difference. First operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:52,475 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions.
[2022-04-08 03:50:52,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 03:50:52,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19
[2022-04-08 03:50:52,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:50:52,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions.
[2022-04-08 03:50:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions.
[2022-04-08 03:50:52,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 129 transitions.
[2022-04-08 03:50:52,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:52,692 INFO L225 Difference]: With dead ends: 93
[2022-04-08 03:50:52,693 INFO L226 Difference]: Without dead ends: 80
[2022-04-08 03:50:52,695 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 03:50:52,704 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 170 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:50:52,705 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 105 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:50:52,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2022-04-08 03:50:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80.
[2022-04-08 03:50:52,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:50:52,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:52,755 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:52,756 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:52,764 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions.
[2022-04-08 03:50:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions.
[2022-04-08 03:50:52,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:50:52,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:50:52,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states.
[2022-04-08 03:50:52,767 INFO L87 Difference]: Start difference. First operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states.
[2022-04-08 03:50:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:52,781 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions.
[2022-04-08 03:50:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions.
[2022-04-08 03:50:52,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:50:52,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:50:52,783 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:50:52,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:50:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions.
[2022-04-08 03:50:52,793 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19
[2022-04-08 03:50:52,794 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:50:52,794 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions.
[2022-04-08 03:50:52,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:52,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 83 transitions.
[2022-04-08 03:50:52,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions.
[2022-04-08 03:50:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-04-08 03:50:52,890 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:50:52,890 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:50:52,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 03:50:52,890 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:50:52,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:50:52,891 INFO L85 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 1 times
[2022-04-08 03:50:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:50:52,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [901217873]
[2022-04-08 03:50:52,894 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:50:52,894 INFO L85 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 2 times
[2022-04-08 03:50:52,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:50:52,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043977035]
[2022-04-08 03:50:52,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:50:52,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:50:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:50:52,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:50:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:50:53,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {607#true} is VALID
[2022-04-08 03:50:53,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {607#true} assume true; {607#true} is VALID
[2022-04-08 03:50:53,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {607#true} {607#true} #225#return; {607#true} is VALID
[2022-04-08 03:50:53,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {607#true} call ULTIMATE.init(); {616#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:50:53,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {607#true} is VALID
[2022-04-08 03:50:53,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {607#true} assume true; {607#true} is VALID
[2022-04-08 03:50:53,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {607#true} {607#true} #225#return; {607#true} is VALID
[2022-04-08 03:50:53,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {607#true} call #t~ret11 := main(); {607#true} is VALID
[2022-04-08 03:50:53,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {607#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {607#true} is VALID
[2022-04-08 03:50:53,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {607#true} assume !!(~main__urilen~0 <= 1000000); {607#true} is VALID
[2022-04-08 03:50:53,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {607#true} assume !!(~main__urilen~0 >= -1000000); {607#true} is VALID
[2022-04-08 03:50:53,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {607#true} assume !!(~main__tokenlen~0 <= 1000000); {607#true} is VALID
[2022-04-08 03:50:53,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {607#true} assume !!(~main__tokenlen~0 >= -1000000); {607#true} is VALID
[2022-04-08 03:50:53,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {607#true} assume !!(~main__scheme~0 <= 1000000); {607#true} is VALID
[2022-04-08 03:50:53,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {607#true} assume !!(~main__scheme~0 >= -1000000); {607#true} is VALID
[2022-04-08 03:50:53,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {607#true} assume ~main__urilen~0 > 0; {607#true} is VALID
[2022-04-08 03:50:53,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {607#true} assume ~main__tokenlen~0 > 0; {607#true} is VALID
[2022-04-08 03:50:53,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {607#true} assume ~main__scheme~0 >= 0; {612#(< 0 (+ main_~main__scheme~0 1))} is VALID
[2022-04-08 03:50:53,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {612#(< 0 (+ main_~main__scheme~0 1))} assume !(0 == ~main__scheme~0); {613#(not (<= main_~main__scheme~0 0))} is VALID
[2022-04-08 03:50:53,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {613#(not (<= main_~main__scheme~0 0))} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {614#(<= 1 main_~main__cp~0)} is VALID
[2022-04-08 03:50:53,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {615#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID
[2022-04-08 03:50:53,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {615#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {608#false} is VALID
[2022-04-08 03:50:53,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {608#false} assume !false; {608#false} is VALID
[2022-04-08 03:50:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:50:53,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:50:53,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043977035]
[2022-04-08 03:50:53,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043977035] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:50:53,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:50:53,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-08 03:50:53,017 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:50:53,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [901217873]
[2022-04-08 03:50:53,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [901217873] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:50:53,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:50:53,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-08 03:50:53,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533867880]
[2022-04-08 03:50:53,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:50:53,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20
[2022-04-08 03:50:53,018 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:50:53,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:53,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:53,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-08 03:50:53,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:50:53,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-08 03:50:53,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-04-08 03:50:53,036 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:53,453 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions.
[2022-04-08 03:50:53,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-08 03:50:53,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20
[2022-04-08 03:50:53,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:50:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions.
[2022-04-08 03:50:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions.
[2022-04-08 03:50:53,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 83 transitions.
[2022-04-08 03:50:53,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:53,549 INFO L225 Difference]: With dead ends: 80
[2022-04-08 03:50:53,549 INFO L226 Difference]: Without dead ends: 78
[2022-04-08 03:50:53,550 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-04-08 03:50:53,551 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 319 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:50:53,551 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 74 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:50:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2022-04-08 03:50:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78.
[2022-04-08 03:50:53,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:50:53,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:53,646 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:53,646 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:53,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:53,649 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions.
[2022-04-08 03:50:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions.
[2022-04-08 03:50:53,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:50:53,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:50:53,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states.
[2022-04-08 03:50:53,651 INFO L87 Difference]: Start difference. First operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states.
[2022-04-08 03:50:53,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:53,655 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions.
[2022-04-08 03:50:53,655 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions.
[2022-04-08 03:50:53,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:50:53,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:50:53,656 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:50:53,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:50:53,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions.
[2022-04-08 03:50:53,659 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20
[2022-04-08 03:50:53,660 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:50:53,660 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions.
[2022-04-08 03:50:53,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:53,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions.
[2022-04-08 03:50:53,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions.
[2022-04-08 03:50:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2022-04-08 03:50:53,752 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:50:53,752 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:50:53,752 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-08 03:50:53,752 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:50:53,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:50:53,753 INFO L85 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 1 times
[2022-04-08 03:50:53,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:50:53,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [109912958]
[2022-04-08 03:50:53,754 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:50:53,754 INFO L85 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 2 times
[2022-04-08 03:50:53,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:50:53,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557331715]
[2022-04-08 03:50:53,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:50:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:50:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:50:53,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:50:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:50:53,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {1106#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1099#true} is VALID
[2022-04-08 03:50:53,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#true} assume true; {1099#true} is VALID
[2022-04-08 03:50:53,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1099#true} {1099#true} #225#return; {1099#true} is VALID
[2022-04-08 03:50:53,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {1099#true} call ULTIMATE.init(); {1106#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:50:53,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {1106#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1099#true} is VALID
[2022-04-08 03:50:53,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#true} assume true; {1099#true} is VALID
[2022-04-08 03:50:53,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#true} {1099#true} #225#return; {1099#true} is VALID
[2022-04-08 03:50:53,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#true} call #t~ret11 := main(); {1099#true} is VALID
[2022-04-08 03:50:53,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {1099#true} is VALID
[2022-04-08 03:50:53,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {1099#true} assume !!(~main__urilen~0 <= 1000000); {1099#true} is VALID
[2022-04-08 03:50:53,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#true} assume !!(~main__urilen~0 >= -1000000); {1099#true} is VALID
[2022-04-08 03:50:53,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#true} assume !!(~main__tokenlen~0 <= 1000000); {1099#true} is VALID
[2022-04-08 03:50:53,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {1099#true} assume !!(~main__tokenlen~0 >= -1000000); {1099#true} is VALID
[2022-04-08 03:50:53,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {1099#true} assume !!(~main__scheme~0 <= 1000000); {1099#true} is VALID
[2022-04-08 03:50:53,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {1099#true} assume !!(~main__scheme~0 >= -1000000); {1099#true} is VALID
[2022-04-08 03:50:53,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {1099#true} assume ~main__urilen~0 > 0; {1099#true} is VALID
[2022-04-08 03:50:53,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {1099#true} assume ~main__tokenlen~0 > 0; {1099#true} is VALID
[2022-04-08 03:50:53,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {1099#true} assume ~main__scheme~0 >= 0; {1099#true} is VALID
[2022-04-08 03:50:53,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {1099#true} assume !(0 == ~main__scheme~0); {1099#true} is VALID
[2022-04-08 03:50:53,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {1099#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:50:53,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:50:53,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:50:53,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1105#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID
[2022-04-08 03:50:53,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {1105#(not (= main_~__VERIFIER_assert__cond~2 0))} assume 0 == ~__VERIFIER_assert__cond~2; {1100#false} is VALID
[2022-04-08 03:50:53,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {1100#false} assume !false; {1100#false} is VALID
[2022-04-08 03:50:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:50:53,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:50:53,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557331715]
[2022-04-08 03:50:53,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557331715] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:50:53,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:50:53,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 03:50:53,902 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:50:53,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [109912958]
[2022-04-08 03:50:53,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [109912958] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:50:53,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:50:53,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 03:50:53,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682271633]
[2022-04-08 03:50:53,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:50:53,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22
[2022-04-08 03:50:53,904 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:50:53,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:53,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:53,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 03:50:53,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:50:53,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 03:50:53,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-08 03:50:53,922 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:54,412 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions.
[2022-04-08 03:50:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-08 03:50:54,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22
[2022-04-08 03:50:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:50:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2022-04-08 03:50:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2022-04-08 03:50:54,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 106 transitions.
[2022-04-08 03:50:54,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:54,579 INFO L225 Difference]: With dead ends: 101
[2022-04-08 03:50:54,579 INFO L226 Difference]: Without dead ends: 99
[2022-04-08 03:50:54,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2022-04-08 03:50:54,580 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 207 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:50:54,581 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 78 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:50:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2022-04-08 03:50:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76.
[2022-04-08 03:50:54,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:50:54,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:54,682 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:54,682 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:54,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:54,685 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions.
[2022-04-08 03:50:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions.
[2022-04-08 03:50:54,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:50:54,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:50:54,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states.
[2022-04-08 03:50:54,687 INFO L87 Difference]: Start difference. First operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states.
[2022-04-08 03:50:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:54,690 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions.
[2022-04-08 03:50:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions.
[2022-04-08 03:50:54,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:50:54,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:50:54,691 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:50:54,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:50:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions.
[2022-04-08 03:50:54,694 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22
[2022-04-08 03:50:54,694 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:50:54,694 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions.
[2022-04-08 03:50:54,695 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:54,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 79 transitions.
[2022-04-08 03:50:54,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions.
[2022-04-08 03:50:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-08 03:50:54,789 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:50:54,790 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:50:54,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-04-08 03:50:54,790 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:50:54,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:50:54,791 INFO L85 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 1 times
[2022-04-08 03:50:54,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:50:54,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [294108134]
[2022-04-08 03:50:54,791 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:50:54,792 INFO L85 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 2 times
[2022-04-08 03:50:54,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:50:54,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366823962]
[2022-04-08 03:50:54,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:50:54,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:50:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:50:54,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:50:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:50:54,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {1675#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1667#true} is VALID
[2022-04-08 03:50:54,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {1667#true} assume true; {1667#true} is VALID
[2022-04-08 03:50:54,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1667#true} {1667#true} #225#return; {1667#true} is VALID
[2022-04-08 03:50:54,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {1667#true} call ULTIMATE.init(); {1675#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:50:54,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {1675#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1667#true} is VALID
[2022-04-08 03:50:54,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {1667#true} assume true; {1667#true} is VALID
[2022-04-08 03:50:54,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1667#true} {1667#true} #225#return; {1667#true} is VALID
[2022-04-08 03:50:54,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {1667#true} call #t~ret11 := main(); {1667#true} is VALID
[2022-04-08 03:50:54,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {1667#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {1667#true} is VALID
[2022-04-08 03:50:54,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {1667#true} assume !!(~main__urilen~0 <= 1000000); {1667#true} is VALID
[2022-04-08 03:50:54,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {1667#true} assume !!(~main__urilen~0 >= -1000000); {1667#true} is VALID
[2022-04-08 03:50:54,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {1667#true} assume !!(~main__tokenlen~0 <= 1000000); {1667#true} is VALID
[2022-04-08 03:50:54,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {1667#true} assume !!(~main__tokenlen~0 >= -1000000); {1667#true} is VALID
[2022-04-08 03:50:54,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {1667#true} assume !!(~main__scheme~0 <= 1000000); {1667#true} is VALID
[2022-04-08 03:50:54,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {1667#true} assume !!(~main__scheme~0 >= -1000000); {1667#true} is VALID
[2022-04-08 03:50:54,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {1667#true} assume ~main__urilen~0 > 0; {1667#true} is VALID
[2022-04-08 03:50:54,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {1667#true} assume ~main__tokenlen~0 > 0; {1667#true} is VALID
[2022-04-08 03:50:54,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {1667#true} assume ~main__scheme~0 >= 0; {1672#(<= 0 main_~main__scheme~0)} is VALID
[2022-04-08 03:50:54,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {1672#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {1672#(<= 0 main_~main__scheme~0)} is VALID
[2022-04-08 03:50:54,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {1672#(<= 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1673#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:50:54,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {1673#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1673#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:50:54,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {1673#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {1673#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:50:54,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {1673#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1673#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:50:54,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {1673#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1674#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID
[2022-04-08 03:50:54,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {1674#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {1668#false} is VALID
[2022-04-08 03:50:54,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {1668#false} assume !false; {1668#false} is VALID
[2022-04-08 03:50:54,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:50:54,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:50:54,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366823962]
[2022-04-08 03:50:54,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366823962] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:50:54,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:50:54,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:50:54,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:50:54,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [294108134]
[2022-04-08 03:50:54,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [294108134] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:50:54,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:50:54,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:50:54,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281471231]
[2022-04-08 03:50:54,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:50:54,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23
[2022-04-08 03:50:54,934 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:50:54,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:54,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:54,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:50:54,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:50:54,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:50:54,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-08 03:50:54,951 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:55,351 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions.
[2022-04-08 03:50:55,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-08 03:50:55,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23
[2022-04-08 03:50:55,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:50:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions.
[2022-04-08 03:50:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions.
[2022-04-08 03:50:55,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 79 transitions.
[2022-04-08 03:50:55,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:55,436 INFO L225 Difference]: With dead ends: 76
[2022-04-08 03:50:55,436 INFO L226 Difference]: Without dead ends: 74
[2022-04-08 03:50:55,437 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2022-04-08 03:50:55,438 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 234 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:50:55,438 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 70 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:50:55,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2022-04-08 03:50:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74.
[2022-04-08 03:50:55,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:50:55,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:55,575 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:55,575 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:55,578 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions.
[2022-04-08 03:50:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions.
[2022-04-08 03:50:55,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:50:55,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:50:55,579 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states.
[2022-04-08 03:50:55,579 INFO L87 Difference]: Start difference. First operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states.
[2022-04-08 03:50:55,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:55,592 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions.
[2022-04-08 03:50:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions.
[2022-04-08 03:50:55,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:50:55,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:50:55,593 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:50:55,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:50:55,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions.
[2022-04-08 03:50:55,596 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23
[2022-04-08 03:50:55,596 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:50:55,596 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions.
[2022-04-08 03:50:55,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:55,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 77 transitions.
[2022-04-08 03:50:55,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions.
[2022-04-08 03:50:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-04-08 03:50:55,684 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:50:55,684 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:50:55,685 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-04-08 03:50:55,685 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:50:55,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:50:55,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 1 times
[2022-04-08 03:50:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:50:55,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1228126888]
[2022-04-08 03:50:55,686 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:50:55,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 2 times
[2022-04-08 03:50:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:50:55,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798190016]
[2022-04-08 03:50:55,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:50:55,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:50:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:50:55,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:50:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:50:55,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {2140#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2132#true} is VALID
[2022-04-08 03:50:55,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {2132#true} assume true; {2132#true} is VALID
[2022-04-08 03:50:55,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2132#true} {2132#true} #225#return; {2132#true} is VALID
[2022-04-08 03:50:55,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {2132#true} call ULTIMATE.init(); {2140#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:50:55,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {2140#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2132#true} is VALID
[2022-04-08 03:50:55,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {2132#true} assume true; {2132#true} is VALID
[2022-04-08 03:50:55,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2132#true} {2132#true} #225#return; {2132#true} is VALID
[2022-04-08 03:50:55,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {2132#true} call #t~ret11 := main(); {2132#true} is VALID
[2022-04-08 03:50:55,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {2132#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {2132#true} is VALID
[2022-04-08 03:50:55,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {2132#true} assume !!(~main__urilen~0 <= 1000000); {2132#true} is VALID
[2022-04-08 03:50:55,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {2132#true} assume !!(~main__urilen~0 >= -1000000); {2132#true} is VALID
[2022-04-08 03:50:55,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {2132#true} assume !!(~main__tokenlen~0 <= 1000000); {2132#true} is VALID
[2022-04-08 03:50:55,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {2132#true} assume !!(~main__tokenlen~0 >= -1000000); {2132#true} is VALID
[2022-04-08 03:50:55,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {2132#true} assume !!(~main__scheme~0 <= 1000000); {2132#true} is VALID
[2022-04-08 03:50:55,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {2132#true} assume !!(~main__scheme~0 >= -1000000); {2132#true} is VALID
[2022-04-08 03:50:55,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {2132#true} assume ~main__urilen~0 > 0; {2132#true} is VALID
[2022-04-08 03:50:55,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {2132#true} assume ~main__tokenlen~0 > 0; {2132#true} is VALID
[2022-04-08 03:50:55,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {2132#true} assume ~main__scheme~0 >= 0; {2132#true} is VALID
[2022-04-08 03:50:55,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {2132#true} assume !(0 == ~main__scheme~0); {2132#true} is VALID
[2022-04-08 03:50:55,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {2132#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2132#true} is VALID
[2022-04-08 03:50:55,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {2132#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2132#true} is VALID
[2022-04-08 03:50:55,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {2132#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {2132#true} is VALID
[2022-04-08 03:50:55,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {2132#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2137#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID
[2022-04-08 03:50:55,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {2137#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:50:55,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~3); {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:50:55,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:50:55,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {2139#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID
[2022-04-08 03:50:55,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {2139#(not (= main_~__VERIFIER_assert__cond~16 0))} assume 0 == ~__VERIFIER_assert__cond~16; {2133#false} is VALID
[2022-04-08 03:50:55,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {2133#false} assume !false; {2133#false} is VALID
[2022-04-08 03:50:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:50:55,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:50:55,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798190016]
[2022-04-08 03:50:55,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798190016] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:50:55,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:50:55,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:50:55,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:50:55,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1228126888]
[2022-04-08 03:50:55,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1228126888] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:50:55,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:50:55,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:50:55,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509333574]
[2022-04-08 03:50:55,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:50:55,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2022-04-08 03:50:55,807 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:50:55,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:55,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:55,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:50:55,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:50:55,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:50:55,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-08 03:50:55,827 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:56,876 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions.
[2022-04-08 03:50:56,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-08 03:50:56,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2022-04-08 03:50:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:50:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2022-04-08 03:50:56,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2022-04-08 03:50:56,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 147 transitions.
[2022-04-08 03:50:57,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:57,040 INFO L225 Difference]: With dead ends: 141
[2022-04-08 03:50:57,041 INFO L226 Difference]: Without dead ends: 139
[2022-04-08 03:50:57,041 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-04-08 03:50:57,043 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 235 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 03:50:57,044 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 125 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 03:50:57,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2022-04-08 03:50:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77.
[2022-04-08 03:50:57,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:50:57,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:57,222 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:57,223 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:57,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:57,229 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions.
[2022-04-08 03:50:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions.
[2022-04-08 03:50:57,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:50:57,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:50:57,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states.
[2022-04-08 03:50:57,230 INFO L87 Difference]: Start difference. First operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states.
[2022-04-08 03:50:57,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:57,236 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions.
[2022-04-08 03:50:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions.
[2022-04-08 03:50:57,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:50:57,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:50:57,237 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:50:57,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:50:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions.
[2022-04-08 03:50:57,240 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26
[2022-04-08 03:50:57,241 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:50:57,241 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions.
[2022-04-08 03:50:57,241 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:57,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 82 transitions.
[2022-04-08 03:50:57,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions.
[2022-04-08 03:50:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-04-08 03:50:57,360 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:50:57,360 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:50:57,361 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-04-08 03:50:57,361 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:50:57,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:50:57,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 1 times
[2022-04-08 03:50:57,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:50:57,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1591796329]
[2022-04-08 03:50:57,362 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:50:57,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 2 times
[2022-04-08 03:50:57,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:50:57,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172885806]
[2022-04-08 03:50:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:50:57,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:50:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:50:57,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:50:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:50:57,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {2875#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2867#true} is VALID
[2022-04-08 03:50:57,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {2867#true} assume true; {2867#true} is VALID
[2022-04-08 03:50:57,439 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2867#true} {2867#true} #225#return; {2867#true} is VALID
[2022-04-08 03:50:57,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {2867#true} call ULTIMATE.init(); {2875#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:50:57,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {2875#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2867#true} is VALID
[2022-04-08 03:50:57,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {2867#true} assume true; {2867#true} is VALID
[2022-04-08 03:50:57,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2867#true} {2867#true} #225#return; {2867#true} is VALID
[2022-04-08 03:50:57,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {2867#true} call #t~ret11 := main(); {2867#true} is VALID
[2022-04-08 03:50:57,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {2867#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {2867#true} is VALID
[2022-04-08 03:50:57,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {2867#true} assume !!(~main__urilen~0 <= 1000000); {2867#true} is VALID
[2022-04-08 03:50:57,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {2867#true} assume !!(~main__urilen~0 >= -1000000); {2867#true} is VALID
[2022-04-08 03:50:57,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {2867#true} assume !!(~main__tokenlen~0 <= 1000000); {2867#true} is VALID
[2022-04-08 03:50:57,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {2867#true} assume !!(~main__tokenlen~0 >= -1000000); {2867#true} is VALID
[2022-04-08 03:50:57,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {2867#true} assume !!(~main__scheme~0 <= 1000000); {2867#true} is VALID
[2022-04-08 03:50:57,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {2867#true} assume !!(~main__scheme~0 >= -1000000); {2867#true} is VALID
[2022-04-08 03:50:57,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {2867#true} assume ~main__urilen~0 > 0; {2867#true} is VALID
[2022-04-08 03:50:57,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {2867#true} assume ~main__tokenlen~0 > 0; {2867#true} is VALID
[2022-04-08 03:50:57,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {2867#true} assume ~main__scheme~0 >= 0; {2867#true} is VALID
[2022-04-08 03:50:57,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {2867#true} assume !(0 == ~main__scheme~0); {2867#true} is VALID
[2022-04-08 03:50:57,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {2867#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2867#true} is VALID
[2022-04-08 03:50:57,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {2867#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2867#true} is VALID
[2022-04-08 03:50:57,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {2867#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {2867#true} is VALID
[2022-04-08 03:50:57,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {2867#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2872#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID
[2022-04-08 03:50:57,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {2872#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:50:57,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~3); {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:50:57,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(~main__cp~0 != ~main__urilen~0 - 1); {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:50:57,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2874#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID
[2022-04-08 03:50:57,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {2874#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {2868#false} is VALID
[2022-04-08 03:50:57,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {2868#false} assume !false; {2868#false} is VALID
[2022-04-08 03:50:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:50:57,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:50:57,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172885806]
[2022-04-08 03:50:57,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172885806] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:50:57,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:50:57,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:50:57,450 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:50:57,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1591796329]
[2022-04-08 03:50:57,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1591796329] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:50:57,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:50:57,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:50:57,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246322290]
[2022-04-08 03:50:57,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:50:57,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2022-04-08 03:50:57,451 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:50:57,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:57,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:57,469 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:50:57,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:50:57,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:50:57,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-08 03:50:57,472 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:58,231 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions.
[2022-04-08 03:50:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-08 03:50:58,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2022-04-08 03:50:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:50:58,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions.
[2022-04-08 03:50:58,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions.
[2022-04-08 03:50:58,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 114 transitions.
[2022-04-08 03:50:58,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:58,346 INFO L225 Difference]: With dead ends: 108
[2022-04-08 03:50:58,346 INFO L226 Difference]: Without dead ends: 106
[2022-04-08 03:50:58,347 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-04-08 03:50:58,349 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 220 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 03:50:58,351 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 81 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 03:50:58,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2022-04-08 03:50:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79.
[2022-04-08 03:50:58,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:50:58,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:58,553 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:58,553 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:58,556 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions.
[2022-04-08 03:50:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions.
[2022-04-08 03:50:58,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:50:58,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:50:58,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states.
[2022-04-08 03:50:58,558 INFO L87 Difference]: Start difference. First operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states.
[2022-04-08 03:50:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:58,560 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions.
[2022-04-08 03:50:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions.
[2022-04-08 03:50:58,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:50:58,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:50:58,561 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:50:58,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:50:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions.
[2022-04-08 03:50:58,563 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26
[2022-04-08 03:50:58,564 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:50:58,565 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions.
[2022-04-08 03:50:58,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:58,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 84 transitions.
[2022-04-08 03:50:58,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:58,704 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions.
[2022-04-08 03:50:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2022-04-08 03:50:58,704 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:50:58,704 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:50:58,705 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-04-08 03:50:58,705 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:50:58,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:50:58,705 INFO L85 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 1 times
[2022-04-08 03:50:58,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:50:58,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2062506850]
[2022-04-08 03:50:58,706 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:50:58,706 INFO L85 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 2 times
[2022-04-08 03:50:58,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:50:58,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470717614]
[2022-04-08 03:50:58,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:50:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:50:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:50:58,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:50:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:50:58,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {3483#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {3475#true} is VALID
[2022-04-08 03:50:58,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {3475#true} assume true; {3475#true} is VALID
[2022-04-08 03:50:58,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3475#true} {3475#true} #225#return; {3475#true} is VALID
[2022-04-08 03:50:58,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {3475#true} call ULTIMATE.init(); {3483#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:50:58,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {3483#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {3475#true} is VALID
[2022-04-08 03:50:58,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {3475#true} assume true; {3475#true} is VALID
[2022-04-08 03:50:58,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3475#true} {3475#true} #225#return; {3475#true} is VALID
[2022-04-08 03:50:58,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {3475#true} call #t~ret11 := main(); {3475#true} is VALID
[2022-04-08 03:50:58,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {3475#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {3475#true} is VALID
[2022-04-08 03:50:58,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {3475#true} assume !!(~main__urilen~0 <= 1000000); {3475#true} is VALID
[2022-04-08 03:50:58,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {3475#true} assume !!(~main__urilen~0 >= -1000000); {3475#true} is VALID
[2022-04-08 03:50:58,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {3475#true} assume !!(~main__tokenlen~0 <= 1000000); {3475#true} is VALID
[2022-04-08 03:50:58,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {3475#true} assume !!(~main__tokenlen~0 >= -1000000); {3475#true} is VALID
[2022-04-08 03:50:58,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {3475#true} assume !!(~main__scheme~0 <= 1000000); {3475#true} is VALID
[2022-04-08 03:50:58,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {3475#true} assume !!(~main__scheme~0 >= -1000000); {3475#true} is VALID
[2022-04-08 03:50:58,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {3475#true} assume ~main__urilen~0 > 0; {3475#true} is VALID
[2022-04-08 03:50:58,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {3475#true} assume ~main__tokenlen~0 > 0; {3475#true} is VALID
[2022-04-08 03:50:58,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {3475#true} assume ~main__scheme~0 >= 0; {3475#true} is VALID
[2022-04-08 03:50:58,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {3475#true} assume !(0 == ~main__scheme~0); {3475#true} is VALID
[2022-04-08 03:50:58,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {3475#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3475#true} is VALID
[2022-04-08 03:50:58,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {3475#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3475#true} is VALID
[2022-04-08 03:50:58,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {3475#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {3475#true} is VALID
[2022-04-08 03:50:58,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {3475#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3475#true} is VALID
[2022-04-08 03:50:58,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {3475#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3480#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} is VALID
[2022-04-08 03:50:58,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {3480#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~3); {3481#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:50:58,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {3481#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {3481#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:50:58,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {3481#(<= 0 main_~main__cp~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {3481#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:50:58,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {3481#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {3482#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID
[2022-04-08 03:50:58,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {3482#(not (= main_~__VERIFIER_assert__cond~17 0))} assume 0 == ~__VERIFIER_assert__cond~17; {3476#false} is VALID
[2022-04-08 03:50:58,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {3476#false} assume !false; {3476#false} is VALID
[2022-04-08 03:50:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:50:58,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:50:58,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470717614]
[2022-04-08 03:50:58,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470717614] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:50:58,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:50:58,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:50:58,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:50:58,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2062506850]
[2022-04-08 03:50:58,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2062506850] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:50:58,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:50:58,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:50:58,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993158975]
[2022-04-08 03:50:58,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:50:58,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 03:50:58,815 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:50:58,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:58,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:58,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:50:58,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:50:58,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:50:58,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-08 03:50:58,833 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:59,531 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions.
[2022-04-08 03:50:59,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-08 03:50:59,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 03:50:59,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:50:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions.
[2022-04-08 03:50:59,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions.
[2022-04-08 03:50:59,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 125 transitions.
[2022-04-08 03:50:59,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:59,656 INFO L225 Difference]: With dead ends: 121
[2022-04-08 03:50:59,656 INFO L226 Difference]: Without dead ends: 119
[2022-04-08 03:50:59,657 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2022-04-08 03:50:59,657 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 215 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:50:59,658 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 104 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:50:59,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2022-04-08 03:50:59,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77.
[2022-04-08 03:50:59,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:50:59,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:59,803 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:59,803 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:59,806 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions.
[2022-04-08 03:50:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions.
[2022-04-08 03:50:59,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:50:59,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:50:59,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states.
[2022-04-08 03:50:59,807 INFO L87 Difference]: Start difference. First operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states.
[2022-04-08 03:50:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:50:59,810 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions.
[2022-04-08 03:50:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions.
[2022-04-08 03:50:59,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:50:59,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:50:59,810 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:50:59,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:50:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions.
[2022-04-08 03:50:59,812 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27
[2022-04-08 03:50:59,813 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:50:59,813 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions.
[2022-04-08 03:50:59,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:50:59,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 82 transitions.
[2022-04-08 03:50:59,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:50:59,923 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions.
[2022-04-08 03:50:59,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2022-04-08 03:50:59,923 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:50:59,924 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:50:59,924 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-04-08 03:50:59,924 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:50:59,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:50:59,924 INFO L85 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 1 times
[2022-04-08 03:50:59,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:50:59,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1117172848]
[2022-04-08 03:50:59,925 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:50:59,925 INFO L85 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 2 times
[2022-04-08 03:50:59,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:50:59,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417808094]
[2022-04-08 03:50:59,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:50:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:50:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:00,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:00,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {4134#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4126#true} is VALID
[2022-04-08 03:51:00,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {4126#true} assume true; {4126#true} is VALID
[2022-04-08 03:51:00,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4126#true} {4126#true} #225#return; {4126#true} is VALID
[2022-04-08 03:51:00,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {4126#true} call ULTIMATE.init(); {4134#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:00,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {4134#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4126#true} is VALID
[2022-04-08 03:51:00,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {4126#true} assume true; {4126#true} is VALID
[2022-04-08 03:51:00,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4126#true} {4126#true} #225#return; {4126#true} is VALID
[2022-04-08 03:51:00,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {4126#true} call #t~ret11 := main(); {4126#true} is VALID
[2022-04-08 03:51:00,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {4126#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {4126#true} is VALID
[2022-04-08 03:51:00,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {4126#true} assume !!(~main__urilen~0 <= 1000000); {4126#true} is VALID
[2022-04-08 03:51:00,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {4126#true} assume !!(~main__urilen~0 >= -1000000); {4126#true} is VALID
[2022-04-08 03:51:00,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {4126#true} assume !!(~main__tokenlen~0 <= 1000000); {4126#true} is VALID
[2022-04-08 03:51:00,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {4126#true} assume !!(~main__tokenlen~0 >= -1000000); {4126#true} is VALID
[2022-04-08 03:51:00,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {4126#true} assume !!(~main__scheme~0 <= 1000000); {4126#true} is VALID
[2022-04-08 03:51:00,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {4126#true} assume !!(~main__scheme~0 >= -1000000); {4126#true} is VALID
[2022-04-08 03:51:00,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {4126#true} assume ~main__urilen~0 > 0; {4126#true} is VALID
[2022-04-08 03:51:00,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {4126#true} assume ~main__tokenlen~0 > 0; {4126#true} is VALID
[2022-04-08 03:51:00,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {4126#true} assume ~main__scheme~0 >= 0; {4126#true} is VALID
[2022-04-08 03:51:00,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {4126#true} assume !(0 == ~main__scheme~0); {4126#true} is VALID
[2022-04-08 03:51:00,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {4126#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4126#true} is VALID
[2022-04-08 03:51:00,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {4126#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4126#true} is VALID
[2022-04-08 03:51:00,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {4126#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {4126#true} is VALID
[2022-04-08 03:51:00,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {4126#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4126#true} is VALID
[2022-04-08 03:51:00,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {4126#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4131#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} is VALID
[2022-04-08 03:51:00,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {4131#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~3); {4132#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:00,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {4132#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 != ~main__urilen~0 - 1); {4132#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:00,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {4132#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4132#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:00,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {4132#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {4133#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID
[2022-04-08 03:51:00,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {4133#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {4127#false} is VALID
[2022-04-08 03:51:00,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {4127#false} assume !false; {4127#false} is VALID
[2022-04-08 03:51:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:51:00,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:00,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417808094]
[2022-04-08 03:51:00,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417808094] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:00,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:00,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:00,056 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:00,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1117172848]
[2022-04-08 03:51:00,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1117172848] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:00,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:00,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:00,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546422967]
[2022-04-08 03:51:00,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:00,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 03:51:00,057 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:00,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:00,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:00,074 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:51:00,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:00,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:51:00,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-08 03:51:00,075 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:00,532 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions.
[2022-04-08 03:51:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-08 03:51:00,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 03:51:00,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions.
[2022-04-08 03:51:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions.
[2022-04-08 03:51:00,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions.
[2022-04-08 03:51:00,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:00,609 INFO L225 Difference]: With dead ends: 77
[2022-04-08 03:51:00,609 INFO L226 Difference]: Without dead ends: 75
[2022-04-08 03:51:00,609 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2022-04-08 03:51:00,610 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 197 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:00,610 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 70 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:51:00,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2022-04-08 03:51:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75.
[2022-04-08 03:51:00,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:00,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:00,748 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:00,748 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:00,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:00,750 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions.
[2022-04-08 03:51:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions.
[2022-04-08 03:51:00,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:00,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:00,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states.
[2022-04-08 03:51:00,751 INFO L87 Difference]: Start difference. First operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states.
[2022-04-08 03:51:00,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:00,753 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions.
[2022-04-08 03:51:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions.
[2022-04-08 03:51:00,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:00,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:00,753 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:00,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:00,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions.
[2022-04-08 03:51:00,756 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27
[2022-04-08 03:51:00,756 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:00,756 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions.
[2022-04-08 03:51:00,757 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:00,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 80 transitions.
[2022-04-08 03:51:00,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions.
[2022-04-08 03:51:00,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 03:51:00,855 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:51:00,855 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:51:00,855 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-04-08 03:51:00,855 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:51:00,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:51:00,856 INFO L85 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 1 times
[2022-04-08 03:51:00,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:00,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [926165495]
[2022-04-08 03:51:00,856 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:51:00,857 INFO L85 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 2 times
[2022-04-08 03:51:00,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:51:00,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643320556]
[2022-04-08 03:51:00,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:51:00,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:51:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:00,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:00,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {4603#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4597#true} is VALID
[2022-04-08 03:51:00,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {4597#true} assume true; {4597#true} is VALID
[2022-04-08 03:51:00,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4597#true} {4597#true} #225#return; {4597#true} is VALID
[2022-04-08 03:51:00,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {4597#true} call ULTIMATE.init(); {4603#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:00,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {4603#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4597#true} is VALID
[2022-04-08 03:51:00,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {4597#true} assume true; {4597#true} is VALID
[2022-04-08 03:51:00,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4597#true} {4597#true} #225#return; {4597#true} is VALID
[2022-04-08 03:51:00,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {4597#true} call #t~ret11 := main(); {4597#true} is VALID
[2022-04-08 03:51:00,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {4597#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {4597#true} is VALID
[2022-04-08 03:51:00,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {4597#true} assume !!(~main__urilen~0 <= 1000000); {4597#true} is VALID
[2022-04-08 03:51:00,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {4597#true} assume !!(~main__urilen~0 >= -1000000); {4597#true} is VALID
[2022-04-08 03:51:00,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {4597#true} assume !!(~main__tokenlen~0 <= 1000000); {4597#true} is VALID
[2022-04-08 03:51:00,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {4597#true} assume !!(~main__tokenlen~0 >= -1000000); {4597#true} is VALID
[2022-04-08 03:51:00,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {4597#true} assume !!(~main__scheme~0 <= 1000000); {4597#true} is VALID
[2022-04-08 03:51:00,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {4597#true} assume !!(~main__scheme~0 >= -1000000); {4597#true} is VALID
[2022-04-08 03:51:00,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {4597#true} assume ~main__urilen~0 > 0; {4597#true} is VALID
[2022-04-08 03:51:00,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {4597#true} assume ~main__tokenlen~0 > 0; {4597#true} is VALID
[2022-04-08 03:51:00,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {4597#true} assume ~main__scheme~0 >= 0; {4597#true} is VALID
[2022-04-08 03:51:00,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {4597#true} assume !(0 == ~main__scheme~0); {4597#true} is VALID
[2022-04-08 03:51:00,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {4597#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4597#true} is VALID
[2022-04-08 03:51:00,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {4597#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4597#true} is VALID
[2022-04-08 03:51:00,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {4597#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {4597#true} is VALID
[2022-04-08 03:51:00,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {4597#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4597#true} is VALID
[2022-04-08 03:51:00,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {4597#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4597#true} is VALID
[2022-04-08 03:51:00,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {4597#true} assume !(0 == ~__VERIFIER_assert__cond~3); {4597#true} is VALID
[2022-04-08 03:51:00,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {4597#true} assume !(~main__cp~0 != ~main__urilen~0 - 1); {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID
[2022-04-08 03:51:00,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID
[2022-04-08 03:51:00,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID
[2022-04-08 03:51:00,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} assume !(0 == ~__VERIFIER_assert__cond~5); {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID
[2022-04-08 03:51:00,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4598#false} is VALID
[2022-04-08 03:51:00,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {4598#false} assume 0 == ~__VERIFIER_assert__cond~6; {4598#false} is VALID
[2022-04-08 03:51:00,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {4598#false} assume !false; {4598#false} is VALID
[2022-04-08 03:51:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:51:00,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:00,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643320556]
[2022-04-08 03:51:00,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643320556] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:00,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:00,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 03:51:00,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:00,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [926165495]
[2022-04-08 03:51:00,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [926165495] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:00,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:00,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 03:51:00,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173799310]
[2022-04-08 03:51:00,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:00,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 03:51:00,927 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:00,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:00,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:00,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 03:51:00,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:00,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 03:51:00,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 03:51:00,948 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:01,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:01,305 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions.
[2022-04-08 03:51:01,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 03:51:01,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 03:51:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:01,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions.
[2022-04-08 03:51:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions.
[2022-04-08 03:51:01,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions.
[2022-04-08 03:51:01,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:01,403 INFO L225 Difference]: With dead ends: 115
[2022-04-08 03:51:01,403 INFO L226 Difference]: Without dead ends: 75
[2022-04-08 03:51:01,403 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 03:51:01,404 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:01,404 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 78 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:51:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2022-04-08 03:51:01,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75.
[2022-04-08 03:51:01,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:01,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:01,548 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:01,549 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:01,551 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions.
[2022-04-08 03:51:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions.
[2022-04-08 03:51:01,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:01,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:01,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states.
[2022-04-08 03:51:01,552 INFO L87 Difference]: Start difference. First operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states.
[2022-04-08 03:51:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:01,553 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions.
[2022-04-08 03:51:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions.
[2022-04-08 03:51:01,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:01,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:01,554 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:01,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions.
[2022-04-08 03:51:01,555 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29
[2022-04-08 03:51:01,555 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:01,556 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions.
[2022-04-08 03:51:01,556 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:01,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 78 transitions.
[2022-04-08 03:51:01,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions.
[2022-04-08 03:51:01,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2022-04-08 03:51:01,687 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:51:01,687 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:51:01,688 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-04-08 03:51:01,688 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:51:01,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:51:01,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 1 times
[2022-04-08 03:51:01,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:01,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1557710963]
[2022-04-08 03:51:01,689 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:51:01,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 2 times
[2022-04-08 03:51:01,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:51:01,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357101631]
[2022-04-08 03:51:01,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:51:01,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:51:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:01,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:01,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {5146#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5138#true} is VALID
[2022-04-08 03:51:01,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {5138#true} assume true; {5138#true} is VALID
[2022-04-08 03:51:01,774 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5138#true} {5138#true} #225#return; {5138#true} is VALID
[2022-04-08 03:51:01,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5146#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:01,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {5146#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5138#true} is VALID
[2022-04-08 03:51:01,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID
[2022-04-08 03:51:01,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #225#return; {5138#true} is VALID
[2022-04-08 03:51:01,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret11 := main(); {5138#true} is VALID
[2022-04-08 03:51:01,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {5138#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {5138#true} is VALID
[2022-04-08 03:51:01,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {5138#true} assume !!(~main__urilen~0 <= 1000000); {5138#true} is VALID
[2022-04-08 03:51:01,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} assume !!(~main__urilen~0 >= -1000000); {5138#true} is VALID
[2022-04-08 03:51:01,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !!(~main__tokenlen~0 <= 1000000); {5138#true} is VALID
[2022-04-08 03:51:01,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume !!(~main__tokenlen~0 >= -1000000); {5138#true} is VALID
[2022-04-08 03:51:01,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {5138#true} assume !!(~main__scheme~0 <= 1000000); {5138#true} is VALID
[2022-04-08 03:51:01,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {5138#true} assume !!(~main__scheme~0 >= -1000000); {5138#true} is VALID
[2022-04-08 03:51:01,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {5138#true} assume ~main__urilen~0 > 0; {5138#true} is VALID
[2022-04-08 03:51:01,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {5138#true} assume ~main__tokenlen~0 > 0; {5138#true} is VALID
[2022-04-08 03:51:01,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} assume ~main__scheme~0 >= 0; {5138#true} is VALID
[2022-04-08 03:51:01,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~main__scheme~0); {5138#true} is VALID
[2022-04-08 03:51:01,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:01,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:01,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:01,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:01,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:01,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:01,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID
[2022-04-08 03:51:01,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(0 == ~main____CPAchecker_TMP_1~0); {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID
[2022-04-08 03:51:01,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID
[2022-04-08 03:51:01,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID
[2022-04-08 03:51:01,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(0 == ~__VERIFIER_assert__cond~5); {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID
[2022-04-08 03:51:01,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5145#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID
[2022-04-08 03:51:01,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {5145#(not (= main_~__VERIFIER_assert__cond~6 0))} assume 0 == ~__VERIFIER_assert__cond~6; {5139#false} is VALID
[2022-04-08 03:51:01,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {5139#false} assume !false; {5139#false} is VALID
[2022-04-08 03:51:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:51:01,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:01,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357101631]
[2022-04-08 03:51:01,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357101631] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:01,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:01,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:01,783 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:01,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1557710963]
[2022-04-08 03:51:01,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1557710963] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:01,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:01,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:01,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18364802]
[2022-04-08 03:51:01,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:01,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 03:51:01,784 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:01,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:01,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:01,804 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:51:01,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:01,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:51:01,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2022-04-08 03:51:01,804 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:02,256 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions.
[2022-04-08 03:51:02,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-08 03:51:02,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 03:51:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions.
[2022-04-08 03:51:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions.
[2022-04-08 03:51:02,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions.
[2022-04-08 03:51:02,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:02,340 INFO L225 Difference]: With dead ends: 76
[2022-04-08 03:51:02,340 INFO L226 Difference]: Without dead ends: 74
[2022-04-08 03:51:02,340 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90
[2022-04-08 03:51:02,342 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 183 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:02,343 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 62 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:51:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2022-04-08 03:51:02,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73.
[2022-04-08 03:51:02,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:02,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:02,554 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:02,554 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:02,556 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions.
[2022-04-08 03:51:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions.
[2022-04-08 03:51:02,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:02,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:02,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states.
[2022-04-08 03:51:02,557 INFO L87 Difference]: Start difference. First operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states.
[2022-04-08 03:51:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:02,558 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions.
[2022-04-08 03:51:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions.
[2022-04-08 03:51:02,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:02,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:02,558 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:02,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions.
[2022-04-08 03:51:02,560 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30
[2022-04-08 03:51:02,560 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:02,560 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions.
[2022-04-08 03:51:02,560 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:02,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 76 transitions.
[2022-04-08 03:51:02,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:02,663 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions.
[2022-04-08 03:51:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2022-04-08 03:51:02,663 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:51:02,663 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:51:02,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-04-08 03:51:02,664 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:51:02,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:51:02,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 1 times
[2022-04-08 03:51:02,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:02,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [665850246]
[2022-04-08 03:51:02,665 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:51:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 2 times
[2022-04-08 03:51:02,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:51:02,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67207573]
[2022-04-08 03:51:02,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:51:02,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:51:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:02,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:02,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {5611#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5603#true} is VALID
[2022-04-08 03:51:02,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {5603#true} assume true; {5603#true} is VALID
[2022-04-08 03:51:02,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5603#true} {5603#true} #225#return; {5603#true} is VALID
[2022-04-08 03:51:02,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {5603#true} call ULTIMATE.init(); {5611#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:02,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {5611#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5603#true} is VALID
[2022-04-08 03:51:02,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {5603#true} assume true; {5603#true} is VALID
[2022-04-08 03:51:02,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5603#true} {5603#true} #225#return; {5603#true} is VALID
[2022-04-08 03:51:02,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {5603#true} call #t~ret11 := main(); {5603#true} is VALID
[2022-04-08 03:51:02,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {5603#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {5603#true} is VALID
[2022-04-08 03:51:02,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {5603#true} assume !!(~main__urilen~0 <= 1000000); {5603#true} is VALID
[2022-04-08 03:51:02,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {5603#true} assume !!(~main__urilen~0 >= -1000000); {5603#true} is VALID
[2022-04-08 03:51:02,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {5603#true} assume !!(~main__tokenlen~0 <= 1000000); {5603#true} is VALID
[2022-04-08 03:51:02,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {5603#true} assume !!(~main__tokenlen~0 >= -1000000); {5603#true} is VALID
[2022-04-08 03:51:02,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {5603#true} assume !!(~main__scheme~0 <= 1000000); {5603#true} is VALID
[2022-04-08 03:51:02,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {5603#true} assume !!(~main__scheme~0 >= -1000000); {5603#true} is VALID
[2022-04-08 03:51:02,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {5603#true} assume ~main__urilen~0 > 0; {5603#true} is VALID
[2022-04-08 03:51:02,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {5603#true} assume ~main__tokenlen~0 > 0; {5603#true} is VALID
[2022-04-08 03:51:02,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {5603#true} assume ~main__scheme~0 >= 0; {5603#true} is VALID
[2022-04-08 03:51:02,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {5603#true} assume !(0 == ~main__scheme~0); {5603#true} is VALID
[2022-04-08 03:51:02,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {5603#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:02,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:02,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:02,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:02,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:02,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:02,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:02,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:02,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:02,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:02,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:02,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5610#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID
[2022-04-08 03:51:02,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {5610#(not (= main_~__VERIFIER_assert__cond~16 0))} assume 0 == ~__VERIFIER_assert__cond~16; {5604#false} is VALID
[2022-04-08 03:51:02,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {5604#false} assume !false; {5604#false} is VALID
[2022-04-08 03:51:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-08 03:51:02,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:02,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67207573]
[2022-04-08 03:51:02,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67207573] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 03:51:02,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603731179]
[2022-04-08 03:51:02,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 03:51:02,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 03:51:02,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 03:51:02,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 03:51:02,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-08 03:51:02,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 03:51:02,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 03:51:02,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-08 03:51:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:02,872 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 03:51:03,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {5603#true} call ULTIMATE.init(); {5603#true} is VALID
[2022-04-08 03:51:03,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {5603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5603#true} is VALID
[2022-04-08 03:51:03,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {5603#true} assume true; {5603#true} is VALID
[2022-04-08 03:51:03,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5603#true} {5603#true} #225#return; {5603#true} is VALID
[2022-04-08 03:51:03,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {5603#true} call #t~ret11 := main(); {5603#true} is VALID
[2022-04-08 03:51:03,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {5603#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {5603#true} is VALID
[2022-04-08 03:51:03,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {5603#true} assume !!(~main__urilen~0 <= 1000000); {5603#true} is VALID
[2022-04-08 03:51:03,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {5603#true} assume !!(~main__urilen~0 >= -1000000); {5603#true} is VALID
[2022-04-08 03:51:03,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {5603#true} assume !!(~main__tokenlen~0 <= 1000000); {5603#true} is VALID
[2022-04-08 03:51:03,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {5603#true} assume !!(~main__tokenlen~0 >= -1000000); {5603#true} is VALID
[2022-04-08 03:51:03,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {5603#true} assume !!(~main__scheme~0 <= 1000000); {5603#true} is VALID
[2022-04-08 03:51:03,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {5603#true} assume !!(~main__scheme~0 >= -1000000); {5603#true} is VALID
[2022-04-08 03:51:03,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {5603#true} assume ~main__urilen~0 > 0; {5603#true} is VALID
[2022-04-08 03:51:03,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {5603#true} assume ~main__tokenlen~0 > 0; {5603#true} is VALID
[2022-04-08 03:51:03,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {5603#true} assume ~main__scheme~0 >= 0; {5603#true} is VALID
[2022-04-08 03:51:03,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {5603#true} assume !(0 == ~main__scheme~0); {5603#true} is VALID
[2022-04-08 03:51:03,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {5603#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5696#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID
[2022-04-08 03:51:03,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {5696#(<= 1 main_~__VERIFIER_assert__cond~16)} assume 0 == ~__VERIFIER_assert__cond~16; {5604#false} is VALID
[2022-04-08 03:51:03,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {5604#false} assume !false; {5604#false} is VALID
[2022-04-08 03:51:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-08 03:51:03,100 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 03:51:03,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {5604#false} assume !false; {5604#false} is VALID
[2022-04-08 03:51:03,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {5696#(<= 1 main_~__VERIFIER_assert__cond~16)} assume 0 == ~__VERIFIER_assert__cond~16; {5604#false} is VALID
[2022-04-08 03:51:03,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5696#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID
[2022-04-08 03:51:03,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {5603#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:03,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {5603#true} assume !(0 == ~main__scheme~0); {5603#true} is VALID
[2022-04-08 03:51:03,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {5603#true} assume ~main__scheme~0 >= 0; {5603#true} is VALID
[2022-04-08 03:51:03,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {5603#true} assume ~main__tokenlen~0 > 0; {5603#true} is VALID
[2022-04-08 03:51:03,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {5603#true} assume ~main__urilen~0 > 0; {5603#true} is VALID
[2022-04-08 03:51:03,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {5603#true} assume !!(~main__scheme~0 >= -1000000); {5603#true} is VALID
[2022-04-08 03:51:03,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {5603#true} assume !!(~main__scheme~0 <= 1000000); {5603#true} is VALID
[2022-04-08 03:51:03,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {5603#true} assume !!(~main__tokenlen~0 >= -1000000); {5603#true} is VALID
[2022-04-08 03:51:03,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {5603#true} assume !!(~main__tokenlen~0 <= 1000000); {5603#true} is VALID
[2022-04-08 03:51:03,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {5603#true} assume !!(~main__urilen~0 >= -1000000); {5603#true} is VALID
[2022-04-08 03:51:03,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {5603#true} assume !!(~main__urilen~0 <= 1000000); {5603#true} is VALID
[2022-04-08 03:51:03,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {5603#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {5603#true} is VALID
[2022-04-08 03:51:03,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {5603#true} call #t~ret11 := main(); {5603#true} is VALID
[2022-04-08 03:51:03,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5603#true} {5603#true} #225#return; {5603#true} is VALID
[2022-04-08 03:51:03,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {5603#true} assume true; {5603#true} is VALID
[2022-04-08 03:51:03,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {5603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5603#true} is VALID
[2022-04-08 03:51:03,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {5603#true} call ULTIMATE.init(); {5603#true} is VALID
[2022-04-08 03:51:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-08 03:51:03,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603731179] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 03:51:03,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 03:51:03,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7
[2022-04-08 03:51:03,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:03,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [665850246]
[2022-04-08 03:51:03,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [665850246] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:03,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:03,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:03,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975985351]
[2022-04-08 03:51:03,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:03,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 03:51:03,309 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:03,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:03,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:03,329 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:51:03,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:03,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:51:03,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2022-04-08 03:51:03,330 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:04,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:04,065 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions.
[2022-04-08 03:51:04,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-08 03:51:04,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 03:51:04,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:04,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2022-04-08 03:51:04,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2022-04-08 03:51:04,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 114 transitions.
[2022-04-08 03:51:04,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:04,182 INFO L225 Difference]: With dead ends: 111
[2022-04-08 03:51:04,182 INFO L226 Difference]: Without dead ends: 109
[2022-04-08 03:51:04,182 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110
[2022-04-08 03:51:04,183 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 187 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:04,183 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 87 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:51:04,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2022-04-08 03:51:04,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70.
[2022-04-08 03:51:04,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:04,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:04,362 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:04,362 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:04,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:04,364 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions.
[2022-04-08 03:51:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions.
[2022-04-08 03:51:04,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:04,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:04,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states.
[2022-04-08 03:51:04,365 INFO L87 Difference]: Start difference. First operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states.
[2022-04-08 03:51:04,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:04,366 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions.
[2022-04-08 03:51:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions.
[2022-04-08 03:51:04,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:04,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:04,367 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:04,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:04,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions.
[2022-04-08 03:51:04,368 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30
[2022-04-08 03:51:04,368 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:04,368 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions.
[2022-04-08 03:51:04,368 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:04,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions.
[2022-04-08 03:51:04,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions.
[2022-04-08 03:51:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2022-04-08 03:51:04,498 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:51:04,498 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:51:04,527 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-08 03:51:04,698 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2022-04-08 03:51:04,699 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:51:04,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:51:04,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 1 times
[2022-04-08 03:51:04,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:04,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1044599828]
[2022-04-08 03:51:04,700 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:51:04,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 2 times
[2022-04-08 03:51:04,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:51:04,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332851821]
[2022-04-08 03:51:04,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:51:04,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:51:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:04,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:04,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {6388#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6380#true} is VALID
[2022-04-08 03:51:04,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {6380#true} assume true; {6380#true} is VALID
[2022-04-08 03:51:04,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6380#true} {6380#true} #225#return; {6380#true} is VALID
[2022-04-08 03:51:04,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {6380#true} call ULTIMATE.init(); {6388#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:04,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {6388#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6380#true} is VALID
[2022-04-08 03:51:04,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {6380#true} assume true; {6380#true} is VALID
[2022-04-08 03:51:04,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6380#true} {6380#true} #225#return; {6380#true} is VALID
[2022-04-08 03:51:04,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {6380#true} call #t~ret11 := main(); {6380#true} is VALID
[2022-04-08 03:51:04,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {6380#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {6380#true} is VALID
[2022-04-08 03:51:04,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {6380#true} assume !!(~main__urilen~0 <= 1000000); {6380#true} is VALID
[2022-04-08 03:51:04,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {6380#true} assume !!(~main__urilen~0 >= -1000000); {6380#true} is VALID
[2022-04-08 03:51:04,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {6380#true} assume !!(~main__tokenlen~0 <= 1000000); {6380#true} is VALID
[2022-04-08 03:51:04,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {6380#true} assume !!(~main__tokenlen~0 >= -1000000); {6380#true} is VALID
[2022-04-08 03:51:04,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {6380#true} assume !!(~main__scheme~0 <= 1000000); {6380#true} is VALID
[2022-04-08 03:51:04,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {6380#true} assume !!(~main__scheme~0 >= -1000000); {6380#true} is VALID
[2022-04-08 03:51:04,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {6380#true} assume ~main__urilen~0 > 0; {6380#true} is VALID
[2022-04-08 03:51:04,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {6380#true} assume ~main__tokenlen~0 > 0; {6380#true} is VALID
[2022-04-08 03:51:04,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {6380#true} assume ~main__scheme~0 >= 0; {6385#(<= 0 main_~main__scheme~0)} is VALID
[2022-04-08 03:51:04,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {6385#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {6385#(<= 0 main_~main__scheme~0)} is VALID
[2022-04-08 03:51:04,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {6385#(<= 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6386#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:04,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6386#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:04,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {6386#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:04,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6386#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:04,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6386#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:04,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {6386#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:04,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6386#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:04,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {6386#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:04,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {6386#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6386#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:04,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6386#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:04,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {6386#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:04,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6386#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:04,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6387#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID
[2022-04-08 03:51:04,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {6387#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {6381#false} is VALID
[2022-04-08 03:51:04,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {6381#false} assume !false; {6381#false} is VALID
[2022-04-08 03:51:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:51:04,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:04,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332851821]
[2022-04-08 03:51:04,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332851821] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:04,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:04,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:04,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:04,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1044599828]
[2022-04-08 03:51:04,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1044599828] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:04,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:04,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:04,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002427]
[2022-04-08 03:51:04,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:04,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 03:51:04,773 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:04,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:04,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:04,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:51:04,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:04,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:51:04,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-08 03:51:04,801 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:05,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:05,192 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions.
[2022-04-08 03:51:05,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-08 03:51:05,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 03:51:05,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions.
[2022-04-08 03:51:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions.
[2022-04-08 03:51:05,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 68 transitions.
[2022-04-08 03:51:05,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:05,266 INFO L225 Difference]: With dead ends: 70
[2022-04-08 03:51:05,267 INFO L226 Difference]: Without dead ends: 68
[2022-04-08 03:51:05,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2022-04-08 03:51:05,268 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 170 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:05,268 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 60 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:51:05,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2022-04-08 03:51:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68.
[2022-04-08 03:51:05,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:05,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:05,476 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:05,476 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:05,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:05,477 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions.
[2022-04-08 03:51:05,477 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions.
[2022-04-08 03:51:05,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:05,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:05,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states.
[2022-04-08 03:51:05,478 INFO L87 Difference]: Start difference. First operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states.
[2022-04-08 03:51:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:05,479 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions.
[2022-04-08 03:51:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions.
[2022-04-08 03:51:05,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:05,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:05,480 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:05,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions.
[2022-04-08 03:51:05,481 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31
[2022-04-08 03:51:05,482 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:05,482 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions.
[2022-04-08 03:51:05,482 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:05,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 71 transitions.
[2022-04-08 03:51:05,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions.
[2022-04-08 03:51:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2022-04-08 03:51:05,612 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:51:05,612 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:51:05,612 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-04-08 03:51:05,612 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:51:05,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:51:05,613 INFO L85 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 1 times
[2022-04-08 03:51:05,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:05,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2098445105]
[2022-04-08 03:51:05,613 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:51:05,614 INFO L85 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 2 times
[2022-04-08 03:51:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:51:05,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167831598]
[2022-04-08 03:51:05,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:51:05,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:51:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:05,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:05,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {6817#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6809#true} is VALID
[2022-04-08 03:51:05,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {6809#true} assume true; {6809#true} is VALID
[2022-04-08 03:51:05,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6809#true} {6809#true} #225#return; {6809#true} is VALID
[2022-04-08 03:51:05,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {6809#true} call ULTIMATE.init(); {6817#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:05,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {6817#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6809#true} is VALID
[2022-04-08 03:51:05,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {6809#true} assume true; {6809#true} is VALID
[2022-04-08 03:51:05,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6809#true} {6809#true} #225#return; {6809#true} is VALID
[2022-04-08 03:51:05,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {6809#true} call #t~ret11 := main(); {6809#true} is VALID
[2022-04-08 03:51:05,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {6809#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {6809#true} is VALID
[2022-04-08 03:51:05,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {6809#true} assume !!(~main__urilen~0 <= 1000000); {6809#true} is VALID
[2022-04-08 03:51:05,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {6809#true} assume !!(~main__urilen~0 >= -1000000); {6809#true} is VALID
[2022-04-08 03:51:05,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {6809#true} assume !!(~main__tokenlen~0 <= 1000000); {6809#true} is VALID
[2022-04-08 03:51:05,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {6809#true} assume !!(~main__tokenlen~0 >= -1000000); {6809#true} is VALID
[2022-04-08 03:51:05,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {6809#true} assume !!(~main__scheme~0 <= 1000000); {6809#true} is VALID
[2022-04-08 03:51:05,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {6809#true} assume !!(~main__scheme~0 >= -1000000); {6809#true} is VALID
[2022-04-08 03:51:05,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {6809#true} assume ~main__urilen~0 > 0; {6809#true} is VALID
[2022-04-08 03:51:05,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {6809#true} assume ~main__tokenlen~0 > 0; {6809#true} is VALID
[2022-04-08 03:51:05,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {6809#true} assume ~main__scheme~0 >= 0; {6809#true} is VALID
[2022-04-08 03:51:05,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {6809#true} assume !(0 == ~main__scheme~0); {6809#true} is VALID
[2022-04-08 03:51:05,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {6809#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6816#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID
[2022-04-08 03:51:05,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {6816#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {6810#false} is VALID
[2022-04-08 03:51:05,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {6810#false} assume !false; {6810#false} is VALID
[2022-04-08 03:51:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-08 03:51:05,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:05,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167831598]
[2022-04-08 03:51:05,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167831598] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 03:51:05,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90456133]
[2022-04-08 03:51:05,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 03:51:05,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 03:51:05,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 03:51:05,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 03:51:05,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-04-08 03:51:05,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 03:51:05,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 03:51:05,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-08 03:51:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:05,773 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 03:51:05,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {6809#true} call ULTIMATE.init(); {6809#true} is VALID
[2022-04-08 03:51:05,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {6809#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6809#true} is VALID
[2022-04-08 03:51:05,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {6809#true} assume true; {6809#true} is VALID
[2022-04-08 03:51:05,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6809#true} {6809#true} #225#return; {6809#true} is VALID
[2022-04-08 03:51:05,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {6809#true} call #t~ret11 := main(); {6809#true} is VALID
[2022-04-08 03:51:05,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {6809#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {6809#true} is VALID
[2022-04-08 03:51:05,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {6809#true} assume !!(~main__urilen~0 <= 1000000); {6809#true} is VALID
[2022-04-08 03:51:05,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {6809#true} assume !!(~main__urilen~0 >= -1000000); {6809#true} is VALID
[2022-04-08 03:51:05,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {6809#true} assume !!(~main__tokenlen~0 <= 1000000); {6809#true} is VALID
[2022-04-08 03:51:05,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {6809#true} assume !!(~main__tokenlen~0 >= -1000000); {6809#true} is VALID
[2022-04-08 03:51:05,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {6809#true} assume !!(~main__scheme~0 <= 1000000); {6809#true} is VALID
[2022-04-08 03:51:05,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {6809#true} assume !!(~main__scheme~0 >= -1000000); {6809#true} is VALID
[2022-04-08 03:51:05,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {6809#true} assume ~main__urilen~0 > 0; {6809#true} is VALID
[2022-04-08 03:51:05,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {6809#true} assume ~main__tokenlen~0 > 0; {6809#true} is VALID
[2022-04-08 03:51:05,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {6809#true} assume ~main__scheme~0 >= 0; {6809#true} is VALID
[2022-04-08 03:51:05,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {6809#true} assume !(0 == ~main__scheme~0); {6809#true} is VALID
[2022-04-08 03:51:05,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {6809#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:05,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6905#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID
[2022-04-08 03:51:05,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {6905#(<= 1 main_~__VERIFIER_assert__cond~4)} assume 0 == ~__VERIFIER_assert__cond~4; {6810#false} is VALID
[2022-04-08 03:51:05,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {6810#false} assume !false; {6810#false} is VALID
[2022-04-08 03:51:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-08 03:51:05,946 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 03:51:06,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {6810#false} assume !false; {6810#false} is VALID
[2022-04-08 03:51:06,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {6905#(<= 1 main_~__VERIFIER_assert__cond~4)} assume 0 == ~__VERIFIER_assert__cond~4; {6810#false} is VALID
[2022-04-08 03:51:06,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6905#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID
[2022-04-08 03:51:06,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:06,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:06,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:06,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:06,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:06,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:06,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:06,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:06,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:06,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:06,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:06,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {6809#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:06,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {6809#true} assume !(0 == ~main__scheme~0); {6809#true} is VALID
[2022-04-08 03:51:06,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {6809#true} assume ~main__scheme~0 >= 0; {6809#true} is VALID
[2022-04-08 03:51:06,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {6809#true} assume ~main__tokenlen~0 > 0; {6809#true} is VALID
[2022-04-08 03:51:06,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {6809#true} assume ~main__urilen~0 > 0; {6809#true} is VALID
[2022-04-08 03:51:06,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {6809#true} assume !!(~main__scheme~0 >= -1000000); {6809#true} is VALID
[2022-04-08 03:51:06,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {6809#true} assume !!(~main__scheme~0 <= 1000000); {6809#true} is VALID
[2022-04-08 03:51:06,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {6809#true} assume !!(~main__tokenlen~0 >= -1000000); {6809#true} is VALID
[2022-04-08 03:51:06,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {6809#true} assume !!(~main__tokenlen~0 <= 1000000); {6809#true} is VALID
[2022-04-08 03:51:06,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {6809#true} assume !!(~main__urilen~0 >= -1000000); {6809#true} is VALID
[2022-04-08 03:51:06,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {6809#true} assume !!(~main__urilen~0 <= 1000000); {6809#true} is VALID
[2022-04-08 03:51:06,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {6809#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {6809#true} is VALID
[2022-04-08 03:51:06,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {6809#true} call #t~ret11 := main(); {6809#true} is VALID
[2022-04-08 03:51:06,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6809#true} {6809#true} #225#return; {6809#true} is VALID
[2022-04-08 03:51:06,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {6809#true} assume true; {6809#true} is VALID
[2022-04-08 03:51:06,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {6809#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6809#true} is VALID
[2022-04-08 03:51:06,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {6809#true} call ULTIMATE.init(); {6809#true} is VALID
[2022-04-08 03:51:06,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-08 03:51:06,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90456133] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 03:51:06,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 03:51:06,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7
[2022-04-08 03:51:06,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:06,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2098445105]
[2022-04-08 03:51:06,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2098445105] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:06,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:06,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139599983]
[2022-04-08 03:51:06,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:06,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 03:51:06,134 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:06,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:06,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:06,154 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:51:06,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:06,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:51:06,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2022-04-08 03:51:06,155 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:06,576 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions.
[2022-04-08 03:51:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-08 03:51:06,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 03:51:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions.
[2022-04-08 03:51:06,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:06,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions.
[2022-04-08 03:51:06,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions.
[2022-04-08 03:51:06,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:06,645 INFO L225 Difference]: With dead ends: 69
[2022-04-08 03:51:06,645 INFO L226 Difference]: Without dead ends: 67
[2022-04-08 03:51:06,645 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110
[2022-04-08 03:51:06,646 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 130 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:06,646 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 61 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:51:06,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2022-04-08 03:51:06,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62.
[2022-04-08 03:51:06,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:06,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:06,843 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:06,843 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:06,844 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions.
[2022-04-08 03:51:06,844 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions.
[2022-04-08 03:51:06,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:06,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:06,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states.
[2022-04-08 03:51:06,845 INFO L87 Difference]: Start difference. First operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states.
[2022-04-08 03:51:06,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:06,846 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions.
[2022-04-08 03:51:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions.
[2022-04-08 03:51:06,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:06,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:06,846 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:06,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions.
[2022-04-08 03:51:06,848 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31
[2022-04-08 03:51:06,848 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:06,848 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions.
[2022-04-08 03:51:06,848 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:06,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 64 transitions.
[2022-04-08 03:51:06,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:06,961 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions.
[2022-04-08 03:51:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2022-04-08 03:51:06,961 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:51:06,961 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:51:06,988 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-08 03:51:07,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2022-04-08 03:51:07,172 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:51:07,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:51:07,172 INFO L85 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 1 times
[2022-04-08 03:51:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:07,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [694543065]
[2022-04-08 03:51:07,173 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:51:07,173 INFO L85 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 2 times
[2022-04-08 03:51:07,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:51:07,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868871302]
[2022-04-08 03:51:07,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:51:07,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:51:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:07,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:07,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {7416#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7408#true} is VALID
[2022-04-08 03:51:07,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {7408#true} assume true; {7408#true} is VALID
[2022-04-08 03:51:07,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7408#true} {7408#true} #225#return; {7408#true} is VALID
[2022-04-08 03:51:07,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {7408#true} call ULTIMATE.init(); {7416#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:07,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {7416#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7408#true} is VALID
[2022-04-08 03:51:07,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {7408#true} assume true; {7408#true} is VALID
[2022-04-08 03:51:07,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7408#true} {7408#true} #225#return; {7408#true} is VALID
[2022-04-08 03:51:07,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {7408#true} call #t~ret11 := main(); {7408#true} is VALID
[2022-04-08 03:51:07,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {7408#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {7408#true} is VALID
[2022-04-08 03:51:07,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {7408#true} assume !!(~main__urilen~0 <= 1000000); {7408#true} is VALID
[2022-04-08 03:51:07,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {7408#true} assume !!(~main__urilen~0 >= -1000000); {7408#true} is VALID
[2022-04-08 03:51:07,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {7408#true} assume !!(~main__tokenlen~0 <= 1000000); {7408#true} is VALID
[2022-04-08 03:51:07,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {7408#true} assume !!(~main__tokenlen~0 >= -1000000); {7408#true} is VALID
[2022-04-08 03:51:07,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {7408#true} assume !!(~main__scheme~0 <= 1000000); {7408#true} is VALID
[2022-04-08 03:51:07,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {7408#true} assume !!(~main__scheme~0 >= -1000000); {7408#true} is VALID
[2022-04-08 03:51:07,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {7408#true} assume ~main__urilen~0 > 0; {7408#true} is VALID
[2022-04-08 03:51:07,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {7408#true} assume ~main__tokenlen~0 > 0; {7408#true} is VALID
[2022-04-08 03:51:07,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {7408#true} assume ~main__scheme~0 >= 0; {7408#true} is VALID
[2022-04-08 03:51:07,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {7408#true} assume !(0 == ~main__scheme~0); {7408#true} is VALID
[2022-04-08 03:51:07,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {7408#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:07,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:07,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:07,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:07,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:07,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:07,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:07,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:07,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:07,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:07,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:07,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:07,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:07,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:07,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:07,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7415#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID
[2022-04-08 03:51:07,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {7415#(not (= main_~__VERIFIER_assert__cond~8 0))} assume 0 == ~__VERIFIER_assert__cond~8; {7409#false} is VALID
[2022-04-08 03:51:07,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {7409#false} assume !false; {7409#false} is VALID
[2022-04-08 03:51:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:51:07,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:07,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868871302]
[2022-04-08 03:51:07,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868871302] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:07,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:07,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:07,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:07,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [694543065]
[2022-04-08 03:51:07,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [694543065] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:07,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:07,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:07,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824700936]
[2022-04-08 03:51:07,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:07,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34
[2022-04-08 03:51:07,265 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:07,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:07,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:07,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:51:07,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:07,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:51:07,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2022-04-08 03:51:07,289 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:07,641 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions.
[2022-04-08 03:51:07,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-08 03:51:07,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34
[2022-04-08 03:51:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions.
[2022-04-08 03:51:07,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions.
[2022-04-08 03:51:07,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions.
[2022-04-08 03:51:07,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:07,718 INFO L225 Difference]: With dead ends: 63
[2022-04-08 03:51:07,718 INFO L226 Difference]: Without dead ends: 61
[2022-04-08 03:51:07,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90
[2022-04-08 03:51:07,719 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 149 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:07,719 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 54 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:51:07,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2022-04-08 03:51:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60.
[2022-04-08 03:51:07,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:07,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:07,848 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:07,848 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:07,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:07,850 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions.
[2022-04-08 03:51:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions.
[2022-04-08 03:51:07,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:07,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:07,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states.
[2022-04-08 03:51:07,850 INFO L87 Difference]: Start difference. First operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states.
[2022-04-08 03:51:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:07,852 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions.
[2022-04-08 03:51:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions.
[2022-04-08 03:51:07,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:07,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:07,852 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:07,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:07,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions.
[2022-04-08 03:51:07,853 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34
[2022-04-08 03:51:07,853 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:07,853 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions.
[2022-04-08 03:51:07,854 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:07,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions.
[2022-04-08 03:51:07,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions.
[2022-04-08 03:51:07,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2022-04-08 03:51:07,952 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:51:07,952 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:51:07,952 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-04-08 03:51:07,953 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:51:07,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:51:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 1 times
[2022-04-08 03:51:07,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:07,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [519481824]
[2022-04-08 03:51:07,953 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:51:07,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 2 times
[2022-04-08 03:51:07,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:51:07,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881612618]
[2022-04-08 03:51:07,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:51:07,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:51:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:08,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:08,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {7804#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7795#true} is VALID
[2022-04-08 03:51:08,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {7795#true} assume true; {7795#true} is VALID
[2022-04-08 03:51:08,018 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7795#true} {7795#true} #225#return; {7795#true} is VALID
[2022-04-08 03:51:08,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {7795#true} call ULTIMATE.init(); {7804#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:08,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {7804#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7795#true} is VALID
[2022-04-08 03:51:08,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {7795#true} assume true; {7795#true} is VALID
[2022-04-08 03:51:08,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7795#true} {7795#true} #225#return; {7795#true} is VALID
[2022-04-08 03:51:08,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {7795#true} call #t~ret11 := main(); {7795#true} is VALID
[2022-04-08 03:51:08,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {7795#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {7795#true} is VALID
[2022-04-08 03:51:08,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {7795#true} assume !!(~main__urilen~0 <= 1000000); {7795#true} is VALID
[2022-04-08 03:51:08,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {7795#true} assume !!(~main__urilen~0 >= -1000000); {7795#true} is VALID
[2022-04-08 03:51:08,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {7795#true} assume !!(~main__tokenlen~0 <= 1000000); {7795#true} is VALID
[2022-04-08 03:51:08,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {7795#true} assume !!(~main__tokenlen~0 >= -1000000); {7795#true} is VALID
[2022-04-08 03:51:08,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {7795#true} assume !!(~main__scheme~0 <= 1000000); {7795#true} is VALID
[2022-04-08 03:51:08,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {7795#true} assume !!(~main__scheme~0 >= -1000000); {7795#true} is VALID
[2022-04-08 03:51:08,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {7795#true} assume ~main__urilen~0 > 0; {7795#true} is VALID
[2022-04-08 03:51:08,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {7795#true} assume ~main__tokenlen~0 > 0; {7795#true} is VALID
[2022-04-08 03:51:08,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {7795#true} assume ~main__scheme~0 >= 0; {7800#(<= 0 main_~main__scheme~0)} is VALID
[2022-04-08 03:51:08,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {7800#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {7800#(<= 0 main_~main__scheme~0)} is VALID
[2022-04-08 03:51:08,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {7800#(<= 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7801#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7801#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {7801#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7801#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7801#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7801#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {7801#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7801#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {7801#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7801#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7801#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7801#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7801#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7801#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7801#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {7802#(<= 1 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {7802#(<= 1 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7802#(<= 1 main_~main__cp~0)} is VALID
[2022-04-08 03:51:08,028 INFO L290 TraceCheckUtils]: 32: Hoare triple {7802#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7803#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID
[2022-04-08 03:51:08,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {7803#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {7796#false} is VALID
[2022-04-08 03:51:08,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {7796#false} assume !false; {7796#false} is VALID
[2022-04-08 03:51:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:51:08,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:08,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881612618]
[2022-04-08 03:51:08,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881612618] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:08,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:08,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-08 03:51:08,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:08,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [519481824]
[2022-04-08 03:51:08,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [519481824] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:08,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:08,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-08 03:51:08,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496965738]
[2022-04-08 03:51:08,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:08,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35
[2022-04-08 03:51:08,031 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:08,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:08,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:08,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-08 03:51:08,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:08,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-08 03:51:08,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-04-08 03:51:08,054 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:08,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:08,574 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions.
[2022-04-08 03:51:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-08 03:51:08,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35
[2022-04-08 03:51:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions.
[2022-04-08 03:51:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions.
[2022-04-08 03:51:08,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 74 transitions.
[2022-04-08 03:51:08,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:08,641 INFO L225 Difference]: With dead ends: 71
[2022-04-08 03:51:08,641 INFO L226 Difference]: Without dead ends: 69
[2022-04-08 03:51:08,642 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-04-08 03:51:08,642 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 177 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:08,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 57 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:51:08,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2022-04-08 03:51:08,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58.
[2022-04-08 03:51:08,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:08,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:08,779 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:08,779 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:08,782 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions.
[2022-04-08 03:51:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions.
[2022-04-08 03:51:08,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:08,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:08,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states.
[2022-04-08 03:51:08,783 INFO L87 Difference]: Start difference. First operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states.
[2022-04-08 03:51:08,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:08,784 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions.
[2022-04-08 03:51:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions.
[2022-04-08 03:51:08,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:08,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:08,785 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:08,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions.
[2022-04-08 03:51:08,786 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35
[2022-04-08 03:51:08,786 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:08,787 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions.
[2022-04-08 03:51:08,787 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:08,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 60 transitions.
[2022-04-08 03:51:08,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions.
[2022-04-08 03:51:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2022-04-08 03:51:08,896 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:51:08,896 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:51:08,896 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-04-08 03:51:08,896 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:51:08,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:51:08,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 1 times
[2022-04-08 03:51:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:08,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [713713481]
[2022-04-08 03:51:08,897 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:51:08,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 2 times
[2022-04-08 03:51:08,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:51:08,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795758477]
[2022-04-08 03:51:08,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:51:08,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:51:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:08,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:08,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {8219#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8211#true} is VALID
[2022-04-08 03:51:08,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {8211#true} assume true; {8211#true} is VALID
[2022-04-08 03:51:08,962 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8211#true} {8211#true} #225#return; {8211#true} is VALID
[2022-04-08 03:51:08,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {8211#true} call ULTIMATE.init(); {8219#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:08,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {8219#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8211#true} is VALID
[2022-04-08 03:51:08,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {8211#true} assume true; {8211#true} is VALID
[2022-04-08 03:51:08,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8211#true} {8211#true} #225#return; {8211#true} is VALID
[2022-04-08 03:51:08,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {8211#true} call #t~ret11 := main(); {8211#true} is VALID
[2022-04-08 03:51:08,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {8211#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {8211#true} is VALID
[2022-04-08 03:51:08,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {8211#true} assume !!(~main__urilen~0 <= 1000000); {8211#true} is VALID
[2022-04-08 03:51:08,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {8211#true} assume !!(~main__urilen~0 >= -1000000); {8211#true} is VALID
[2022-04-08 03:51:08,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {8211#true} assume !!(~main__tokenlen~0 <= 1000000); {8211#true} is VALID
[2022-04-08 03:51:08,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {8211#true} assume !!(~main__tokenlen~0 >= -1000000); {8211#true} is VALID
[2022-04-08 03:51:08,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {8211#true} assume !!(~main__scheme~0 <= 1000000); {8211#true} is VALID
[2022-04-08 03:51:08,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {8211#true} assume !!(~main__scheme~0 >= -1000000); {8211#true} is VALID
[2022-04-08 03:51:08,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {8211#true} assume ~main__urilen~0 > 0; {8211#true} is VALID
[2022-04-08 03:51:08,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {8211#true} assume ~main__tokenlen~0 > 0; {8211#true} is VALID
[2022-04-08 03:51:08,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {8211#true} assume ~main__scheme~0 >= 0; {8211#true} is VALID
[2022-04-08 03:51:08,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {8211#true} assume !(0 == ~main__scheme~0); {8211#true} is VALID
[2022-04-08 03:51:08,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {8211#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8211#true} is VALID
[2022-04-08 03:51:08,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8211#true} is VALID
[2022-04-08 03:51:08,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {8211#true} is VALID
[2022-04-08 03:51:08,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {8211#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8211#true} is VALID
[2022-04-08 03:51:08,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8211#true} is VALID
[2022-04-08 03:51:08,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~3); {8211#true} is VALID
[2022-04-08 03:51:08,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {8211#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {8211#true} is VALID
[2022-04-08 03:51:08,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {8211#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {8211#true} is VALID
[2022-04-08 03:51:08,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {8211#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {8211#true} is VALID
[2022-04-08 03:51:08,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {8211#true} is VALID
[2022-04-08 03:51:08,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~5); {8211#true} is VALID
[2022-04-08 03:51:08,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {8211#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {8211#true} is VALID
[2022-04-08 03:51:08,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {8211#true} is VALID
[2022-04-08 03:51:08,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~7); {8211#true} is VALID
[2022-04-08 03:51:08,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {8211#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {8211#true} is VALID
[2022-04-08 03:51:08,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {8211#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {8216#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID
[2022-04-08 03:51:08,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {8216#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:51:08,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~9); {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:51:08,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__cp~0 != ~main__urilen~0 - 1; {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:51:08,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8218#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID
[2022-04-08 03:51:08,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {8218#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {8212#false} is VALID
[2022-04-08 03:51:08,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {8212#false} assume !false; {8212#false} is VALID
[2022-04-08 03:51:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:51:08,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:08,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795758477]
[2022-04-08 03:51:08,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795758477] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:08,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:08,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:08,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:08,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [713713481]
[2022-04-08 03:51:08,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [713713481] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:08,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:08,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:08,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142406627]
[2022-04-08 03:51:08,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:08,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38
[2022-04-08 03:51:08,978 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:08,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:09,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:09,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:51:09,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:09,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:51:09,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-08 03:51:09,004 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:09,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:09,711 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions.
[2022-04-08 03:51:09,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-08 03:51:09,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38
[2022-04-08 03:51:09,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions.
[2022-04-08 03:51:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions.
[2022-04-08 03:51:09,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 95 transitions.
[2022-04-08 03:51:09,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:09,806 INFO L225 Difference]: With dead ends: 91
[2022-04-08 03:51:09,806 INFO L226 Difference]: Without dead ends: 89
[2022-04-08 03:51:09,806 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110
[2022-04-08 03:51:09,807 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 178 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:09,807 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 60 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:51:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states.
[2022-04-08 03:51:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61.
[2022-04-08 03:51:09,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:09,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:09,986 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:09,986 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:09,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:09,987 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions.
[2022-04-08 03:51:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions.
[2022-04-08 03:51:09,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:09,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:09,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states.
[2022-04-08 03:51:09,988 INFO L87 Difference]: Start difference. First operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states.
[2022-04-08 03:51:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:09,990 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions.
[2022-04-08 03:51:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions.
[2022-04-08 03:51:09,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:09,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:09,990 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:09,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions.
[2022-04-08 03:51:09,992 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38
[2022-04-08 03:51:09,992 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:09,992 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions.
[2022-04-08 03:51:09,992 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:09,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 63 transitions.
[2022-04-08 03:51:10,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions.
[2022-04-08 03:51:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2022-04-08 03:51:10,104 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:51:10,104 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:51:10,105 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2022-04-08 03:51:10,105 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:51:10,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:51:10,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 1 times
[2022-04-08 03:51:10,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:10,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [553918213]
[2022-04-08 03:51:10,105 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:51:10,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 2 times
[2022-04-08 03:51:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:51:10,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318708540]
[2022-04-08 03:51:10,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:51:10,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:51:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:10,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:10,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {8723#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8715#true} is VALID
[2022-04-08 03:51:10,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {8715#true} assume true; {8715#true} is VALID
[2022-04-08 03:51:10,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8715#true} {8715#true} #225#return; {8715#true} is VALID
[2022-04-08 03:51:10,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {8715#true} call ULTIMATE.init(); {8723#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:10,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {8723#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8715#true} is VALID
[2022-04-08 03:51:10,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {8715#true} assume true; {8715#true} is VALID
[2022-04-08 03:51:10,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8715#true} {8715#true} #225#return; {8715#true} is VALID
[2022-04-08 03:51:10,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {8715#true} call #t~ret11 := main(); {8715#true} is VALID
[2022-04-08 03:51:10,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {8715#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {8715#true} is VALID
[2022-04-08 03:51:10,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {8715#true} assume !!(~main__urilen~0 <= 1000000); {8715#true} is VALID
[2022-04-08 03:51:10,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {8715#true} assume !!(~main__urilen~0 >= -1000000); {8715#true} is VALID
[2022-04-08 03:51:10,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {8715#true} assume !!(~main__tokenlen~0 <= 1000000); {8715#true} is VALID
[2022-04-08 03:51:10,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {8715#true} assume !!(~main__tokenlen~0 >= -1000000); {8715#true} is VALID
[2022-04-08 03:51:10,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {8715#true} assume !!(~main__scheme~0 <= 1000000); {8715#true} is VALID
[2022-04-08 03:51:10,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {8715#true} assume !!(~main__scheme~0 >= -1000000); {8715#true} is VALID
[2022-04-08 03:51:10,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {8715#true} assume ~main__urilen~0 > 0; {8715#true} is VALID
[2022-04-08 03:51:10,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {8715#true} assume ~main__tokenlen~0 > 0; {8715#true} is VALID
[2022-04-08 03:51:10,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {8715#true} assume ~main__scheme~0 >= 0; {8715#true} is VALID
[2022-04-08 03:51:10,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {8715#true} assume !(0 == ~main__scheme~0); {8715#true} is VALID
[2022-04-08 03:51:10,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {8715#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8715#true} is VALID
[2022-04-08 03:51:10,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8715#true} is VALID
[2022-04-08 03:51:10,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {8715#true} is VALID
[2022-04-08 03:51:10,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {8715#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8715#true} is VALID
[2022-04-08 03:51:10,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8715#true} is VALID
[2022-04-08 03:51:10,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~3); {8715#true} is VALID
[2022-04-08 03:51:10,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {8715#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {8715#true} is VALID
[2022-04-08 03:51:10,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {8715#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {8715#true} is VALID
[2022-04-08 03:51:10,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {8715#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {8715#true} is VALID
[2022-04-08 03:51:10,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {8715#true} is VALID
[2022-04-08 03:51:10,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~5); {8715#true} is VALID
[2022-04-08 03:51:10,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {8715#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {8715#true} is VALID
[2022-04-08 03:51:10,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {8715#true} is VALID
[2022-04-08 03:51:10,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~7); {8715#true} is VALID
[2022-04-08 03:51:10,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {8715#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {8715#true} is VALID
[2022-04-08 03:51:10,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {8715#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {8715#true} is VALID
[2022-04-08 03:51:10,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {8720#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} is VALID
[2022-04-08 03:51:10,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {8720#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~9); {8721#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:10,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {8721#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {8721#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:10,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {8721#(<= 0 main_~main__cp~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8721#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:10,180 INFO L290 TraceCheckUtils]: 36: Hoare triple {8721#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8722#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID
[2022-04-08 03:51:10,181 INFO L290 TraceCheckUtils]: 37: Hoare triple {8722#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {8716#false} is VALID
[2022-04-08 03:51:10,181 INFO L290 TraceCheckUtils]: 38: Hoare triple {8716#false} assume !false; {8716#false} is VALID
[2022-04-08 03:51:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:51:10,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:10,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318708540]
[2022-04-08 03:51:10,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318708540] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:10,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:10,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:10,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:10,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [553918213]
[2022-04-08 03:51:10,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [553918213] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:10,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:10,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:10,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896586471]
[2022-04-08 03:51:10,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:10,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39
[2022-04-08 03:51:10,183 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:10,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:10,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:10,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:51:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:10,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:51:10,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-08 03:51:10,208 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:10,612 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions.
[2022-04-08 03:51:10,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-08 03:51:10,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39
[2022-04-08 03:51:10,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions.
[2022-04-08 03:51:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions.
[2022-04-08 03:51:10,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 63 transitions.
[2022-04-08 03:51:10,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:10,663 INFO L225 Difference]: With dead ends: 61
[2022-04-08 03:51:10,663 INFO L226 Difference]: Without dead ends: 59
[2022-04-08 03:51:10,664 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2022-04-08 03:51:10,664 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 110 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:10,664 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 67 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:51:10,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2022-04-08 03:51:10,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59.
[2022-04-08 03:51:10,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:10,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:10,810 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:10,810 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:10,811 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions.
[2022-04-08 03:51:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions.
[2022-04-08 03:51:10,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:10,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:10,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states.
[2022-04-08 03:51:10,812 INFO L87 Difference]: Start difference. First operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states.
[2022-04-08 03:51:10,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:10,813 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions.
[2022-04-08 03:51:10,813 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions.
[2022-04-08 03:51:10,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:10,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:10,813 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:10,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions.
[2022-04-08 03:51:10,814 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39
[2022-04-08 03:51:10,815 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:10,815 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions.
[2022-04-08 03:51:10,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:10,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 61 transitions.
[2022-04-08 03:51:10,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions.
[2022-04-08 03:51:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2022-04-08 03:51:10,927 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:51:10,927 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:51:10,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-04-08 03:51:10,928 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:51:10,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:51:10,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 1 times
[2022-04-08 03:51:10,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:10,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [763703654]
[2022-04-08 03:51:10,928 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:51:10,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 2 times
[2022-04-08 03:51:10,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:51:10,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375694962]
[2022-04-08 03:51:10,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:51:10,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:51:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:10,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:10,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {9097#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9090#true} is VALID
[2022-04-08 03:51:10,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {9090#true} assume true; {9090#true} is VALID
[2022-04-08 03:51:10,985 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9090#true} {9090#true} #225#return; {9090#true} is VALID
[2022-04-08 03:51:10,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {9090#true} call ULTIMATE.init(); {9097#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:10,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {9097#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9090#true} is VALID
[2022-04-08 03:51:10,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {9090#true} assume true; {9090#true} is VALID
[2022-04-08 03:51:10,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9090#true} {9090#true} #225#return; {9090#true} is VALID
[2022-04-08 03:51:10,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {9090#true} call #t~ret11 := main(); {9090#true} is VALID
[2022-04-08 03:51:10,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {9090#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {9090#true} is VALID
[2022-04-08 03:51:10,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {9090#true} assume !!(~main__urilen~0 <= 1000000); {9090#true} is VALID
[2022-04-08 03:51:10,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {9090#true} assume !!(~main__urilen~0 >= -1000000); {9090#true} is VALID
[2022-04-08 03:51:10,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {9090#true} assume !!(~main__tokenlen~0 <= 1000000); {9090#true} is VALID
[2022-04-08 03:51:10,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {9090#true} assume !!(~main__tokenlen~0 >= -1000000); {9090#true} is VALID
[2022-04-08 03:51:10,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {9090#true} assume !!(~main__scheme~0 <= 1000000); {9090#true} is VALID
[2022-04-08 03:51:10,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {9090#true} assume !!(~main__scheme~0 >= -1000000); {9090#true} is VALID
[2022-04-08 03:51:10,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {9090#true} assume ~main__urilen~0 > 0; {9090#true} is VALID
[2022-04-08 03:51:10,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {9090#true} assume ~main__tokenlen~0 > 0; {9090#true} is VALID
[2022-04-08 03:51:10,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {9090#true} assume ~main__scheme~0 >= 0; {9090#true} is VALID
[2022-04-08 03:51:10,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {9090#true} assume !(0 == ~main__scheme~0); {9090#true} is VALID
[2022-04-08 03:51:10,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {9090#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9090#true} is VALID
[2022-04-08 03:51:10,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9090#true} is VALID
[2022-04-08 03:51:10,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {9090#true} is VALID
[2022-04-08 03:51:10,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {9090#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {9090#true} is VALID
[2022-04-08 03:51:10,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {9090#true} is VALID
[2022-04-08 03:51:10,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~3); {9090#true} is VALID
[2022-04-08 03:51:10,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {9090#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {9090#true} is VALID
[2022-04-08 03:51:10,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {9090#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {9090#true} is VALID
[2022-04-08 03:51:10,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {9090#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9090#true} is VALID
[2022-04-08 03:51:10,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9090#true} is VALID
[2022-04-08 03:51:10,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~5); {9090#true} is VALID
[2022-04-08 03:51:10,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {9090#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {9090#true} is VALID
[2022-04-08 03:51:10,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {9090#true} is VALID
[2022-04-08 03:51:10,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~7); {9090#true} is VALID
[2022-04-08 03:51:10,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {9090#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {9090#true} is VALID
[2022-04-08 03:51:10,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {9090#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {9090#true} is VALID
[2022-04-08 03:51:10,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {9090#true} is VALID
[2022-04-08 03:51:10,989 INFO L290 TraceCheckUtils]: 33: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~9); {9090#true} is VALID
[2022-04-08 03:51:10,989 INFO L290 TraceCheckUtils]: 34: Hoare triple {9090#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {9090#true} is VALID
[2022-04-08 03:51:10,990 INFO L290 TraceCheckUtils]: 35: Hoare triple {9090#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID
[2022-04-08 03:51:10,990 INFO L290 TraceCheckUtils]: 36: Hoare triple {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID
[2022-04-08 03:51:10,990 INFO L290 TraceCheckUtils]: 37: Hoare triple {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID
[2022-04-08 03:51:10,991 INFO L290 TraceCheckUtils]: 38: Hoare triple {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9096#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID
[2022-04-08 03:51:10,991 INFO L290 TraceCheckUtils]: 39: Hoare triple {9096#(not (= main_~__VERIFIER_assert__cond~12 0))} assume 0 == ~__VERIFIER_assert__cond~12; {9091#false} is VALID
[2022-04-08 03:51:10,992 INFO L290 TraceCheckUtils]: 40: Hoare triple {9091#false} assume !false; {9091#false} is VALID
[2022-04-08 03:51:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:51:10,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:10,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375694962]
[2022-04-08 03:51:10,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375694962] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:10,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:10,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 03:51:10,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:10,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [763703654]
[2022-04-08 03:51:10,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [763703654] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:10,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:10,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 03:51:10,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735355262]
[2022-04-08 03:51:10,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:10,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41
[2022-04-08 03:51:10,994 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:10,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:11,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:11,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 03:51:11,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:11,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 03:51:11,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-08 03:51:11,020 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:11,449 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions.
[2022-04-08 03:51:11,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-08 03:51:11,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41
[2022-04-08 03:51:11,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions.
[2022-04-08 03:51:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions.
[2022-04-08 03:51:11,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions.
[2022-04-08 03:51:11,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:11,515 INFO L225 Difference]: With dead ends: 70
[2022-04-08 03:51:11,515 INFO L226 Difference]: Without dead ends: 68
[2022-04-08 03:51:11,515 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2022-04-08 03:51:11,516 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:11,517 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 77 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:51:11,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2022-04-08 03:51:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57.
[2022-04-08 03:51:11,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:11,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:11,665 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:11,665 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:11,666 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions.
[2022-04-08 03:51:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions.
[2022-04-08 03:51:11,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:11,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:11,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states.
[2022-04-08 03:51:11,667 INFO L87 Difference]: Start difference. First operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states.
[2022-04-08 03:51:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:11,668 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions.
[2022-04-08 03:51:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions.
[2022-04-08 03:51:11,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:11,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:11,668 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:11,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions.
[2022-04-08 03:51:11,670 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41
[2022-04-08 03:51:11,670 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:11,670 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions.
[2022-04-08 03:51:11,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:11,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 59 transitions.
[2022-04-08 03:51:11,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:11,794 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions.
[2022-04-08 03:51:11,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2022-04-08 03:51:11,794 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:51:11,794 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:51:11,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2022-04-08 03:51:11,795 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:51:11,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:51:11,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 1 times
[2022-04-08 03:51:11,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:11,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [639966464]
[2022-04-08 03:51:11,795 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:51:11,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 2 times
[2022-04-08 03:51:11,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:51:11,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975768062]
[2022-04-08 03:51:11,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:51:11,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:51:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:11,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:11,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {9507#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9499#true} is VALID
[2022-04-08 03:51:11,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {9499#true} assume true; {9499#true} is VALID
[2022-04-08 03:51:11,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9499#true} {9499#true} #225#return; {9499#true} is VALID
[2022-04-08 03:51:11,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {9499#true} call ULTIMATE.init(); {9507#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:11,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {9507#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9499#true} is VALID
[2022-04-08 03:51:11,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {9499#true} assume true; {9499#true} is VALID
[2022-04-08 03:51:11,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9499#true} {9499#true} #225#return; {9499#true} is VALID
[2022-04-08 03:51:11,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {9499#true} call #t~ret11 := main(); {9499#true} is VALID
[2022-04-08 03:51:11,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {9499#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {9499#true} is VALID
[2022-04-08 03:51:11,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {9499#true} assume !!(~main__urilen~0 <= 1000000); {9499#true} is VALID
[2022-04-08 03:51:11,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {9499#true} assume !!(~main__urilen~0 >= -1000000); {9499#true} is VALID
[2022-04-08 03:51:11,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {9499#true} assume !!(~main__tokenlen~0 <= 1000000); {9499#true} is VALID
[2022-04-08 03:51:11,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {9499#true} assume !!(~main__tokenlen~0 >= -1000000); {9499#true} is VALID
[2022-04-08 03:51:11,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {9499#true} assume !!(~main__scheme~0 <= 1000000); {9499#true} is VALID
[2022-04-08 03:51:11,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {9499#true} assume !!(~main__scheme~0 >= -1000000); {9499#true} is VALID
[2022-04-08 03:51:11,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {9499#true} assume ~main__urilen~0 > 0; {9499#true} is VALID
[2022-04-08 03:51:11,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {9499#true} assume ~main__tokenlen~0 > 0; {9499#true} is VALID
[2022-04-08 03:51:11,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {9499#true} assume ~main__scheme~0 >= 0; {9499#true} is VALID
[2022-04-08 03:51:11,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {9499#true} assume !(0 == ~main__scheme~0); {9499#true} is VALID
[2022-04-08 03:51:11,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {9499#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9499#true} is VALID
[2022-04-08 03:51:11,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9499#true} is VALID
[2022-04-08 03:51:11,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {9499#true} is VALID
[2022-04-08 03:51:11,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {9499#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {9499#true} is VALID
[2022-04-08 03:51:11,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {9499#true} is VALID
[2022-04-08 03:51:11,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~3); {9499#true} is VALID
[2022-04-08 03:51:11,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {9499#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {9499#true} is VALID
[2022-04-08 03:51:11,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {9499#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {9499#true} is VALID
[2022-04-08 03:51:11,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {9499#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9499#true} is VALID
[2022-04-08 03:51:11,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9499#true} is VALID
[2022-04-08 03:51:11,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~5); {9499#true} is VALID
[2022-04-08 03:51:11,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {9499#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {9499#true} is VALID
[2022-04-08 03:51:11,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {9499#true} is VALID
[2022-04-08 03:51:11,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~7); {9499#true} is VALID
[2022-04-08 03:51:11,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {9499#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {9499#true} is VALID
[2022-04-08 03:51:11,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {9499#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {9504#(= main_~main__c~0 0)} is VALID
[2022-04-08 03:51:11,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {9504#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {9504#(= main_~main__c~0 0)} is VALID
[2022-04-08 03:51:11,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {9504#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~9); {9504#(= main_~main__c~0 0)} is VALID
[2022-04-08 03:51:11,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {9504#(= main_~main__c~0 0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {9504#(= main_~main__c~0 0)} is VALID
[2022-04-08 03:51:11,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {9504#(= main_~main__c~0 0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {9504#(= main_~main__c~0 0)} is VALID
[2022-04-08 03:51:11,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {9504#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {9504#(= main_~main__c~0 0)} is VALID
[2022-04-08 03:51:11,886 INFO L290 TraceCheckUtils]: 37: Hoare triple {9504#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {9504#(= main_~main__c~0 0)} is VALID
[2022-04-08 03:51:11,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {9504#(= main_~main__c~0 0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9505#(<= 1 main_~main__c~0)} is VALID
[2022-04-08 03:51:11,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {9505#(<= 1 main_~main__c~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9506#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID
[2022-04-08 03:51:11,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {9506#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {9500#false} is VALID
[2022-04-08 03:51:11,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {9500#false} assume !false; {9500#false} is VALID
[2022-04-08 03:51:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:51:11,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:11,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975768062]
[2022-04-08 03:51:11,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975768062] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:11,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:11,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:11,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:11,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [639966464]
[2022-04-08 03:51:11,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [639966464] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:11,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:11,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:11,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390941341]
[2022-04-08 03:51:11,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:11,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42
[2022-04-08 03:51:11,890 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:11,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:11,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:11,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:51:11,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:11,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:51:11,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-08 03:51:11,918 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:12,383 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions.
[2022-04-08 03:51:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-08 03:51:12,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42
[2022-04-08 03:51:12,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions.
[2022-04-08 03:51:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions.
[2022-04-08 03:51:12,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 66 transitions.
[2022-04-08 03:51:12,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:12,442 INFO L225 Difference]: With dead ends: 66
[2022-04-08 03:51:12,442 INFO L226 Difference]: Without dead ends: 64
[2022-04-08 03:51:12,442 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2022-04-08 03:51:12,443 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 91 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:12,443 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 74 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:51:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2022-04-08 03:51:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55.
[2022-04-08 03:51:12,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:12,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:12,593 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:12,593 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:12,594 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions.
[2022-04-08 03:51:12,595 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions.
[2022-04-08 03:51:12,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:12,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:12,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states.
[2022-04-08 03:51:12,596 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states.
[2022-04-08 03:51:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:12,597 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions.
[2022-04-08 03:51:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions.
[2022-04-08 03:51:12,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:12,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:12,597 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:12,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:12,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions.
[2022-04-08 03:51:12,598 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42
[2022-04-08 03:51:12,598 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:12,598 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions.
[2022-04-08 03:51:12,599 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:12,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions.
[2022-04-08 03:51:12,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions.
[2022-04-08 03:51:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2022-04-08 03:51:12,695 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:51:12,696 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:51:12,696 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2022-04-08 03:51:12,697 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:51:12,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:51:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 1 times
[2022-04-08 03:51:12,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:12,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1808637018]
[2022-04-08 03:51:12,698 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:51:12,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 2 times
[2022-04-08 03:51:12,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:51:12,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737084431]
[2022-04-08 03:51:12,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:51:12,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:51:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:12,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:12,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {9894#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9886#true} is VALID
[2022-04-08 03:51:12,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {9886#true} assume true; {9886#true} is VALID
[2022-04-08 03:51:12,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9886#true} {9886#true} #225#return; {9886#true} is VALID
[2022-04-08 03:51:12,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {9886#true} call ULTIMATE.init(); {9894#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:12,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {9894#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9886#true} is VALID
[2022-04-08 03:51:12,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {9886#true} assume true; {9886#true} is VALID
[2022-04-08 03:51:12,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9886#true} {9886#true} #225#return; {9886#true} is VALID
[2022-04-08 03:51:12,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {9886#true} call #t~ret11 := main(); {9886#true} is VALID
[2022-04-08 03:51:12,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {9886#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {9886#true} is VALID
[2022-04-08 03:51:12,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {9886#true} assume !!(~main__urilen~0 <= 1000000); {9886#true} is VALID
[2022-04-08 03:51:12,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {9886#true} assume !!(~main__urilen~0 >= -1000000); {9886#true} is VALID
[2022-04-08 03:51:12,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {9886#true} assume !!(~main__tokenlen~0 <= 1000000); {9886#true} is VALID
[2022-04-08 03:51:12,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {9886#true} assume !!(~main__tokenlen~0 >= -1000000); {9886#true} is VALID
[2022-04-08 03:51:12,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {9886#true} assume !!(~main__scheme~0 <= 1000000); {9886#true} is VALID
[2022-04-08 03:51:12,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {9886#true} assume !!(~main__scheme~0 >= -1000000); {9886#true} is VALID
[2022-04-08 03:51:12,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {9886#true} assume ~main__urilen~0 > 0; {9886#true} is VALID
[2022-04-08 03:51:12,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {9886#true} assume ~main__tokenlen~0 > 0; {9886#true} is VALID
[2022-04-08 03:51:12,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {9886#true} assume ~main__scheme~0 >= 0; {9886#true} is VALID
[2022-04-08 03:51:12,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {9886#true} assume !(0 == ~main__scheme~0); {9886#true} is VALID
[2022-04-08 03:51:12,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {9886#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9886#true} is VALID
[2022-04-08 03:51:12,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9886#true} is VALID
[2022-04-08 03:51:12,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {9886#true} is VALID
[2022-04-08 03:51:12,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {9886#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {9886#true} is VALID
[2022-04-08 03:51:12,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {9886#true} is VALID
[2022-04-08 03:51:12,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~3); {9886#true} is VALID
[2022-04-08 03:51:12,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {9886#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {9886#true} is VALID
[2022-04-08 03:51:12,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {9886#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {9886#true} is VALID
[2022-04-08 03:51:12,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {9886#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9886#true} is VALID
[2022-04-08 03:51:12,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9886#true} is VALID
[2022-04-08 03:51:12,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~5); {9886#true} is VALID
[2022-04-08 03:51:12,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {9886#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {9886#true} is VALID
[2022-04-08 03:51:12,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {9886#true} is VALID
[2022-04-08 03:51:12,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~7); {9886#true} is VALID
[2022-04-08 03:51:12,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {9886#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {9886#true} is VALID
[2022-04-08 03:51:12,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {9886#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {9891#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID
[2022-04-08 03:51:12,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {9891#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:51:12,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~9); {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:51:12,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__cp~0 != ~main__urilen~0 - 1; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:51:12,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:51:12,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:51:12,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:51:12,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:51:12,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:51:12,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {9893#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID
[2022-04-08 03:51:12,780 INFO L290 TraceCheckUtils]: 41: Hoare triple {9893#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {9887#false} is VALID
[2022-04-08 03:51:12,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {9887#false} assume !false; {9887#false} is VALID
[2022-04-08 03:51:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:51:12,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:12,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737084431]
[2022-04-08 03:51:12,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737084431] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:12,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:12,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:12,781 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:12,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1808637018]
[2022-04-08 03:51:12,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1808637018] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:12,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:12,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:12,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695299797]
[2022-04-08 03:51:12,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:12,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43
[2022-04-08 03:51:12,782 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:12,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:12,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:12,811 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:51:12,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:12,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:51:12,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-08 03:51:12,812 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:13,515 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions.
[2022-04-08 03:51:13,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-08 03:51:13,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43
[2022-04-08 03:51:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions.
[2022-04-08 03:51:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions.
[2022-04-08 03:51:13,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 93 transitions.
[2022-04-08 03:51:13,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:13,603 INFO L225 Difference]: With dead ends: 88
[2022-04-08 03:51:13,603 INFO L226 Difference]: Without dead ends: 86
[2022-04-08 03:51:13,604 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110
[2022-04-08 03:51:13,604 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 123 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:13,605 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 62 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 03:51:13,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2022-04-08 03:51:13,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60.
[2022-04-08 03:51:13,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:13,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:13,770 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:13,771 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:13,772 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions.
[2022-04-08 03:51:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions.
[2022-04-08 03:51:13,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:13,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:13,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states.
[2022-04-08 03:51:13,773 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states.
[2022-04-08 03:51:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:13,774 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions.
[2022-04-08 03:51:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions.
[2022-04-08 03:51:13,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:13,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:13,774 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:13,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions.
[2022-04-08 03:51:13,776 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43
[2022-04-08 03:51:13,776 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:13,776 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions.
[2022-04-08 03:51:13,776 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:13,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 63 transitions.
[2022-04-08 03:51:13,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions.
[2022-04-08 03:51:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2022-04-08 03:51:13,919 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:51:13,919 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:51:13,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2022-04-08 03:51:13,920 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:51:13,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:51:13,920 INFO L85 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 1 times
[2022-04-08 03:51:13,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:13,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2089229971]
[2022-04-08 03:51:13,921 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:51:13,921 INFO L85 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 2 times
[2022-04-08 03:51:13,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:51:13,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072013945]
[2022-04-08 03:51:13,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:51:13,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:51:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:13,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:14,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {10384#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {10376#true} is VALID
[2022-04-08 03:51:14,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {10376#true} assume true; {10376#true} is VALID
[2022-04-08 03:51:14,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10376#true} {10376#true} #225#return; {10376#true} is VALID
[2022-04-08 03:51:14,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {10376#true} call ULTIMATE.init(); {10384#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:14,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {10384#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {10376#true} is VALID
[2022-04-08 03:51:14,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {10376#true} assume true; {10376#true} is VALID
[2022-04-08 03:51:14,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10376#true} {10376#true} #225#return; {10376#true} is VALID
[2022-04-08 03:51:14,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {10376#true} call #t~ret11 := main(); {10376#true} is VALID
[2022-04-08 03:51:14,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {10376#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {10376#true} is VALID
[2022-04-08 03:51:14,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {10376#true} assume !!(~main__urilen~0 <= 1000000); {10376#true} is VALID
[2022-04-08 03:51:14,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {10376#true} assume !!(~main__urilen~0 >= -1000000); {10376#true} is VALID
[2022-04-08 03:51:14,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {10376#true} assume !!(~main__tokenlen~0 <= 1000000); {10376#true} is VALID
[2022-04-08 03:51:14,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {10376#true} assume !!(~main__tokenlen~0 >= -1000000); {10376#true} is VALID
[2022-04-08 03:51:14,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {10376#true} assume !!(~main__scheme~0 <= 1000000); {10376#true} is VALID
[2022-04-08 03:51:14,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {10376#true} assume !!(~main__scheme~0 >= -1000000); {10376#true} is VALID
[2022-04-08 03:51:14,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {10376#true} assume ~main__urilen~0 > 0; {10376#true} is VALID
[2022-04-08 03:51:14,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {10376#true} assume ~main__tokenlen~0 > 0; {10376#true} is VALID
[2022-04-08 03:51:14,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {10376#true} assume ~main__scheme~0 >= 0; {10376#true} is VALID
[2022-04-08 03:51:14,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {10376#true} assume !(0 == ~main__scheme~0); {10376#true} is VALID
[2022-04-08 03:51:14,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {10376#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,013 INFO L290 TraceCheckUtils]: 39: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,013 INFO L290 TraceCheckUtils]: 40: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10383#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID
[2022-04-08 03:51:14,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {10383#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {10377#false} is VALID
[2022-04-08 03:51:14,014 INFO L290 TraceCheckUtils]: 43: Hoare triple {10377#false} assume !false; {10377#false} is VALID
[2022-04-08 03:51:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:51:14,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:14,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072013945]
[2022-04-08 03:51:14,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072013945] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 03:51:14,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059457963]
[2022-04-08 03:51:14,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 03:51:14,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 03:51:14,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 03:51:14,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 03:51:14,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-04-08 03:51:14,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 03:51:14,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 03:51:14,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core
[2022-04-08 03:51:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:14,100 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 03:51:14,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {10376#true} call ULTIMATE.init(); {10376#true} is VALID
[2022-04-08 03:51:14,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {10376#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {10376#true} is VALID
[2022-04-08 03:51:14,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {10376#true} assume true; {10376#true} is VALID
[2022-04-08 03:51:14,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10376#true} {10376#true} #225#return; {10376#true} is VALID
[2022-04-08 03:51:14,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {10376#true} call #t~ret11 := main(); {10376#true} is VALID
[2022-04-08 03:51:14,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {10376#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {10376#true} is VALID
[2022-04-08 03:51:14,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {10376#true} assume !!(~main__urilen~0 <= 1000000); {10376#true} is VALID
[2022-04-08 03:51:14,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {10376#true} assume !!(~main__urilen~0 >= -1000000); {10376#true} is VALID
[2022-04-08 03:51:14,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {10376#true} assume !!(~main__tokenlen~0 <= 1000000); {10376#true} is VALID
[2022-04-08 03:51:14,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {10376#true} assume !!(~main__tokenlen~0 >= -1000000); {10376#true} is VALID
[2022-04-08 03:51:14,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {10376#true} assume !!(~main__scheme~0 <= 1000000); {10376#true} is VALID
[2022-04-08 03:51:14,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {10376#true} assume !!(~main__scheme~0 >= -1000000); {10376#true} is VALID
[2022-04-08 03:51:14,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {10376#true} assume ~main__urilen~0 > 0; {10376#true} is VALID
[2022-04-08 03:51:14,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {10376#true} assume ~main__tokenlen~0 > 0; {10376#true} is VALID
[2022-04-08 03:51:14,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {10376#true} assume ~main__scheme~0 >= 0; {10376#true} is VALID
[2022-04-08 03:51:14,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {10376#true} assume !(0 == ~main__scheme~0); {10376#true} is VALID
[2022-04-08 03:51:14,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {10376#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10511#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID
[2022-04-08 03:51:14,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {10511#(<= 1 main_~__VERIFIER_assert__cond~10)} assume 0 == ~__VERIFIER_assert__cond~10; {10377#false} is VALID
[2022-04-08 03:51:14,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {10377#false} assume !false; {10377#false} is VALID
[2022-04-08 03:51:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:51:14,392 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 03:51:14,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {10377#false} assume !false; {10377#false} is VALID
[2022-04-08 03:51:14,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {10511#(<= 1 main_~__VERIFIER_assert__cond~10)} assume 0 == ~__VERIFIER_assert__cond~10; {10377#false} is VALID
[2022-04-08 03:51:14,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10511#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID
[2022-04-08 03:51:14,636 INFO L290 TraceCheckUtils]: 40: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,638 INFO L290 TraceCheckUtils]: 36: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,638 INFO L290 TraceCheckUtils]: 34: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {10376#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID
[2022-04-08 03:51:14,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {10376#true} assume !(0 == ~main__scheme~0); {10376#true} is VALID
[2022-04-08 03:51:14,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {10376#true} assume ~main__scheme~0 >= 0; {10376#true} is VALID
[2022-04-08 03:51:14,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {10376#true} assume ~main__tokenlen~0 > 0; {10376#true} is VALID
[2022-04-08 03:51:14,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {10376#true} assume ~main__urilen~0 > 0; {10376#true} is VALID
[2022-04-08 03:51:14,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {10376#true} assume !!(~main__scheme~0 >= -1000000); {10376#true} is VALID
[2022-04-08 03:51:14,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {10376#true} assume !!(~main__scheme~0 <= 1000000); {10376#true} is VALID
[2022-04-08 03:51:14,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {10376#true} assume !!(~main__tokenlen~0 >= -1000000); {10376#true} is VALID
[2022-04-08 03:51:14,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {10376#true} assume !!(~main__tokenlen~0 <= 1000000); {10376#true} is VALID
[2022-04-08 03:51:14,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {10376#true} assume !!(~main__urilen~0 >= -1000000); {10376#true} is VALID
[2022-04-08 03:51:14,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {10376#true} assume !!(~main__urilen~0 <= 1000000); {10376#true} is VALID
[2022-04-08 03:51:14,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {10376#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {10376#true} is VALID
[2022-04-08 03:51:14,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {10376#true} call #t~ret11 := main(); {10376#true} is VALID
[2022-04-08 03:51:14,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10376#true} {10376#true} #225#return; {10376#true} is VALID
[2022-04-08 03:51:14,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {10376#true} assume true; {10376#true} is VALID
[2022-04-08 03:51:14,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {10376#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {10376#true} is VALID
[2022-04-08 03:51:14,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {10376#true} call ULTIMATE.init(); {10376#true} is VALID
[2022-04-08 03:51:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:51:14,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059457963] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 03:51:14,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 03:51:14,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7
[2022-04-08 03:51:14,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:14,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2089229971]
[2022-04-08 03:51:14,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2089229971] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:14,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:14,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:14,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134723419]
[2022-04-08 03:51:14,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:14,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44
[2022-04-08 03:51:14,650 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:14,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:14,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:14,682 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:51:14,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:14,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:51:14,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2022-04-08 03:51:14,682 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:15,087 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions.
[2022-04-08 03:51:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-08 03:51:15,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44
[2022-04-08 03:51:15,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions.
[2022-04-08 03:51:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions.
[2022-04-08 03:51:15,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 56 transitions.
[2022-04-08 03:51:15,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:15,152 INFO L225 Difference]: With dead ends: 60
[2022-04-08 03:51:15,152 INFO L226 Difference]: Without dead ends: 58
[2022-04-08 03:51:15,153 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110
[2022-04-08 03:51:15,153 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 84 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:15,154 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 49 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:51:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2022-04-08 03:51:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58.
[2022-04-08 03:51:15,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:15,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:15,344 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:15,344 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:15,345 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions.
[2022-04-08 03:51:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions.
[2022-04-08 03:51:15,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:15,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:15,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states.
[2022-04-08 03:51:15,346 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states.
[2022-04-08 03:51:15,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:15,347 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions.
[2022-04-08 03:51:15,347 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions.
[2022-04-08 03:51:15,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:15,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:15,347 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:15,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions.
[2022-04-08 03:51:15,348 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44
[2022-04-08 03:51:15,348 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:15,348 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions.
[2022-04-08 03:51:15,348 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:15,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 61 transitions.
[2022-04-08 03:51:15,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions.
[2022-04-08 03:51:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2022-04-08 03:51:15,457 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:51:15,457 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:51:15,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2022-04-08 03:51:15,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 03:51:15,658 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:51:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:51:15,658 INFO L85 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 1 times
[2022-04-08 03:51:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:15,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1864494922]
[2022-04-08 03:51:15,659 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:51:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 2 times
[2022-04-08 03:51:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:51:15,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545991536]
[2022-04-08 03:51:15,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:51:15,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:51:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:15,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:15,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {11017#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {11009#true} is VALID
[2022-04-08 03:51:15,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {11009#true} assume true; {11009#true} is VALID
[2022-04-08 03:51:15,726 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11009#true} {11009#true} #225#return; {11009#true} is VALID
[2022-04-08 03:51:15,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {11009#true} call ULTIMATE.init(); {11017#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:15,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {11017#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {11009#true} is VALID
[2022-04-08 03:51:15,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {11009#true} assume true; {11009#true} is VALID
[2022-04-08 03:51:15,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11009#true} {11009#true} #225#return; {11009#true} is VALID
[2022-04-08 03:51:15,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {11009#true} call #t~ret11 := main(); {11009#true} is VALID
[2022-04-08 03:51:15,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {11009#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {11009#true} is VALID
[2022-04-08 03:51:15,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {11009#true} assume !!(~main__urilen~0 <= 1000000); {11009#true} is VALID
[2022-04-08 03:51:15,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {11009#true} assume !!(~main__urilen~0 >= -1000000); {11009#true} is VALID
[2022-04-08 03:51:15,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {11009#true} assume !!(~main__tokenlen~0 <= 1000000); {11009#true} is VALID
[2022-04-08 03:51:15,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {11009#true} assume !!(~main__tokenlen~0 >= -1000000); {11009#true} is VALID
[2022-04-08 03:51:15,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {11009#true} assume !!(~main__scheme~0 <= 1000000); {11009#true} is VALID
[2022-04-08 03:51:15,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {11009#true} assume !!(~main__scheme~0 >= -1000000); {11009#true} is VALID
[2022-04-08 03:51:15,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {11009#true} assume ~main__urilen~0 > 0; {11009#true} is VALID
[2022-04-08 03:51:15,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {11009#true} assume ~main__tokenlen~0 > 0; {11009#true} is VALID
[2022-04-08 03:51:15,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {11009#true} assume ~main__scheme~0 >= 0; {11009#true} is VALID
[2022-04-08 03:51:15,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {11009#true} assume !(0 == ~main__scheme~0); {11009#true} is VALID
[2022-04-08 03:51:15,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {11009#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11009#true} is VALID
[2022-04-08 03:51:15,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {11009#true} is VALID
[2022-04-08 03:51:15,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {11009#true} is VALID
[2022-04-08 03:51:15,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {11009#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {11009#true} is VALID
[2022-04-08 03:51:15,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {11009#true} is VALID
[2022-04-08 03:51:15,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~3); {11009#true} is VALID
[2022-04-08 03:51:15,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {11009#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {11009#true} is VALID
[2022-04-08 03:51:15,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {11009#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {11009#true} is VALID
[2022-04-08 03:51:15,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {11009#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {11009#true} is VALID
[2022-04-08 03:51:15,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {11009#true} is VALID
[2022-04-08 03:51:15,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~5); {11009#true} is VALID
[2022-04-08 03:51:15,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {11009#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {11009#true} is VALID
[2022-04-08 03:51:15,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {11009#true} is VALID
[2022-04-08 03:51:15,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~7); {11009#true} is VALID
[2022-04-08 03:51:15,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {11009#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {11009#true} is VALID
[2022-04-08 03:51:15,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {11009#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {11009#true} is VALID
[2022-04-08 03:51:15,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {11014#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} is VALID
[2022-04-08 03:51:15,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {11014#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~9); {11015#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:15,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {11015#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:15,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {11015#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:15,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {11015#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:15,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {11015#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:15,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {11015#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:15,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {11015#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:15,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {11015#(<= 0 main_~main__cp~0)} is VALID
[2022-04-08 03:51:15,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {11016#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID
[2022-04-08 03:51:15,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {11016#(not (= main_~__VERIFIER_assert__cond~15 0))} assume 0 == ~__VERIFIER_assert__cond~15; {11010#false} is VALID
[2022-04-08 03:51:15,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {11010#false} assume !false; {11010#false} is VALID
[2022-04-08 03:51:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 03:51:15,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:15,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545991536]
[2022-04-08 03:51:15,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545991536] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:15,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:15,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:15,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:15,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1864494922]
[2022-04-08 03:51:15,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1864494922] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:15,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:15,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:15,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112480354]
[2022-04-08 03:51:15,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:15,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44
[2022-04-08 03:51:15,737 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:15,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:15,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:15,765 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:51:15,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:15,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:51:15,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-08 03:51:15,766 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:16,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:16,305 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions.
[2022-04-08 03:51:16,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-08 03:51:16,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44
[2022-04-08 03:51:16,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions.
[2022-04-08 03:51:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions.
[2022-04-08 03:51:16,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions.
[2022-04-08 03:51:16,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:16,359 INFO L225 Difference]: With dead ends: 69
[2022-04-08 03:51:16,359 INFO L226 Difference]: Without dead ends: 67
[2022-04-08 03:51:16,359 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2022-04-08 03:51:16,359 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:16,360 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 65 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:51:16,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2022-04-08 03:51:16,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56.
[2022-04-08 03:51:16,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:16,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:16,517 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:16,517 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:16,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:16,518 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions.
[2022-04-08 03:51:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions.
[2022-04-08 03:51:16,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:16,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:16,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states.
[2022-04-08 03:51:16,519 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states.
[2022-04-08 03:51:16,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:16,520 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions.
[2022-04-08 03:51:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions.
[2022-04-08 03:51:16,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:16,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:16,520 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:16,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions.
[2022-04-08 03:51:16,521 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44
[2022-04-08 03:51:16,521 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:16,521 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions.
[2022-04-08 03:51:16,521 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:16,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 59 transitions.
[2022-04-08 03:51:16,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions.
[2022-04-08 03:51:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2022-04-08 03:51:16,653 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:51:16,653 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:51:16,653 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2022-04-08 03:51:16,654 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] ===
[2022-04-08 03:51:16,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:51:16,654 INFO L85 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 1 times
[2022-04-08 03:51:16,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:16,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [181869787]
[2022-04-08 03:51:16,655 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:51:16,655 INFO L85 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 2 times
[2022-04-08 03:51:16,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:51:16,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435791868]
[2022-04-08 03:51:16,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:51:16,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:51:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:16,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:51:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:51:16,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {11418#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {11410#true} is VALID
[2022-04-08 03:51:16,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {11410#true} assume true; {11410#true} is VALID
[2022-04-08 03:51:16,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11410#true} {11410#true} #225#return; {11410#true} is VALID
[2022-04-08 03:51:16,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {11410#true} call ULTIMATE.init(); {11418#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:51:16,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {11418#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {11410#true} is VALID
[2022-04-08 03:51:16,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {11410#true} assume true; {11410#true} is VALID
[2022-04-08 03:51:16,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11410#true} {11410#true} #225#return; {11410#true} is VALID
[2022-04-08 03:51:16,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {11410#true} call #t~ret11 := main(); {11410#true} is VALID
[2022-04-08 03:51:16,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {11410#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {11410#true} is VALID
[2022-04-08 03:51:16,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {11410#true} assume !!(~main__urilen~0 <= 1000000); {11410#true} is VALID
[2022-04-08 03:51:16,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {11410#true} assume !!(~main__urilen~0 >= -1000000); {11410#true} is VALID
[2022-04-08 03:51:16,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {11410#true} assume !!(~main__tokenlen~0 <= 1000000); {11410#true} is VALID
[2022-04-08 03:51:16,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {11410#true} assume !!(~main__tokenlen~0 >= -1000000); {11410#true} is VALID
[2022-04-08 03:51:16,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {11410#true} assume !!(~main__scheme~0 <= 1000000); {11410#true} is VALID
[2022-04-08 03:51:16,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {11410#true} assume !!(~main__scheme~0 >= -1000000); {11410#true} is VALID
[2022-04-08 03:51:16,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {11410#true} assume ~main__urilen~0 > 0; {11410#true} is VALID
[2022-04-08 03:51:16,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {11410#true} assume ~main__tokenlen~0 > 0; {11410#true} is VALID
[2022-04-08 03:51:16,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {11410#true} assume ~main__scheme~0 >= 0; {11410#true} is VALID
[2022-04-08 03:51:16,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {11410#true} assume !(0 == ~main__scheme~0); {11410#true} is VALID
[2022-04-08 03:51:16,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {11410#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11410#true} is VALID
[2022-04-08 03:51:16,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {11410#true} is VALID
[2022-04-08 03:51:16,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {11410#true} is VALID
[2022-04-08 03:51:16,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {11410#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {11410#true} is VALID
[2022-04-08 03:51:16,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {11410#true} is VALID
[2022-04-08 03:51:16,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~3); {11410#true} is VALID
[2022-04-08 03:51:16,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {11410#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {11410#true} is VALID
[2022-04-08 03:51:16,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {11410#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {11410#true} is VALID
[2022-04-08 03:51:16,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {11410#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {11410#true} is VALID
[2022-04-08 03:51:16,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {11410#true} is VALID
[2022-04-08 03:51:16,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~5); {11410#true} is VALID
[2022-04-08 03:51:16,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {11410#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {11410#true} is VALID
[2022-04-08 03:51:16,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {11410#true} is VALID
[2022-04-08 03:51:16,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~7); {11410#true} is VALID
[2022-04-08 03:51:16,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {11410#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {11410#true} is VALID
[2022-04-08 03:51:16,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {11410#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {11410#true} is VALID
[2022-04-08 03:51:16,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {11410#true} is VALID
[2022-04-08 03:51:16,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~9); {11410#true} is VALID
[2022-04-08 03:51:16,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {11410#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {11410#true} is VALID
[2022-04-08 03:51:16,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {11410#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {11410#true} is VALID
[2022-04-08 03:51:16,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {11410#true} is VALID
[2022-04-08 03:51:16,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {11410#true} is VALID
[2022-04-08 03:51:16,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {11410#true} assume !!(0 == ~main____CPAchecker_TMP_3~0); {11410#true} is VALID
[2022-04-08 03:51:16,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {11410#true} ~main__cp~0 := 1 + ~main__cp~0; {11410#true} is VALID
[2022-04-08 03:51:16,729 INFO L290 TraceCheckUtils]: 40: Hoare triple {11410#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {11410#true} is VALID
[2022-04-08 03:51:16,729 INFO L290 TraceCheckUtils]: 41: Hoare triple {11410#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {11415#(or (and (= main_~__VERIFIER_assert__cond~10 0) (<= main_~main__urilen~0 main_~main__cp~0)) (and (= main_~__VERIFIER_assert__cond~10 1) (not (<= main_~main__urilen~0 main_~main__cp~0))))} is VALID
[2022-04-08 03:51:16,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {11415#(or (and (= main_~__VERIFIER_assert__cond~10 0) (<= main_~main__urilen~0 main_~main__cp~0)) (and (= main_~__VERIFIER_assert__cond~10 1) (not (<= main_~main__urilen~0 main_~main__cp~0))))} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:51:16,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:51:16,730 INFO L290 TraceCheckUtils]: 44: Hoare triple {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:51:16,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID
[2022-04-08 03:51:16,731 INFO L290 TraceCheckUtils]: 46: Hoare triple {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {11417#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID
[2022-04-08 03:51:16,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {11417#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {11411#false} is VALID
[2022-04-08 03:51:16,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {11411#false} assume !false; {11411#false} is VALID
[2022-04-08 03:51:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2022-04-08 03:51:16,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:51:16,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435791868]
[2022-04-08 03:51:16,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435791868] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:16,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:16,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:16,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:51:16,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [181869787]
[2022-04-08 03:51:16,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [181869787] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:51:16,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:51:16,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 03:51:16,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200599199]
[2022-04-08 03:51:16,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:51:16,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49
[2022-04-08 03:51:16,734 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:51:16,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:16,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:16,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 03:51:16,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:51:16,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 03:51:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-08 03:51:16,764 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:17,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:17,290 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions.
[2022-04-08 03:51:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-04-08 03:51:17,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49
[2022-04-08 03:51:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:51:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions.
[2022-04-08 03:51:17,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions.
[2022-04-08 03:51:17,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 71 transitions.
[2022-04-08 03:51:17,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:17,370 INFO L225 Difference]: With dead ends: 75
[2022-04-08 03:51:17,371 INFO L226 Difference]: Without dead ends: 0
[2022-04-08 03:51:17,373 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132
[2022-04-08 03:51:17,376 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 88 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:51:17,377 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 55 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:51:17,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2022-04-08 03:51:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2022-04-08 03:51:17,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:51:17,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-08 03:51:17,378 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-08 03:51:17,378 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-08 03:51:17,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:17,378 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-08 03:51:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 03:51:17,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:17,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:17,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states.
[2022-04-08 03:51:17,378 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states.
[2022-04-08 03:51:17,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:51:17,379 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-08 03:51:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 03:51:17,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:17,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:51:17,379 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:51:17,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:51:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-08 03:51:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2022-04-08 03:51:17,379 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49
[2022-04-08 03:51:17,379 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:51:17,379 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-04-08 03:51:17,380 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 03:51:17,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions.
[2022-04-08 03:51:17,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:51:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 03:51:17,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:51:17,382 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining)
[2022-04-08 03:51:17,383 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining)
[2022-04-08 03:51:17,383 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining)
[2022-04-08 03:51:17,383 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining)
[2022-04-08 03:51:17,383 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining)
[2022-04-08 03:51:17,383 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining)
[2022-04-08 03:51:17,383 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining)
[2022-04-08 03:51:17,384 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining)
[2022-04-08 03:51:17,384 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining)
[2022-04-08 03:51:17,384 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining)
[2022-04-08 03:51:17,384 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining)
[2022-04-08 03:51:17,384 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining)
[2022-04-08 03:51:17,384 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining)
[2022-04-08 03:51:17,384 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining)
[2022-04-08 03:51:17,385 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining)
[2022-04-08 03:51:17,386 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining)
[2022-04-08 03:51:17,386 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining)
[2022-04-08 03:51:17,386 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining)
[2022-04-08 03:51:17,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2022-04-08 03:51:17,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2022-04-08 03:51:37,544 WARN L232 SmtUtils]: Spent 11.88s on a formula simplification. DAG size of input: 124 DAG size of output: 120 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)
[2022-04-08 03:52:36,423 WARN L232 SmtUtils]: Spent 44.53s on a formula simplification. DAG size of input: 130 DAG size of output: 125 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)
[2022-04-08 03:52:49,915 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed.
[2022-04-08 03:52:49,915 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed.
[2022-04-08 03:52:49,915 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed.
[2022-04-08 03:52:49,915 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed.
[2022-04-08 03:52:49,915 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed.
[2022-04-08 03:52:49,915 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed.
[2022-04-08 03:52:49,915 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed.
[2022-04-08 03:52:49,915 INFO L878 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) the Hoare annotation is: false
[2022-04-08 03:52:49,916 INFO L878 garLoopResultBuilder]: At program point mainEXIT(lines 13 439) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0))
[2022-04-08 03:52:49,916 INFO L878 garLoopResultBuilder]: At program point L374(line 374) the Hoare annotation is: false
[2022-04-08 03:52:49,916 INFO L878 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: false
[2022-04-08 03:52:49,916 INFO L878 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: false
[2022-04-08 03:52:49,916 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 362) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (<= main_~main__urilen~0 main_~main__cp~0)) (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= |old(~__return_375~0)| ~__return_375~0)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4 .cse5))))
[2022-04-08 03:52:49,916 INFO L878 garLoopResultBuilder]: At program point L234(lines 234 338) the Hoare annotation is: (let ((.cse2 (= main_~__VERIFIER_assert__cond~9 1)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse6 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse7 (= main_~__VERIFIER_assert__cond~3 1)) (.cse8 (= |old(~__return_375~0)| ~__return_375~0)) (.cse0 (= main_~main__c~0 0)) (.cse16 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse12 (< 0 main_~main__scheme~0)) (.cse13 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse14 (<= 1 main_~main__cp~0)) (.cse15 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and (let ((.cse1 (let ((.cse9 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and .cse0 .cse1) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse1))) (not (= main_~__VERIFIER_assert__cond~10 0)) .cse16) (and .cse2 .cse3 (= main_~__VERIFIER_assert__cond~8 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse16 .cse11 .cse12 .cse13 .cse14 .cse15)))
[2022-04-08 03:52:49,916 INFO L878 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) the Hoare annotation is: false
[2022-04-08 03:52:49,916 INFO L878 garLoopResultBuilder]: At program point L135(lines 135 397) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5))) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0))
[2022-04-08 03:52:49,917 INFO L878 garLoopResultBuilder]: At program point L226(line 226) the Hoare annotation is: false
[2022-04-08 03:52:49,917 INFO L878 garLoopResultBuilder]: At program point L61(lines 61 427) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0)
[2022-04-08 03:52:49,917 INFO L878 garLoopResultBuilder]: At program point L284(line 284) the Hoare annotation is: false
[2022-04-08 03:52:49,917 INFO L878 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) the Hoare annotation is: false
[2022-04-08 03:52:49,917 INFO L878 garLoopResultBuilder]: At program point L53(lines 53 433) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0)
[2022-04-08 03:52:49,917 INFO L878 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: false
[2022-04-08 03:52:49,917 INFO L878 garLoopResultBuilder]: At program point L177(line 177) the Hoare annotation is: false
[2022-04-08 03:52:49,917 INFO L878 garLoopResultBuilder]: At program point L111(lines 111 405) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~2 1) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0))
[2022-04-08 03:52:49,917 INFO L878 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) the Hoare annotation is: false
[2022-04-08 03:52:49,917 INFO L878 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5))) (< main_~main__cp~0 main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0))
[2022-04-08 03:52:49,918 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 354) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)))
[2022-04-08 03:52:49,918 INFO L878 garLoopResultBuilder]: At program point L384(lines 384 393) the Hoare annotation is: (and (not (<= main_~main__scheme~0 0)) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~17 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~16 0)) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)))
[2022-04-08 03:52:49,918 INFO L878 garLoopResultBuilder]: At program point L95(lines 95 412) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0))
[2022-04-08 03:52:49,918 INFO L878 garLoopResultBuilder]: At program point L29(lines 29 437) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0)
[2022-04-08 03:52:49,918 INFO L878 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) the Hoare annotation is: false
[2022-04-08 03:52:49,918 INFO L878 garLoopResultBuilder]: At program point L145(line 145) the Hoare annotation is: false
[2022-04-08 03:52:49,918 INFO L878 garLoopResultBuilder]: At program point L401(lines 131 402) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (not (<= main_~main__urilen~0 main_~main__cp~0)))
[2022-04-08 03:52:49,918 INFO L878 garLoopResultBuilder]: At program point mainFINAL(lines 13 439) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0))
[2022-04-08 03:52:49,918 INFO L878 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) the Hoare annotation is: false
[2022-04-08 03:52:49,918 INFO L878 garLoopResultBuilder]: At program point L104(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0))
[2022-04-08 03:52:49,918 INFO L878 garLoopResultBuilder]: At program point L71(lines 71 416) the Hoare annotation is: (and (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0))
[2022-04-08 03:52:49,919 INFO L878 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (and (let ((.cse0 (let ((.cse1 (= main_~__VERIFIER_assert__cond~9 1)) (.cse2 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse6 (= main_~__VERIFIER_assert__cond~3 1)) (.cse7 (not (= main_~__VERIFIER_assert__cond~9 0))) (.cse8 (= |old(~__return_375~0)| ~__return_375~0)) (.cse9 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse11 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse13 (< 0 main_~main__scheme~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse15 (<= 1 main_~main__cp~0)) (.cse16 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and (= main_~main__c~0 0) .cse0) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse0))) (= main_~__VERIFIER_assert__cond~10 1))
[2022-04-08 03:52:49,919 INFO L878 garLoopResultBuilder]: At program point L294(lines 294 318) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~14 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)))
[2022-04-08 03:52:49,919 INFO L878 garLoopResultBuilder]: At program point L162(lines 162 359) the Hoare annotation is: (let ((.cse0 (let ((.cse6 (not (<= main_~main__scheme~0 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse9 (<= 1 main_~main__cp~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse6 .cse7 .cse8 (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0)) .cse9 .cse10) (and .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse9 .cse10)))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (= |old(~__return_375~0)| ~__return_375~0)) (.cse1 (+ main_~main__cp~0 1)) (.cse5 (not (= main_~__VERIFIER_assert__cond~5 0)))) (or (and .cse0 (= main_~main__urilen~0 .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (< .cse1 main_~main__urilen~0) .cse5)))
[2022-04-08 03:52:49,919 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) the Hoare annotation is: false
[2022-04-08 03:52:49,919 INFO L878 garLoopResultBuilder]: At program point L63(lines 63 422) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0)
[2022-04-08 03:52:49,919 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0)
[2022-04-08 03:52:49,919 INFO L878 garLoopResultBuilder]: At program point L253(lines 253 329) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~main__c~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= main_~main__c~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))))
[2022-04-08 03:52:49,919 INFO L878 garLoopResultBuilder]: At program point L187(lines 187 355) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)))
[2022-04-08 03:52:49,919 INFO L878 garLoopResultBuilder]: At program point L410(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0))
[2022-04-08 03:52:49,919 INFO L878 garLoopResultBuilder]: At program point L212(lines 212 346) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (= main_~__VERIFIER_assert__cond~8 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (= main_~main__c~0 0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)))
[2022-04-08 03:52:49,919 INFO L878 garLoopResultBuilder]: At program point L113(line 113) the Hoare annotation is: false
[2022-04-08 03:52:49,920 INFO L878 garLoopResultBuilder]: At program point L47(lines 47 434) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0)
[2022-04-08 03:52:49,920 INFO L878 garLoopResultBuilder]: At program point L270(lines 270 322) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)))
[2022-04-08 03:52:49,920 INFO L878 garLoopResultBuilder]: At program point L204(lines 204 353) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)))
[2022-04-08 03:52:49,920 INFO L878 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) the Hoare annotation is: false
[2022-04-08 03:52:49,920 INFO L878 garLoopResultBuilder]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) the Hoare annotation is: false
[2022-04-08 03:52:49,920 INFO L878 garLoopResultBuilder]: At program point L262(lines 262 328) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~main__c~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= main_~main__c~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))))
[2022-04-08 03:52:49,920 INFO L878 garLoopResultBuilder]: At program point L386(line 386) the Hoare annotation is: false
[2022-04-08 03:52:49,920 INFO L878 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: false
[2022-04-08 03:52:49,920 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 360) the Hoare annotation is: (let ((.cse0 (let ((.cse6 (not (<= main_~main__scheme~0 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse9 (<= 1 main_~main__cp~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse6 .cse7 .cse8 (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0)) .cse9 .cse10) (and .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse9 .cse10)))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (= |old(~__return_375~0)| ~__return_375~0)) (.cse1 (+ main_~main__cp~0 1)) (.cse5 (not (= main_~__VERIFIER_assert__cond~5 0)))) (or (and .cse0 (= main_~main__urilen~0 .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (< .cse1 main_~main__urilen~0) .cse5)))
[2022-04-08 03:52:49,920 INFO L878 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) the Hoare annotation is: false
[2022-04-08 03:52:49,920 INFO L878 garLoopResultBuilder]: At program point L23(lines 23 438) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0)
[2022-04-08 03:52:49,920 INFO L878 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) the Hoare annotation is: false
[2022-04-08 03:52:49,920 INFO L878 garLoopResultBuilder]: At program point L296(line 296) the Hoare annotation is: false
[2022-04-08 03:52:49,921 INFO L878 garLoopResultBuilder]: At program point L65(lines 65 417) the Hoare annotation is: (and (<= 0 main_~main__scheme~0) (= |old(~__return_375~0)| ~__return_375~0))
[2022-04-08 03:52:49,921 INFO L878 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) the Hoare annotation is: false
[2022-04-08 03:52:49,921 INFO L878 garLoopResultBuilder]: At program point L255(line 255) the Hoare annotation is: false
[2022-04-08 03:52:49,921 INFO L878 garLoopResultBuilder]: At program point L189(line 189) the Hoare annotation is: false
[2022-04-08 03:52:49,921 INFO L878 garLoopResultBuilder]: At program point L123(lines 123 403) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~2 1) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0))
[2022-04-08 03:52:49,921 INFO L878 garLoopResultBuilder]: At program point L214(line 214) the Hoare annotation is: false
[2022-04-08 03:52:49,921 INFO L878 garLoopResultBuilder]: At program point L272(line 272) the Hoare annotation is: false
[2022-04-08 03:52:49,921 INFO L878 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) the Hoare annotation is: false
[2022-04-08 03:52:49,921 INFO L878 garLoopResultBuilder]: At program point L41(lines 41 435) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0)
[2022-04-08 03:52:49,921 INFO L878 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) the Hoare annotation is: false
[2022-04-08 03:52:49,921 INFO L878 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: false
[2022-04-08 03:52:49,921 INFO L878 garLoopResultBuilder]: At program point L372(lines 372 395) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (not (= main_~__VERIFIER_assert__cond~16 0))) (.cse5 (<= 1 main_~main__cp~0)) (.cse6 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~__VERIFIER_assert__cond~2 1) .cse5 .cse6))) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0))
[2022-04-08 03:52:49,921 INFO L878 garLoopResultBuilder]: At program point L83(lines 83 414) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0))
[2022-04-08 03:52:49,922 INFO L878 garLoopResultBuilder]: At program point L306(lines 306 316) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~14 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~15 0)))
[2022-04-08 03:52:49,922 INFO L878 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) the Hoare annotation is: false
[2022-04-08 03:52:49,922 INFO L878 garLoopResultBuilder]: At program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) the Hoare annotation is: false
[2022-04-08 03:52:49,922 INFO L878 garLoopResultBuilder]: At program point L224(lines 224 344) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (= main_~__VERIFIER_assert__cond~8 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (= main_~main__c~0 0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)))
[2022-04-08 03:52:49,922 INFO L878 garLoopResultBuilder]: At program point L125(line 125) the Hoare annotation is: false
[2022-04-08 03:52:49,922 INFO L878 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) the Hoare annotation is: false
[2022-04-08 03:52:49,922 INFO L878 garLoopResultBuilder]: At program point L59(lines 59 432) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0)
[2022-04-08 03:52:49,922 INFO L878 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse9 (= main_~main__c~0 0)) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (< main_~main__cp~0 main_~main__urilen~0)) (.cse6 (= main_~__VERIFIER_assert__cond~3 1)) (.cse7 (= |old(~__return_375~0)| ~__return_375~0)) (.cse8 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~8 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0) .cse10 .cse11 .cse12 .cse13 .cse14) (and (let ((.cse15 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse15) (and .cse9 .cse15))) (not (= main_~__VERIFIER_assert__cond~10 0)))))
[2022-04-08 03:52:49,922 INFO L878 garLoopResultBuilder]: At program point L282(lines 282 320) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)))
[2022-04-08 03:52:49,923 INFO L878 garLoopResultBuilder]: At program point L241(lines 241 331) the Hoare annotation is: (let ((.cse14 (let ((.cse18 (<= main_~main__urilen~0 main_~main__cp~0))) (or (and (= main_~__VERIFIER_assert__cond~10 0) .cse18) (and (= main_~__VERIFIER_assert__cond~10 1) (not .cse18))))) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (= main_~main__c~0 0)) (.cse8 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse9 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse10 (< 0 main_~main__scheme~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse12 (<= 1 main_~main__cp~0)) (.cse13 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0))) (or (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~8 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse14 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse17 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~main__c~0) .cse16 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15))))))
[2022-04-08 03:52:49,923 INFO L878 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) the Hoare annotation is: false
[2022-04-08 03:52:49,923 INFO L878 garLoopResultBuilder]: At program point L175(lines 175 357) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (not (= main_~__VERIFIER_assert__cond~4 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)))
[2022-04-08 03:52:49,923 INFO L878 garLoopResultBuilder]: At program point L35(lines 35 436) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0)
[2022-04-08 03:52:49,923 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true
[2022-04-08 03:52:49,923 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))
[2022-04-08 03:52:49,923 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true
[2022-04-08 03:52:49,923 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true
[2022-04-08 03:52:49,923 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true
[2022-04-08 03:52:49,923 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2022-04-08 03:52:49,923 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true
[2022-04-08 03:52:49,926 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
[2022-04-08 03:52:49,927 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-08 03:52:49,931 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation
[2022-04-08 03:52:49,932 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2022-04-08 03:52:49,932 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation
[2022-04-08 03:52:49,932 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation
[2022-04-08 03:52:49,932 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation
[2022-04-08 03:52:49,933 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation
[2022-04-08 03:52:50,029 INFO L163 areAnnotationChecker]: CFG has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2022-04-08 03:52:50,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:52:50 BoogieIcfgContainer
[2022-04-08 03:52:50,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-08 03:52:50,065 INFO L158 Benchmark]: Toolchain (without parser) took 119419.77ms. Allocated memory was 197.1MB in the beginning and 412.1MB in the end (delta: 215.0MB). Free memory was 145.8MB in the beginning and 293.8MB in the end (delta: -148.1MB). Peak memory consumption was 220.9MB. Max. memory is 8.0GB.
[2022-04-08 03:52:50,066 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 197.1MB. Free memory was 162.0MB in the beginning and 161.9MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB.
[2022-04-08 03:52:50,066 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.40ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 145.5MB in the beginning and 203.6MB in the end (delta: -58.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-08 03:52:50,066 INFO L158 Benchmark]: Boogie Preprocessor took 63.13ms. Allocated memory is still 237.0MB. Free memory was 203.2MB in the beginning and 201.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-08 03:52:50,066 INFO L158 Benchmark]: RCFGBuilder took 612.54ms. Allocated memory is still 237.0MB. Free memory was 201.5MB in the beginning and 181.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB.
[2022-04-08 03:52:50,066 INFO L158 Benchmark]: TraceAbstraction took 118345.17ms. Allocated memory was 237.0MB in the beginning and 412.1MB in the end (delta: 175.1MB). Free memory was 181.2MB in the beginning and 293.8MB in the end (delta: -112.6MB). Peak memory consumption was 216.5MB. Max. memory is 8.0GB.
[2022-04-08 03:52:50,067 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- AssertionsEnabledResult: Assertions are enabled
Assertions are enabled
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.16ms. Allocated memory is still 197.1MB. Free memory was 162.0MB in the beginning and 161.9MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 392.40ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 145.5MB in the beginning and 203.6MB in the end (delta: -58.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 63.13ms. Allocated memory is still 237.0MB. Free memory was 203.2MB in the beginning and 201.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 612.54ms. Allocated memory is still 237.0MB. Free memory was 201.5MB in the beginning and 181.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB.
* TraceAbstraction took 118345.17ms. Allocated memory was 237.0MB in the beginning and 412.1MB in the end (delta: 175.1MB). Free memory was 181.2MB in the beginning and 293.8MB in the end (delta: -112.6MB). Peak memory consumption was 216.5MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- PositiveResult [Line: 85]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 97]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 113]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 125]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 145]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 157]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 177]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 189]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 214]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 226]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 243]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 255]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 272]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 284]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 296]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 308]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 374]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- PositiveResult [Line: 386]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 94 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 118.1s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 92.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3685 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3685 mSDsluCounter, 1675 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 350 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2505 IncrementalHoareTripleChecker+Invalid, 2695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 1325 mSDtfsCounter, 2505 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 269 SyntacticMatches, 18 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 296 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 87 LocationsWithAnnotation, 87 PreInvPairs, 140 NumberOfFragments, 2985 HoareAnnotationTreeSize, 87 FomulaSimplifications, 286041 FormulaSimplificationTreeSizeReduction, 88.9s HoareSimplificationTime, 87 FomulaSimplificationsInter, 619907 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
- AllSpecificationsHoldResult: All specifications hold
18 specifications checked. All of them hold
- InvariantResult [Line: 262]: Loop Invariant
Derived loop invariant: ((main__c == 0 && (((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen))) || ((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && (((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)))) && __VERIFIER_assert__cond == 1
- InvariantResult [Line: 129]: Loop Invariant
Derived loop invariant: (((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && main__cp < main__urilen) && \old(__return_375) == __return_375
- InvariantResult [Line: 131]: Loop Invariant
Derived loop invariant: ((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(main__urilen <= main__cp)
- InvariantResult [Line: 104]: Loop Invariant
Derived loop invariant: !(__VERIFIER_assert__cond == 0) && \old(__return_375) == __return_375
- InvariantResult [Line: 230]: Loop Invariant
Derived loop invariant: ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen))) || (main__c == 0 && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)))) && !(__VERIFIER_assert__cond == 0))
- ProcedureContractResult [Line: 13]: Procedure Contract for main
Derived contract for procedure main: !(__VERIFIER_assert__cond == 0) || \old(__return_375) == __return_375
RESULT: Ultimate proved your program to be correct!
[2022-04-08 03:52:50,118 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...