/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:34:40,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:34:40,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:34:40,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:34:40,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:34:40,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:34:40,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:34:40,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:34:40,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:34:40,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:34:40,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:34:40,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:34:40,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:34:40,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:34:40,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:34:40,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:34:40,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:34:40,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:34:40,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:34:40,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:34:40,855 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:34:40,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:34:40,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:34:40,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:34:40,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:34:40,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:34:40,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:34:40,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:34:40,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:34:40,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:34:40,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:34:40,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:34:40,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:34:40,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:34:40,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:34:40,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:34:40,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:34:40,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:34:40,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:34:40,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:34:40,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:34:40,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:34:40,873 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:34:40,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:34:40,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:34:40,895 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:34:40,895 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:34:40,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:34:40,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:34:40,898 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:34:40,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:34:40,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:34:40,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:34:40,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:34:40,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:34:40,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:34:40,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:34:40,899 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:34:40,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:34:40,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:34:40,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:34:40,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:34:40,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:34:40,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:34:40,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:34:40,900 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:34:40,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:34:40,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:34:40,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:34:40,900 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:34:40,900 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:34:40,902 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:34:40,902 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:34:41,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:34:41,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:34:41,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:34:41,096 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:34:41,097 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:34:41,098 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 [2022-04-27 21:34:41,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c8d2eff3/13387caa274847779f4740b2517bf98f/FLAG1862ae303 [2022-04-27 21:34:41,472 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:34:41,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2022-04-27 21:34:41,480 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c8d2eff3/13387caa274847779f4740b2517bf98f/FLAG1862ae303 [2022-04-27 21:34:41,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c8d2eff3/13387caa274847779f4740b2517bf98f [2022-04-27 21:34:41,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:34:41,492 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:34:41,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:34:41,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:34:41,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:34:41,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:34:41" (1/1) ... [2022-04-27 21:34:41,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@363d186d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:41, skipping insertion in model container [2022-04-27 21:34:41,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:34:41" (1/1) ... [2022-04-27 21:34:41,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:34:41,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:34:41,630 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[893,906] [2022-04-27 21:34:41,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:34:41,663 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:34:41,670 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[893,906] [2022-04-27 21:34:41,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:34:41,686 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:34:41,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:41 WrapperNode [2022-04-27 21:34:41,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:34:41,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:34:41,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:34:41,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:34:41,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:41" (1/1) ... [2022-04-27 21:34:41,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:41" (1/1) ... [2022-04-27 21:34:41,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:41" (1/1) ... [2022-04-27 21:34:41,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:41" (1/1) ... [2022-04-27 21:34:41,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:41" (1/1) ... [2022-04-27 21:34:41,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:41" (1/1) ... [2022-04-27 21:34:41,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:41" (1/1) ... [2022-04-27 21:34:41,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:34:41,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:34:41,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:34:41,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:34:41,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:41" (1/1) ... [2022-04-27 21:34:41,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:34:41,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:34:41,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:34:41,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:34:41,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:34:41,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:34:41,777 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:34:41,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:34:41,777 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:34:41,777 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:34:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:34:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:34:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:34:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:34:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:34:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:34:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:34:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:34:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:34:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:34:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:34:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:34:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:34:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:34:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:34:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:34:41,824 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:34:41,826 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:34:42,014 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:34:42,019 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:34:42,019 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 21:34:42,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:34:42 BoogieIcfgContainer [2022-04-27 21:34:42,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:34:42,021 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:34:42,021 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:34:42,022 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:34:42,024 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:34:42" (1/1) ... [2022-04-27 21:34:42,025 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:34:42,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:34:42 BasicIcfg [2022-04-27 21:34:42,078 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:34:42,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:34:42,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:34:42,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:34:42,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:34:41" (1/4) ... [2022-04-27 21:34:42,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727103be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:34:42, skipping insertion in model container [2022-04-27 21:34:42,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:41" (2/4) ... [2022-04-27 21:34:42,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727103be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:34:42, skipping insertion in model container [2022-04-27 21:34:42,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:34:42" (3/4) ... [2022-04-27 21:34:42,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727103be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:34:42, skipping insertion in model container [2022-04-27 21:34:42,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:34:42" (4/4) ... [2022-04-27 21:34:42,085 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.iqvasr [2022-04-27 21:34:42,094 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:34:42,095 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:34:42,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:34:42,154 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@77f569ef, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@76a863aa [2022-04-27 21:34:42,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:34:42,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 33 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 21:34:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:34:42,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:42,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:42,171 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:34:42,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:42,177 INFO L85 PathProgramCache]: Analyzing trace with hash -505878006, now seen corresponding path program 1 times [2022-04-27 21:34:42,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:42,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926892956] [2022-04-27 21:34:42,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:42,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:42,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:42,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {65#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {57#true} is VALID [2022-04-27 21:34:42,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-27 21:34:42,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-27 21:34:42,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {57#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:42,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {65#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {57#true} is VALID [2022-04-27 21:34:42,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-27 21:34:42,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-27 21:34:42,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {57#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-27 21:34:42,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {57#true} [191] mainENTRY-->L32: Formula: (and (= |v_main_#t~nondet1_2| v_main_~urilen~0_1) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet2_2| v_main_~tokenlen~0_1) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~scheme~0_1 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_1, main_~urilen~0=v_main_~urilen~0_1, main_~scheme~0=v_main_~scheme~0_1, main_~c~0=v_main_~c~0_1, main_~cp~0=v_main_~cp~0_1} AuxVars[] AssignedVars[main_~tokenlen~0, main_~urilen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~scheme~0, main_~c~0, main_~cp~0] {57#true} is VALID [2022-04-27 21:34:42,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {57#true} [194] L32-->L33: Formula: (and (<= v_main_~urilen~0_5 1000000) (<= 0 (+ 1000000 v_main_~urilen~0_5))) InVars {main_~urilen~0=v_main_~urilen~0_5} OutVars{main_~urilen~0=v_main_~urilen~0_5} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-27 21:34:42,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#true} [197] L33-->L34: Formula: (and (<= v_main_~tokenlen~0_5 1000000) (<= 0 (+ v_main_~tokenlen~0_5 1000000))) InVars {main_~tokenlen~0=v_main_~tokenlen~0_5} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_5} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-27 21:34:42,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {57#true} [199] L34-->L35: Formula: (and (<= 0 (+ v_main_~scheme~0_5 1000000)) (<= v_main_~scheme~0_5 1000000)) InVars {main_~scheme~0=v_main_~scheme~0_5} OutVars{main_~scheme~0=v_main_~scheme~0_5} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-27 21:34:42,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {57#true} [200] L35-->L35-1: Formula: (< 0 v_main_~urilen~0_6) InVars {main_~urilen~0=v_main_~urilen~0_6} OutVars{main_~urilen~0=v_main_~urilen~0_6} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-27 21:34:42,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {57#true} [202] L35-1-->L36: Formula: (< 0 v_main_~tokenlen~0_6) InVars {main_~tokenlen~0=v_main_~tokenlen~0_6} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_6} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-27 21:34:42,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {57#true} [205] L36-->L37: Formula: (<= 0 v_main_~scheme~0_6) InVars {main_~scheme~0=v_main_~scheme~0_6} OutVars{main_~scheme~0=v_main_~scheme~0_6} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-27 21:34:42,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {57#true} [208] L37-->L42: Formula: (and (not (< v_main_~urilen~0_9 (+ v_main_~scheme~0_9 1))) (not (= v_main_~scheme~0_9 0)) (= v_main_~scheme~0_9 v_main_~cp~0_2)) InVars {main_~urilen~0=v_main_~urilen~0_9, main_~scheme~0=v_main_~scheme~0_9} OutVars{main_~urilen~0=v_main_~urilen~0_9, main_~cp~0=v_main_~cp~0_2, main_~scheme~0=v_main_~scheme~0_9} AuxVars[] AssignedVars[main_~cp~0] {62#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2022-04-27 21:34:42,374 INFO L272 TraceCheckUtils]: 13: Hoare triple {62#(<= (+ main_~cp~0 1) main_~urilen~0)} [209] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {63#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:34:42,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {63#(not (= |__VERIFIER_assert_#in~cond| 0))} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {64#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:34:42,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {64#(not (= __VERIFIER_assert_~cond 0))} [213] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {58#false} is VALID [2022-04-27 21:34:42,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {58#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58#false} is VALID [2022-04-27 21:34:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:42,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:42,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926892956] [2022-04-27 21:34:42,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926892956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:42,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:42,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:34:42,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180157922] [2022-04-27 21:34:42,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:42,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 21:34:42,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:42,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:42,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:42,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:34:42,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:42,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:34:42,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:34:42,421 INFO L87 Difference]: Start difference. First operand has 54 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 33 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:43,156 INFO L93 Difference]: Finished difference Result 112 states and 207 transitions. [2022-04-27 21:34:43,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:34:43,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 21:34:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2022-04-27 21:34:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2022-04-27 21:34:43,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 207 transitions. [2022-04-27 21:34:43,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:43,390 INFO L225 Difference]: With dead ends: 112 [2022-04-27 21:34:43,390 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 21:34:43,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 21:34:43,394 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 70 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:43,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 82 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 21:34:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 21:34:43,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2022-04-27 21:34:43,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:43,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:43,426 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:43,426 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:43,432 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-27 21:34:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-27 21:34:43,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:43,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:43,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 64 states. [2022-04-27 21:34:43,434 INFO L87 Difference]: Start difference. First operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 64 states. [2022-04-27 21:34:43,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:43,441 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-27 21:34:43,442 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-27 21:34:43,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:43,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:43,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:43,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2022-04-27 21:34:43,447 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 17 [2022-04-27 21:34:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:43,447 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2022-04-27 21:34:43,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2022-04-27 21:34:43,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:34:43,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:43,449 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:43,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:34:43,449 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:34:43,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:43,449 INFO L85 PathProgramCache]: Analyzing trace with hash 722598363, now seen corresponding path program 1 times [2022-04-27 21:34:43,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:43,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279190359] [2022-04-27 21:34:43,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:43,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:43,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:43,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {458#true} is VALID [2022-04-27 21:34:43,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 21:34:43,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 21:34:43,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 21:34:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:43,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {458#true} is VALID [2022-04-27 21:34:43,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 21:34:43,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 21:34:43,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {464#(<= 1 main_~cp~0)} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {464#(<= 1 main_~cp~0)} is VALID [2022-04-27 21:34:43,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {458#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:43,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {458#true} is VALID [2022-04-27 21:34:43,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 21:34:43,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 21:34:43,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 21:34:43,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#true} [191] mainENTRY-->L32: Formula: (and (= |v_main_#t~nondet1_2| v_main_~urilen~0_1) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet2_2| v_main_~tokenlen~0_1) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~scheme~0_1 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_1, main_~urilen~0=v_main_~urilen~0_1, main_~scheme~0=v_main_~scheme~0_1, main_~c~0=v_main_~c~0_1, main_~cp~0=v_main_~cp~0_1} AuxVars[] AssignedVars[main_~tokenlen~0, main_~urilen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~scheme~0, main_~c~0, main_~cp~0] {458#true} is VALID [2022-04-27 21:34:43,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {458#true} [194] L32-->L33: Formula: (and (<= v_main_~urilen~0_5 1000000) (<= 0 (+ 1000000 v_main_~urilen~0_5))) InVars {main_~urilen~0=v_main_~urilen~0_5} OutVars{main_~urilen~0=v_main_~urilen~0_5} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 21:34:43,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {458#true} [197] L33-->L34: Formula: (and (<= v_main_~tokenlen~0_5 1000000) (<= 0 (+ v_main_~tokenlen~0_5 1000000))) InVars {main_~tokenlen~0=v_main_~tokenlen~0_5} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_5} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 21:34:43,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#true} [199] L34-->L35: Formula: (and (<= 0 (+ v_main_~scheme~0_5 1000000)) (<= v_main_~scheme~0_5 1000000)) InVars {main_~scheme~0=v_main_~scheme~0_5} OutVars{main_~scheme~0=v_main_~scheme~0_5} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 21:34:43,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#true} [200] L35-->L35-1: Formula: (< 0 v_main_~urilen~0_6) InVars {main_~urilen~0=v_main_~urilen~0_6} OutVars{main_~urilen~0=v_main_~urilen~0_6} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 21:34:43,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#true} [202] L35-1-->L36: Formula: (< 0 v_main_~tokenlen~0_6) InVars {main_~tokenlen~0=v_main_~tokenlen~0_6} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_6} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 21:34:43,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#true} [205] L36-->L37: Formula: (<= 0 v_main_~scheme~0_6) InVars {main_~scheme~0=v_main_~scheme~0_6} OutVars{main_~scheme~0=v_main_~scheme~0_6} AuxVars[] AssignedVars[] {463#(< 0 (+ main_~scheme~0 1))} is VALID [2022-04-27 21:34:43,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {463#(< 0 (+ main_~scheme~0 1))} [208] L37-->L42: Formula: (and (not (< v_main_~urilen~0_9 (+ v_main_~scheme~0_9 1))) (not (= v_main_~scheme~0_9 0)) (= v_main_~scheme~0_9 v_main_~cp~0_2)) InVars {main_~urilen~0=v_main_~urilen~0_9, main_~scheme~0=v_main_~scheme~0_9} OutVars{main_~urilen~0=v_main_~urilen~0_9, main_~cp~0=v_main_~cp~0_2, main_~scheme~0=v_main_~scheme~0_9} AuxVars[] AssignedVars[main_~cp~0] {464#(<= 1 main_~cp~0)} is VALID [2022-04-27 21:34:43,539 INFO L272 TraceCheckUtils]: 13: Hoare triple {464#(<= 1 main_~cp~0)} [209] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {458#true} is VALID [2022-04-27 21:34:43,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {458#true} is VALID [2022-04-27 21:34:43,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 21:34:43,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {458#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 21:34:43,541 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {458#true} {464#(<= 1 main_~cp~0)} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {464#(<= 1 main_~cp~0)} is VALID [2022-04-27 21:34:43,542 INFO L272 TraceCheckUtils]: 18: Hoare triple {464#(<= 1 main_~cp~0)} [210] L42-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {469#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:34:43,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {469#(not (= |__VERIFIER_assert_#in~cond| 0))} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {470#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:34:43,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {470#(not (= __VERIFIER_assert_~cond 0))} [213] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-27 21:34:43,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {459#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-27 21:34:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:43,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:43,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279190359] [2022-04-27 21:34:43,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279190359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:43,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:43,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:34:43,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818866946] [2022-04-27 21:34:43,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:43,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-27 21:34:43,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:43,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:34:43,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:43,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:34:43,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:43,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:34:43,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:43,561 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:34:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:44,194 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2022-04-27 21:34:44,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:34:44,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-27 21:34:44,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:34:44,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-27 21:34:44,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:34:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-27 21:34:44,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-04-27 21:34:44,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:44,267 INFO L225 Difference]: With dead ends: 63 [2022-04-27 21:34:44,267 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 21:34:44,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:34:44,269 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:44,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 66 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 21:34:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 21:34:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 21:34:44,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:44,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:44,299 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:44,299 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:44,302 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-27 21:34:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-27 21:34:44,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:44,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:44,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-27 21:34:44,304 INFO L87 Difference]: Start difference. First operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-27 21:34:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:44,306 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-27 21:34:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-27 21:34:44,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:44,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:44,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:44,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2022-04-27 21:34:44,310 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 22 [2022-04-27 21:34:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:44,310 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-04-27 21:34:44,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:34:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-27 21:34:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 21:34:44,311 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:44,312 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:44,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:34:44,312 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:34:44,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:44,312 INFO L85 PathProgramCache]: Analyzing trace with hash 349034817, now seen corresponding path program 1 times [2022-04-27 21:34:44,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:44,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160472252] [2022-04-27 21:34:44,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:44,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {790#true} is VALID [2022-04-27 21:34:44,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,361 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {790#true} {790#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 21:34:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-27 21:34:44,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 21:34:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-27 21:34:44,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 21:34:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-27 21:34:44,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 21:34:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-27 21:34:44,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-27 21:34:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-27 21:34:44,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-27 21:34:44,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-27 21:34:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-27 21:34:44,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-27 21:34:44,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:44,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {790#true} is VALID [2022-04-27 21:34:44,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} [191] mainENTRY-->L32: Formula: (and (= |v_main_#t~nondet1_2| v_main_~urilen~0_1) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet2_2| v_main_~tokenlen~0_1) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~scheme~0_1 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_1, main_~urilen~0=v_main_~urilen~0_1, main_~scheme~0=v_main_~scheme~0_1, main_~c~0=v_main_~c~0_1, main_~cp~0=v_main_~cp~0_1} AuxVars[] AssignedVars[main_~tokenlen~0, main_~urilen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~scheme~0, main_~c~0, main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {790#true} [194] L32-->L33: Formula: (and (<= v_main_~urilen~0_5 1000000) (<= 0 (+ 1000000 v_main_~urilen~0_5))) InVars {main_~urilen~0=v_main_~urilen~0_5} OutVars{main_~urilen~0=v_main_~urilen~0_5} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} [197] L33-->L34: Formula: (and (<= v_main_~tokenlen~0_5 1000000) (<= 0 (+ v_main_~tokenlen~0_5 1000000))) InVars {main_~tokenlen~0=v_main_~tokenlen~0_5} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_5} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#true} [199] L34-->L35: Formula: (and (<= 0 (+ v_main_~scheme~0_5 1000000)) (<= v_main_~scheme~0_5 1000000)) InVars {main_~scheme~0=v_main_~scheme~0_5} OutVars{main_~scheme~0=v_main_~scheme~0_5} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#true} [200] L35-->L35-1: Formula: (< 0 v_main_~urilen~0_6) InVars {main_~urilen~0=v_main_~urilen~0_6} OutVars{main_~urilen~0=v_main_~urilen~0_6} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {790#true} [202] L35-1-->L36: Formula: (< 0 v_main_~tokenlen~0_6) InVars {main_~tokenlen~0=v_main_~tokenlen~0_6} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_6} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {790#true} [205] L36-->L37: Formula: (<= 0 v_main_~scheme~0_6) InVars {main_~scheme~0=v_main_~scheme~0_6} OutVars{main_~scheme~0=v_main_~scheme~0_6} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#true} [208] L37-->L42: Formula: (and (not (< v_main_~urilen~0_9 (+ v_main_~scheme~0_9 1))) (not (= v_main_~scheme~0_9 0)) (= v_main_~scheme~0_9 v_main_~cp~0_2)) InVars {main_~urilen~0=v_main_~urilen~0_9, main_~scheme~0=v_main_~scheme~0_9} OutVars{main_~urilen~0=v_main_~urilen~0_9, main_~cp~0=v_main_~cp~0_2, main_~scheme~0=v_main_~scheme~0_9} AuxVars[] AssignedVars[main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,391 INFO L272 TraceCheckUtils]: 13: Hoare triple {790#true} [209] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-27 21:34:44,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,392 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {790#true} {790#true} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,392 INFO L272 TraceCheckUtils]: 18: Hoare triple {790#true} [210] L42-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-27 21:34:44,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,392 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {790#true} {790#true} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {790#true} [212] L43-->L44: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {790#true} [215] L44-->L45: Formula: (not (= |v_main_#t~nondet4_3| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {790#true} is VALID [2022-04-27 21:34:44,393 INFO L272 TraceCheckUtils]: 25: Hoare triple {790#true} [220] L45-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-27 21:34:44,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,399 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {790#true} {790#true} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,399 INFO L272 TraceCheckUtils]: 30: Hoare triple {790#true} [221] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-27 21:34:44,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,399 INFO L290 TraceCheckUtils]: 33: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,399 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {790#true} {790#true} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {790#true} [223] L47-1-->L47-2: Formula: (= (+ (- 1) v_main_~urilen~0_12) v_main_~cp~0_7) InVars {main_~urilen~0=v_main_~urilen~0_12, main_~cp~0=v_main_~cp~0_7} OutVars{main_~urilen~0=v_main_~urilen~0_12, main_~cp~0=v_main_~cp~0_7} AuxVars[] AssignedVars[] {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-27 21:34:44,400 INFO L272 TraceCheckUtils]: 36: Hoare triple {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} [243] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-27 21:34:44,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,401 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {790#true} {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-27 21:34:44,401 INFO L272 TraceCheckUtils]: 41: Hoare triple {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} [227] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-27 21:34:44,402 INFO L290 TraceCheckUtils]: 42: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-27 21:34:44,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-27 21:34:44,404 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {790#true} {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-27 21:34:44,404 INFO L290 TraceCheckUtils]: 46: Hoare triple {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} [229] L54-->L56: Formula: (not (= v_main_~cp~0_16 (+ (- 1) v_main_~urilen~0_17))) InVars {main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} OutVars{main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} AuxVars[] AssignedVars[] {791#false} is VALID [2022-04-27 21:34:44,405 INFO L272 TraceCheckUtils]: 47: Hoare triple {791#false} [246] L56-->__VERIFIER_assertENTRY: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {791#false} is VALID [2022-04-27 21:34:44,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {791#false} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {791#false} is VALID [2022-04-27 21:34:44,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {791#false} [213] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {791#false} is VALID [2022-04-27 21:34:44,407 INFO L290 TraceCheckUtils]: 50: Hoare triple {791#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {791#false} is VALID [2022-04-27 21:34:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 21:34:44,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:44,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160472252] [2022-04-27 21:34:44,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160472252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:44,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:44,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:34:44,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742845131] [2022-04-27 21:34:44,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:44,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 51 [2022-04-27 21:34:44,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:44,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 21:34:44,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:44,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:34:44,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:44,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:34:44,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:34:44,432 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 21:34:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:44,687 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2022-04-27 21:34:44,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:34:44,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 51 [2022-04-27 21:34:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 21:34:44,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-27 21:34:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 21:34:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-27 21:34:44,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-27 21:34:44,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:44,777 INFO L225 Difference]: With dead ends: 90 [2022-04-27 21:34:44,777 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 21:34:44,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:34:44,779 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:44,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 58 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:34:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 21:34:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 21:34:44,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:44,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:44,808 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:44,808 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:44,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:44,811 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-27 21:34:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-27 21:34:44,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:44,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:44,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-27 21:34:44,813 INFO L87 Difference]: Start difference. First operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-27 21:34:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:44,816 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-27 21:34:44,816 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-27 21:34:44,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:44,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:44,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:44,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-04-27 21:34:44,819 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 51 [2022-04-27 21:34:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:44,819 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-04-27 21:34:44,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 21:34:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-27 21:34:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 21:34:44,820 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:44,820 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:44,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 21:34:44,820 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:34:44,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:44,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1328286090, now seen corresponding path program 1 times [2022-04-27 21:34:44,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:44,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356857727] [2022-04-27 21:34:44,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:44,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {1206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1173#true} is VALID [2022-04-27 21:34:44,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 21:34:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-27 21:34:44,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 21:34:44,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 21:34:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-27 21:34:44,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 21:34:44,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 21:34:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-27 21:34:44,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 21:34:44,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 21:34:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-27 21:34:44,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 21:34:44,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 21:34:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-27 21:34:44,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 21:34:44,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-27 21:34:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:44,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-27 21:34:44,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 21:34:44,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:44,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {1206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1173#true} is VALID [2022-04-27 21:34:44,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} [191] mainENTRY-->L32: Formula: (and (= |v_main_#t~nondet1_2| v_main_~urilen~0_1) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet2_2| v_main_~tokenlen~0_1) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~scheme~0_1 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_1, main_~urilen~0=v_main_~urilen~0_1, main_~scheme~0=v_main_~scheme~0_1, main_~c~0=v_main_~c~0_1, main_~cp~0=v_main_~cp~0_1} AuxVars[] AssignedVars[main_~tokenlen~0, main_~urilen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~scheme~0, main_~c~0, main_~cp~0] {1173#true} is VALID [2022-04-27 21:34:44,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {1173#true} [194] L32-->L33: Formula: (and (<= v_main_~urilen~0_5 1000000) (<= 0 (+ 1000000 v_main_~urilen~0_5))) InVars {main_~urilen~0=v_main_~urilen~0_5} OutVars{main_~urilen~0=v_main_~urilen~0_5} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} [197] L33-->L34: Formula: (and (<= v_main_~tokenlen~0_5 1000000) (<= 0 (+ v_main_~tokenlen~0_5 1000000))) InVars {main_~tokenlen~0=v_main_~tokenlen~0_5} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_5} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {1173#true} [199] L34-->L35: Formula: (and (<= 0 (+ v_main_~scheme~0_5 1000000)) (<= v_main_~scheme~0_5 1000000)) InVars {main_~scheme~0=v_main_~scheme~0_5} OutVars{main_~scheme~0=v_main_~scheme~0_5} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {1173#true} [200] L35-->L35-1: Formula: (< 0 v_main_~urilen~0_6) InVars {main_~urilen~0=v_main_~urilen~0_6} OutVars{main_~urilen~0=v_main_~urilen~0_6} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {1173#true} [202] L35-1-->L36: Formula: (< 0 v_main_~tokenlen~0_6) InVars {main_~tokenlen~0=v_main_~tokenlen~0_6} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_6} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {1173#true} [205] L36-->L37: Formula: (<= 0 v_main_~scheme~0_6) InVars {main_~scheme~0=v_main_~scheme~0_6} OutVars{main_~scheme~0=v_main_~scheme~0_6} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {1173#true} [208] L37-->L42: Formula: (and (not (< v_main_~urilen~0_9 (+ v_main_~scheme~0_9 1))) (not (= v_main_~scheme~0_9 0)) (= v_main_~scheme~0_9 v_main_~cp~0_2)) InVars {main_~urilen~0=v_main_~urilen~0_9, main_~scheme~0=v_main_~scheme~0_9} OutVars{main_~urilen~0=v_main_~urilen~0_9, main_~cp~0=v_main_~cp~0_2, main_~scheme~0=v_main_~scheme~0_9} AuxVars[] AssignedVars[main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 21:34:44,927 INFO L272 TraceCheckUtils]: 13: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} [209] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1173#true} is VALID [2022-04-27 21:34:44,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-27 21:34:44,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,928 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 21:34:44,928 INFO L272 TraceCheckUtils]: 18: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} [210] L42-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1173#true} is VALID [2022-04-27 21:34:44,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-27 21:34:44,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,929 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 21:34:44,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} [212] L43-->L44: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 21:34:44,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} [215] L44-->L45: Formula: (not (= |v_main_#t~nondet4_3| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 21:34:44,930 INFO L272 TraceCheckUtils]: 25: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} [220] L45-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1173#true} is VALID [2022-04-27 21:34:44,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-27 21:34:44,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,930 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 21:34:44,931 INFO L272 TraceCheckUtils]: 30: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} [221] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1173#true} is VALID [2022-04-27 21:34:44,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-27 21:34:44,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,931 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 21:34:44,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} [224] L47-1-->L48: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (not (= (+ (- 1) v_main_~urilen~0_13) v_main_~cp~0_8)) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~urilen~0=v_main_~urilen~0_13, main_~cp~0=v_main_~cp~0_8} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~urilen~0=v_main_~urilen~0_13, main_~cp~0=v_main_~cp~0_8} AuxVars[] AssignedVars[] {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 21:34:44,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [244] L48-->L47-2: Formula: (not (= |v_main_#t~nondet5_3| 0)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 21:34:44,932 INFO L272 TraceCheckUtils]: 37: Hoare triple {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [243] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1173#true} is VALID [2022-04-27 21:34:44,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-27 21:34:44,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,933 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1173#true} {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 21:34:44,933 INFO L272 TraceCheckUtils]: 42: Hoare triple {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [227] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1173#true} is VALID [2022-04-27 21:34:44,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-27 21:34:44,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-27 21:34:44,934 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1173#true} {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 21:34:44,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [229] L54-->L56: Formula: (not (= v_main_~cp~0_16 (+ (- 1) v_main_~urilen~0_17))) InVars {main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} OutVars{main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} AuxVars[] AssignedVars[] {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 21:34:44,935 INFO L272 TraceCheckUtils]: 48: Hoare triple {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [246] L56-->__VERIFIER_assertENTRY: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1204#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:34:44,935 INFO L290 TraceCheckUtils]: 49: Hoare triple {1204#(not (= |__VERIFIER_assert_#in~cond| 0))} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1205#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:34:44,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {1205#(not (= __VERIFIER_assert_~cond 0))} [213] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-27 21:34:44,936 INFO L290 TraceCheckUtils]: 51: Hoare triple {1174#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-27 21:34:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 21:34:44,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:44,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356857727] [2022-04-27 21:34:44,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356857727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:44,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:44,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:34:44,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342268231] [2022-04-27 21:34:44,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:44,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2022-04-27 21:34:44,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:44,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 21:34:44,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:44,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:34:44,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:44,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:34:44,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:44,978 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 21:34:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:45,511 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-04-27 21:34:45,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:34:45,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2022-04-27 21:34:45,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 21:34:45,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-27 21:34:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 21:34:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-27 21:34:45,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-04-27 21:34:45,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:45,581 INFO L225 Difference]: With dead ends: 68 [2022-04-27 21:34:45,581 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 21:34:45,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:34:45,582 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:45,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 59 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:34:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 21:34:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-04-27 21:34:45,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:45,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:45,623 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:45,623 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:45,625 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-27 21:34:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-27 21:34:45,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:45,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:45,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 66 states. [2022-04-27 21:34:45,626 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 66 states. [2022-04-27 21:34:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:45,628 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-27 21:34:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-27 21:34:45,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:45,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:45,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:45,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-04-27 21:34:45,631 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 52 [2022-04-27 21:34:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:45,631 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-04-27 21:34:45,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 21:34:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-27 21:34:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-27 21:34:45,632 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:45,633 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:45,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 21:34:45,633 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:34:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1785526948, now seen corresponding path program 1 times [2022-04-27 21:34:45,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:45,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521811607] [2022-04-27 21:34:45,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:45,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:45,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:45,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {1605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1548#true} is VALID [2022-04-27 21:34:45,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,711 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1548#true} {1548#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 21:34:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:45,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 21:34:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:45,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 21:34:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:45,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 21:34:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:45,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 21:34:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:45,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-27 21:34:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:45,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 21:34:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:45,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [265] __VERIFIER_assertEXIT-->L56-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-27 21:34:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:45,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [266] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 (+ v_main_~cp~0_41 1)) 1 0)) InVars {main_~cp~0=v_main_~cp~0_41} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-27 21:34:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:45,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [267] __VERIFIER_assertEXIT-->L63-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_42 v_main_~urilen~0_31) 1 0) |v___VERIFIER_assert_#in~condInParam_11|) InVars {main_~urilen~0=v_main_~urilen~0_31, main_~cp~0=v_main_~cp~0_42} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_11|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-27 21:34:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:45,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [268] __VERIFIER_assertEXIT-->L65-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_12| (ite (<= 0 v_main_~cp~0_43) 1 0)) InVars {main_~cp~0=v_main_~cp~0_43} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_12|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-27 21:34:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:45,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [269] __VERIFIER_assertEXIT-->L67-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_44 v_main_~urilen~0_32) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~urilen~0=v_main_~urilen~0_32, main_~cp~0=v_main_~cp~0_44} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 21:34:45,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-27 21:34:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:45,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [270] __VERIFIER_assertEXIT-->L68: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~cp~0_45) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~cp~0=v_main_~cp~0_45} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 21:34:45,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {1548#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:45,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {1605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1548#true} is VALID [2022-04-27 21:34:45,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {1548#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {1548#true} [191] mainENTRY-->L32: Formula: (and (= |v_main_#t~nondet1_2| v_main_~urilen~0_1) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet2_2| v_main_~tokenlen~0_1) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~scheme~0_1 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_1, main_~urilen~0=v_main_~urilen~0_1, main_~scheme~0=v_main_~scheme~0_1, main_~c~0=v_main_~c~0_1, main_~cp~0=v_main_~cp~0_1} AuxVars[] AssignedVars[main_~tokenlen~0, main_~urilen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~scheme~0, main_~c~0, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {1548#true} [194] L32-->L33: Formula: (and (<= v_main_~urilen~0_5 1000000) (<= 0 (+ 1000000 v_main_~urilen~0_5))) InVars {main_~urilen~0=v_main_~urilen~0_5} OutVars{main_~urilen~0=v_main_~urilen~0_5} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {1548#true} [197] L33-->L34: Formula: (and (<= v_main_~tokenlen~0_5 1000000) (<= 0 (+ v_main_~tokenlen~0_5 1000000))) InVars {main_~tokenlen~0=v_main_~tokenlen~0_5} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_5} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {1548#true} [199] L34-->L35: Formula: (and (<= 0 (+ v_main_~scheme~0_5 1000000)) (<= v_main_~scheme~0_5 1000000)) InVars {main_~scheme~0=v_main_~scheme~0_5} OutVars{main_~scheme~0=v_main_~scheme~0_5} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {1548#true} [200] L35-->L35-1: Formula: (< 0 v_main_~urilen~0_6) InVars {main_~urilen~0=v_main_~urilen~0_6} OutVars{main_~urilen~0=v_main_~urilen~0_6} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {1548#true} [202] L35-1-->L36: Formula: (< 0 v_main_~tokenlen~0_6) InVars {main_~tokenlen~0=v_main_~tokenlen~0_6} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_6} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {1548#true} [205] L36-->L37: Formula: (<= 0 v_main_~scheme~0_6) InVars {main_~scheme~0=v_main_~scheme~0_6} OutVars{main_~scheme~0=v_main_~scheme~0_6} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {1548#true} [208] L37-->L42: Formula: (and (not (< v_main_~urilen~0_9 (+ v_main_~scheme~0_9 1))) (not (= v_main_~scheme~0_9 0)) (= v_main_~scheme~0_9 v_main_~cp~0_2)) InVars {main_~urilen~0=v_main_~urilen~0_9, main_~scheme~0=v_main_~scheme~0_9} OutVars{main_~urilen~0=v_main_~urilen~0_9, main_~cp~0=v_main_~cp~0_2, main_~scheme~0=v_main_~scheme~0_9} AuxVars[] AssignedVars[main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,749 INFO L272 TraceCheckUtils]: 13: Hoare triple {1548#true} [209] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,749 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1548#true} {1548#true} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,749 INFO L272 TraceCheckUtils]: 18: Hoare triple {1548#true} [210] L42-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,749 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1548#true} {1548#true} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {1548#true} [212] L43-->L44: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {1548#true} [215] L44-->L45: Formula: (not (= |v_main_#t~nondet4_3| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {1548#true} is VALID [2022-04-27 21:34:45,750 INFO L272 TraceCheckUtils]: 25: Hoare triple {1548#true} [220] L45-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,750 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1548#true} {1548#true} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,750 INFO L272 TraceCheckUtils]: 30: Hoare triple {1548#true} [221] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,751 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1548#true} {1548#true} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {1548#true} [224] L47-1-->L48: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (not (= (+ (- 1) v_main_~urilen~0_13) v_main_~cp~0_8)) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~urilen~0=v_main_~urilen~0_13, main_~cp~0=v_main_~cp~0_8} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~urilen~0=v_main_~urilen~0_13, main_~cp~0=v_main_~cp~0_8} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {1548#true} [244] L48-->L47-2: Formula: (not (= |v_main_#t~nondet5_3| 0)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {1548#true} is VALID [2022-04-27 21:34:45,751 INFO L272 TraceCheckUtils]: 37: Hoare triple {1548#true} [243] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,751 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1548#true} {1548#true} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,751 INFO L272 TraceCheckUtils]: 42: Hoare triple {1548#true} [227] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,751 INFO L290 TraceCheckUtils]: 43: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,752 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1548#true} {1548#true} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,752 INFO L290 TraceCheckUtils]: 47: Hoare triple {1548#true} [229] L54-->L56: Formula: (not (= v_main_~cp~0_16 (+ (- 1) v_main_~urilen~0_17))) InVars {main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} OutVars{main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,752 INFO L272 TraceCheckUtils]: 48: Hoare triple {1548#true} [246] L56-->__VERIFIER_assertENTRY: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,752 INFO L290 TraceCheckUtils]: 49: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,752 INFO L290 TraceCheckUtils]: 50: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,752 INFO L290 TraceCheckUtils]: 51: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,752 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1548#true} {1548#true} [265] __VERIFIER_assertEXIT-->L56-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,752 INFO L272 TraceCheckUtils]: 53: Hoare triple {1548#true} [230] L56-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 (+ v_main_~cp~0_41 1)) 1 0)) InVars {main_~cp~0=v_main_~cp~0_41} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,752 INFO L290 TraceCheckUtils]: 54: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,753 INFO L290 TraceCheckUtils]: 55: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,753 INFO L290 TraceCheckUtils]: 56: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,753 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {1548#true} {1548#true} [266] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 (+ v_main_~cp~0_41 1)) 1 0)) InVars {main_~cp~0=v_main_~cp~0_41} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,753 INFO L290 TraceCheckUtils]: 58: Hoare triple {1548#true} [232] L57-->L61: Formula: (let ((.cse0 (+ v_main_~cp~0_21 1))) (and (<= 0 (+ |v_main_#t~nondet8_1| 2147483648)) (= v_main_~cp~0_20 .cse0) (not (= (+ (- 1) v_main_~urilen~0_20) .cse0)) (<= |v_main_#t~nondet8_1| 2147483647) (= v_main_~scheme~0_10 v_main_~cp~0_20))) InVars {main_~urilen~0=v_main_~urilen~0_20, main_~cp~0=v_main_~cp~0_21, main_#t~nondet8=|v_main_#t~nondet8_1|} OutVars{main_~urilen~0=v_main_~urilen~0_20, main_#t~pre7=|v_main_#t~pre7_1|, main_~scheme~0=v_main_~scheme~0_10, main_~cp~0=v_main_~cp~0_20, main_#t~nondet8=|v_main_#t~nondet8_1|} AuxVars[] AssignedVars[main_#t~pre7, main_~scheme~0, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,753 INFO L290 TraceCheckUtils]: 59: Hoare triple {1548#true} [247] L61-->L63: Formula: (and (= v_main_~c~0_2 0) (not (= |v_main_#t~nondet8_3| 0))) InVars {main_#t~nondet8=|v_main_#t~nondet8_3|} OutVars{main_~c~0=v_main_~c~0_2} AuxVars[] AssignedVars[main_~c~0, main_#t~nondet8] {1548#true} is VALID [2022-04-27 21:34:45,753 INFO L272 TraceCheckUtils]: 60: Hoare triple {1548#true} [253] L63-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_42 v_main_~urilen~0_31) 1 0) |v___VERIFIER_assert_#in~condInParam_11|) InVars {main_~urilen~0=v_main_~urilen~0_31, main_~cp~0=v_main_~cp~0_42} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_11|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,753 INFO L290 TraceCheckUtils]: 62: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,753 INFO L290 TraceCheckUtils]: 63: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,753 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {1548#true} {1548#true} [267] __VERIFIER_assertEXIT-->L63-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_42 v_main_~urilen~0_31) 1 0) |v___VERIFIER_assert_#in~condInParam_11|) InVars {main_~urilen~0=v_main_~urilen~0_31, main_~cp~0=v_main_~cp~0_42} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_11|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,754 INFO L272 TraceCheckUtils]: 65: Hoare triple {1548#true} [233] L63-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_12| (ite (<= 0 v_main_~cp~0_43) 1 0)) InVars {main_~cp~0=v_main_~cp~0_43} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_12|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,754 INFO L290 TraceCheckUtils]: 66: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,754 INFO L290 TraceCheckUtils]: 67: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,754 INFO L290 TraceCheckUtils]: 68: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,754 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1548#true} {1548#true} [268] __VERIFIER_assertEXIT-->L65-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_12| (ite (<= 0 v_main_~cp~0_43) 1 0)) InVars {main_~cp~0=v_main_~cp~0_43} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_12|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,755 INFO L290 TraceCheckUtils]: 70: Hoare triple {1548#true} [236] L65-1-->L67: Formula: (and (< (+ v_main_~c~0_4 1) v_main_~tokenlen~0_9) (not (= v_main_~cp~0_25 (+ (- 1) v_main_~urilen~0_23)))) InVars {main_~urilen~0=v_main_~urilen~0_23, main_~tokenlen~0=v_main_~tokenlen~0_9, main_~cp~0=v_main_~cp~0_25, main_~c~0=v_main_~c~0_4} OutVars{main_~urilen~0=v_main_~urilen~0_23, main_~tokenlen~0=v_main_~tokenlen~0_9, main_~cp~0=v_main_~cp~0_25, main_~c~0=v_main_~c~0_4} AuxVars[] AssignedVars[] {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 21:34:45,755 INFO L272 TraceCheckUtils]: 71: Hoare triple {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [249] L67-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_44 v_main_~urilen~0_32) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~urilen~0=v_main_~urilen~0_32, main_~cp~0=v_main_~cp~0_44} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,755 INFO L290 TraceCheckUtils]: 72: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,755 INFO L290 TraceCheckUtils]: 73: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,755 INFO L290 TraceCheckUtils]: 74: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,756 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {1548#true} {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [269] __VERIFIER_assertEXIT-->L67-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_44 v_main_~urilen~0_32) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~urilen~0=v_main_~urilen~0_32, main_~cp~0=v_main_~cp~0_44} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 21:34:45,756 INFO L272 TraceCheckUtils]: 76: Hoare triple {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [237] L67-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~cp~0_45) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~cp~0=v_main_~cp~0_45} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-27 21:34:45,756 INFO L290 TraceCheckUtils]: 77: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-27 21:34:45,756 INFO L290 TraceCheckUtils]: 78: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,756 INFO L290 TraceCheckUtils]: 79: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-27 21:34:45,756 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {1548#true} {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [270] __VERIFIER_assertEXIT-->L68: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~cp~0_45) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~cp~0=v_main_~cp~0_45} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 21:34:45,757 INFO L290 TraceCheckUtils]: 81: Hoare triple {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [238] L68-->L69: Formula: (and (<= |v_main_#t~nondet9_1| 2147483647) (<= 0 (+ |v_main_#t~nondet9_1| 2147483648))) InVars {main_#t~nondet9=|v_main_#t~nondet9_1|} OutVars{main_#t~nondet9=|v_main_#t~nondet9_1|} AuxVars[] AssignedVars[] {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 21:34:45,757 INFO L290 TraceCheckUtils]: 82: Hoare triple {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [250] L69-->L71: Formula: (and (not (= |v_main_#t~nondet9_3| 0)) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_#t~nondet9=|v_main_#t~nondet9_3|, main_~c~0=v_main_~c~0_6} OutVars{main_#t~pre10=|v_main_#t~pre10_1|, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[main_#t~pre10, main_~c~0, main_#t~nondet9] {1602#(<= (+ main_~c~0 1) main_~tokenlen~0)} is VALID [2022-04-27 21:34:45,758 INFO L272 TraceCheckUtils]: 83: Hoare triple {1602#(<= (+ main_~c~0 1) main_~tokenlen~0)} [254] L71-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_15| (ite (< v_main_~c~0_9 v_main_~tokenlen~0_11) 1 0)) InVars {main_~tokenlen~0=v_main_~tokenlen~0_11, main_~c~0=v_main_~c~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[main_~tokenlen~0, __VERIFIER_assert_#in~cond, main_~c~0] {1603#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:34:45,758 INFO L290 TraceCheckUtils]: 84: Hoare triple {1603#(not (= |__VERIFIER_assert_#in~cond| 0))} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1604#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:34:45,758 INFO L290 TraceCheckUtils]: 85: Hoare triple {1604#(not (= __VERIFIER_assert_~cond 0))} [213] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1549#false} is VALID [2022-04-27 21:34:45,759 INFO L290 TraceCheckUtils]: 86: Hoare triple {1549#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1549#false} is VALID [2022-04-27 21:34:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-27 21:34:45,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:45,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521811607] [2022-04-27 21:34:45,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521811607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:45,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:45,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:34:45,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968622501] [2022-04-27 21:34:45,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:45,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-27 21:34:45,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:45,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-27 21:34:45,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:45,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:34:45,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:45,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:34:45,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:45,795 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-27 21:34:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:46,364 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2022-04-27 21:34:46,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:34:46,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-27 21:34:46,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-27 21:34:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-04-27 21:34:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-27 21:34:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-04-27 21:34:46,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 76 transitions. [2022-04-27 21:34:46,445 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-27 21:34:46,448 INFO L225 Difference]: With dead ends: 74 [2022-04-27 21:34:46,448 INFO L226 Difference]: Without dead ends: 72 [2022-04-27 21:34:46,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:34:46,454 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:46,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 67 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:34:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-27 21:34:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-04-27 21:34:46,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:46,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:46,503 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:46,503 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:46,505 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2022-04-27 21:34:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-04-27 21:34:46,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:46,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:46,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 72 states. [2022-04-27 21:34:46,506 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 72 states. [2022-04-27 21:34:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:46,508 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2022-04-27 21:34:46,508 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-04-27 21:34:46,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:46,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:46,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:46,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 21:34:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2022-04-27 21:34:46,511 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 87 [2022-04-27 21:34:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:46,511 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2022-04-27 21:34:46,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-27 21:34:46,512 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-04-27 21:34:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-27 21:34:46,512 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:46,513 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:46,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 21:34:46,513 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:34:46,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:46,513 INFO L85 PathProgramCache]: Analyzing trace with hash 874819922, now seen corresponding path program 1 times [2022-04-27 21:34:46,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:46,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195753117] [2022-04-27 21:34:46,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:46,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:46,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:46,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {2032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1971#true} is VALID [2022-04-27 21:34:46,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,574 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1971#true} {1971#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 21:34:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:46,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 21:34:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:46,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 21:34:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:46,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 21:34:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:46,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 21:34:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:46,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-27 21:34:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:46,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 21:34:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:46,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [265] __VERIFIER_assertEXIT-->L56-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-27 21:34:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:46,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [266] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 (+ v_main_~cp~0_41 1)) 1 0)) InVars {main_~cp~0=v_main_~cp~0_41} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-27 21:34:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:46,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [267] __VERIFIER_assertEXIT-->L63-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_42 v_main_~urilen~0_31) 1 0) |v___VERIFIER_assert_#in~condInParam_11|) InVars {main_~urilen~0=v_main_~urilen~0_31, main_~cp~0=v_main_~cp~0_42} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_11|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-27 21:34:46,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-27 21:34:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:46,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [268] __VERIFIER_assertEXIT-->L65-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_12| (ite (<= 0 v_main_~cp~0_43) 1 0)) InVars {main_~cp~0=v_main_~cp~0_43} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_12|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-27 21:34:46,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-27 21:34:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:46,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [269] __VERIFIER_assertEXIT-->L67-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_44 v_main_~urilen~0_32) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~urilen~0=v_main_~urilen~0_32, main_~cp~0=v_main_~cp~0_44} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-27 21:34:46,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-27 21:34:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:46,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [270] __VERIFIER_assertEXIT-->L68: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~cp~0_45) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~cp~0=v_main_~cp~0_45} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-27 21:34:46,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-04-27 21:34:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:46,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {2025#(<= 1 main_~c~0)} [271] __VERIFIER_assertEXIT-->L71-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_15| (ite (< v_main_~c~0_9 v_main_~tokenlen~0_11) 1 0)) InVars {main_~tokenlen~0=v_main_~tokenlen~0_11, main_~c~0=v_main_~c~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[main_~tokenlen~0, __VERIFIER_assert_#in~cond, main_~c~0] {2025#(<= 1 main_~c~0)} is VALID [2022-04-27 21:34:46,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {1971#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:46,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {2032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1971#true} is VALID [2022-04-27 21:34:46,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {1971#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {1971#true} [191] mainENTRY-->L32: Formula: (and (= |v_main_#t~nondet1_2| v_main_~urilen~0_1) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet2_2| v_main_~tokenlen~0_1) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~scheme~0_1 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_1, main_~urilen~0=v_main_~urilen~0_1, main_~scheme~0=v_main_~scheme~0_1, main_~c~0=v_main_~c~0_1, main_~cp~0=v_main_~cp~0_1} AuxVars[] AssignedVars[main_~tokenlen~0, main_~urilen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~scheme~0, main_~c~0, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {1971#true} [194] L32-->L33: Formula: (and (<= v_main_~urilen~0_5 1000000) (<= 0 (+ 1000000 v_main_~urilen~0_5))) InVars {main_~urilen~0=v_main_~urilen~0_5} OutVars{main_~urilen~0=v_main_~urilen~0_5} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {1971#true} [197] L33-->L34: Formula: (and (<= v_main_~tokenlen~0_5 1000000) (<= 0 (+ v_main_~tokenlen~0_5 1000000))) InVars {main_~tokenlen~0=v_main_~tokenlen~0_5} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_5} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {1971#true} [199] L34-->L35: Formula: (and (<= 0 (+ v_main_~scheme~0_5 1000000)) (<= v_main_~scheme~0_5 1000000)) InVars {main_~scheme~0=v_main_~scheme~0_5} OutVars{main_~scheme~0=v_main_~scheme~0_5} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {1971#true} [200] L35-->L35-1: Formula: (< 0 v_main_~urilen~0_6) InVars {main_~urilen~0=v_main_~urilen~0_6} OutVars{main_~urilen~0=v_main_~urilen~0_6} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {1971#true} [202] L35-1-->L36: Formula: (< 0 v_main_~tokenlen~0_6) InVars {main_~tokenlen~0=v_main_~tokenlen~0_6} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_6} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {1971#true} [205] L36-->L37: Formula: (<= 0 v_main_~scheme~0_6) InVars {main_~scheme~0=v_main_~scheme~0_6} OutVars{main_~scheme~0=v_main_~scheme~0_6} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {1971#true} [208] L37-->L42: Formula: (and (not (< v_main_~urilen~0_9 (+ v_main_~scheme~0_9 1))) (not (= v_main_~scheme~0_9 0)) (= v_main_~scheme~0_9 v_main_~cp~0_2)) InVars {main_~urilen~0=v_main_~urilen~0_9, main_~scheme~0=v_main_~scheme~0_9} OutVars{main_~urilen~0=v_main_~urilen~0_9, main_~cp~0=v_main_~cp~0_2, main_~scheme~0=v_main_~scheme~0_9} AuxVars[] AssignedVars[main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,668 INFO L272 TraceCheckUtils]: 13: Hoare triple {1971#true} [209] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,668 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1971#true} {1971#true} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,668 INFO L272 TraceCheckUtils]: 18: Hoare triple {1971#true} [210] L42-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,669 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1971#true} {1971#true} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {1971#true} [212] L43-->L44: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {1971#true} [215] L44-->L45: Formula: (not (= |v_main_#t~nondet4_3| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {1971#true} is VALID [2022-04-27 21:34:46,669 INFO L272 TraceCheckUtils]: 25: Hoare triple {1971#true} [220] L45-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,669 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1971#true} {1971#true} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,670 INFO L272 TraceCheckUtils]: 30: Hoare triple {1971#true} [221] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,670 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1971#true} {1971#true} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {1971#true} [224] L47-1-->L48: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (not (= (+ (- 1) v_main_~urilen~0_13) v_main_~cp~0_8)) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~urilen~0=v_main_~urilen~0_13, main_~cp~0=v_main_~cp~0_8} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~urilen~0=v_main_~urilen~0_13, main_~cp~0=v_main_~cp~0_8} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {1971#true} [244] L48-->L47-2: Formula: (not (= |v_main_#t~nondet5_3| 0)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {1971#true} is VALID [2022-04-27 21:34:46,670 INFO L272 TraceCheckUtils]: 37: Hoare triple {1971#true} [243] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,671 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1971#true} {1971#true} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,671 INFO L272 TraceCheckUtils]: 42: Hoare triple {1971#true} [227] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,671 INFO L290 TraceCheckUtils]: 44: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,671 INFO L290 TraceCheckUtils]: 45: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,671 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1971#true} {1971#true} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,671 INFO L290 TraceCheckUtils]: 47: Hoare triple {1971#true} [229] L54-->L56: Formula: (not (= v_main_~cp~0_16 (+ (- 1) v_main_~urilen~0_17))) InVars {main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} OutVars{main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,671 INFO L272 TraceCheckUtils]: 48: Hoare triple {1971#true} [246] L56-->__VERIFIER_assertENTRY: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,671 INFO L290 TraceCheckUtils]: 49: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,672 INFO L290 TraceCheckUtils]: 50: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,672 INFO L290 TraceCheckUtils]: 51: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,672 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1971#true} {1971#true} [265] __VERIFIER_assertEXIT-->L56-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,672 INFO L272 TraceCheckUtils]: 53: Hoare triple {1971#true} [230] L56-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 (+ v_main_~cp~0_41 1)) 1 0)) InVars {main_~cp~0=v_main_~cp~0_41} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,672 INFO L290 TraceCheckUtils]: 54: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,672 INFO L290 TraceCheckUtils]: 55: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,672 INFO L290 TraceCheckUtils]: 56: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,672 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {1971#true} {1971#true} [266] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 (+ v_main_~cp~0_41 1)) 1 0)) InVars {main_~cp~0=v_main_~cp~0_41} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,672 INFO L290 TraceCheckUtils]: 58: Hoare triple {1971#true} [232] L57-->L61: Formula: (let ((.cse0 (+ v_main_~cp~0_21 1))) (and (<= 0 (+ |v_main_#t~nondet8_1| 2147483648)) (= v_main_~cp~0_20 .cse0) (not (= (+ (- 1) v_main_~urilen~0_20) .cse0)) (<= |v_main_#t~nondet8_1| 2147483647) (= v_main_~scheme~0_10 v_main_~cp~0_20))) InVars {main_~urilen~0=v_main_~urilen~0_20, main_~cp~0=v_main_~cp~0_21, main_#t~nondet8=|v_main_#t~nondet8_1|} OutVars{main_~urilen~0=v_main_~urilen~0_20, main_#t~pre7=|v_main_#t~pre7_1|, main_~scheme~0=v_main_~scheme~0_10, main_~cp~0=v_main_~cp~0_20, main_#t~nondet8=|v_main_#t~nondet8_1|} AuxVars[] AssignedVars[main_#t~pre7, main_~scheme~0, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,675 INFO L290 TraceCheckUtils]: 59: Hoare triple {1971#true} [247] L61-->L63: Formula: (and (= v_main_~c~0_2 0) (not (= |v_main_#t~nondet8_3| 0))) InVars {main_#t~nondet8=|v_main_#t~nondet8_3|} OutVars{main_~c~0=v_main_~c~0_2} AuxVars[] AssignedVars[main_~c~0, main_#t~nondet8] {2008#(= main_~c~0 0)} is VALID [2022-04-27 21:34:46,675 INFO L272 TraceCheckUtils]: 60: Hoare triple {2008#(= main_~c~0 0)} [253] L63-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_42 v_main_~urilen~0_31) 1 0) |v___VERIFIER_assert_#in~condInParam_11|) InVars {main_~urilen~0=v_main_~urilen~0_31, main_~cp~0=v_main_~cp~0_42} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_11|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,675 INFO L290 TraceCheckUtils]: 61: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,675 INFO L290 TraceCheckUtils]: 62: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,675 INFO L290 TraceCheckUtils]: 63: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,676 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [267] __VERIFIER_assertEXIT-->L63-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_42 v_main_~urilen~0_31) 1 0) |v___VERIFIER_assert_#in~condInParam_11|) InVars {main_~urilen~0=v_main_~urilen~0_31, main_~cp~0=v_main_~cp~0_42} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_11|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-27 21:34:46,676 INFO L272 TraceCheckUtils]: 65: Hoare triple {2008#(= main_~c~0 0)} [233] L63-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_12| (ite (<= 0 v_main_~cp~0_43) 1 0)) InVars {main_~cp~0=v_main_~cp~0_43} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_12|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,676 INFO L290 TraceCheckUtils]: 66: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,676 INFO L290 TraceCheckUtils]: 67: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,676 INFO L290 TraceCheckUtils]: 68: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,677 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [268] __VERIFIER_assertEXIT-->L65-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_12| (ite (<= 0 v_main_~cp~0_43) 1 0)) InVars {main_~cp~0=v_main_~cp~0_43} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_12|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-27 21:34:46,678 INFO L290 TraceCheckUtils]: 70: Hoare triple {2008#(= main_~c~0 0)} [236] L65-1-->L67: Formula: (and (< (+ v_main_~c~0_4 1) v_main_~tokenlen~0_9) (not (= v_main_~cp~0_25 (+ (- 1) v_main_~urilen~0_23)))) InVars {main_~urilen~0=v_main_~urilen~0_23, main_~tokenlen~0=v_main_~tokenlen~0_9, main_~cp~0=v_main_~cp~0_25, main_~c~0=v_main_~c~0_4} OutVars{main_~urilen~0=v_main_~urilen~0_23, main_~tokenlen~0=v_main_~tokenlen~0_9, main_~cp~0=v_main_~cp~0_25, main_~c~0=v_main_~c~0_4} AuxVars[] AssignedVars[] {2008#(= main_~c~0 0)} is VALID [2022-04-27 21:34:46,678 INFO L272 TraceCheckUtils]: 71: Hoare triple {2008#(= main_~c~0 0)} [249] L67-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_44 v_main_~urilen~0_32) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~urilen~0=v_main_~urilen~0_32, main_~cp~0=v_main_~cp~0_44} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,678 INFO L290 TraceCheckUtils]: 72: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,678 INFO L290 TraceCheckUtils]: 73: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,678 INFO L290 TraceCheckUtils]: 74: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,680 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [269] __VERIFIER_assertEXIT-->L67-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_44 v_main_~urilen~0_32) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~urilen~0=v_main_~urilen~0_32, main_~cp~0=v_main_~cp~0_44} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-27 21:34:46,680 INFO L272 TraceCheckUtils]: 76: Hoare triple {2008#(= main_~c~0 0)} [237] L67-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~cp~0_45) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~cp~0=v_main_~cp~0_45} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-27 21:34:46,680 INFO L290 TraceCheckUtils]: 77: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,680 INFO L290 TraceCheckUtils]: 78: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,680 INFO L290 TraceCheckUtils]: 79: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,681 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [270] __VERIFIER_assertEXIT-->L68: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~cp~0_45) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~cp~0=v_main_~cp~0_45} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-27 21:34:46,681 INFO L290 TraceCheckUtils]: 81: Hoare triple {2008#(= main_~c~0 0)} [238] L68-->L69: Formula: (and (<= |v_main_#t~nondet9_1| 2147483647) (<= 0 (+ |v_main_#t~nondet9_1| 2147483648))) InVars {main_#t~nondet9=|v_main_#t~nondet9_1|} OutVars{main_#t~nondet9=|v_main_#t~nondet9_1|} AuxVars[] AssignedVars[] {2008#(= main_~c~0 0)} is VALID [2022-04-27 21:34:46,681 INFO L290 TraceCheckUtils]: 82: Hoare triple {2008#(= main_~c~0 0)} [250] L69-->L71: Formula: (and (not (= |v_main_#t~nondet9_3| 0)) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_#t~nondet9=|v_main_#t~nondet9_3|, main_~c~0=v_main_~c~0_6} OutVars{main_#t~pre10=|v_main_#t~pre10_1|, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[main_#t~pre10, main_~c~0, main_#t~nondet9] {2025#(<= 1 main_~c~0)} is VALID [2022-04-27 21:34:46,681 INFO L272 TraceCheckUtils]: 83: Hoare triple {2025#(<= 1 main_~c~0)} [254] L71-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_15| (ite (< v_main_~c~0_9 v_main_~tokenlen~0_11) 1 0)) InVars {main_~tokenlen~0=v_main_~tokenlen~0_11, main_~c~0=v_main_~c~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[main_~tokenlen~0, __VERIFIER_assert_#in~cond, main_~c~0] {1971#true} is VALID [2022-04-27 21:34:46,681 INFO L290 TraceCheckUtils]: 84: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-27 21:34:46,681 INFO L290 TraceCheckUtils]: 85: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,681 INFO L290 TraceCheckUtils]: 86: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-27 21:34:46,682 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {1971#true} {2025#(<= 1 main_~c~0)} [271] __VERIFIER_assertEXIT-->L71-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_15| (ite (< v_main_~c~0_9 v_main_~tokenlen~0_11) 1 0)) InVars {main_~tokenlen~0=v_main_~tokenlen~0_11, main_~c~0=v_main_~c~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[main_~tokenlen~0, __VERIFIER_assert_#in~cond, main_~c~0] {2025#(<= 1 main_~c~0)} is VALID [2022-04-27 21:34:46,683 INFO L272 TraceCheckUtils]: 88: Hoare triple {2025#(<= 1 main_~c~0)} [239] L71-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~c~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_16|) InVars {main_~c~0=v_main_~c~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_16|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {2030#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:34:46,683 INFO L290 TraceCheckUtils]: 89: Hoare triple {2030#(not (= |__VERIFIER_assert_#in~cond| 0))} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2031#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:34:46,683 INFO L290 TraceCheckUtils]: 90: Hoare triple {2031#(not (= __VERIFIER_assert_~cond 0))} [213] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1972#false} is VALID [2022-04-27 21:34:46,683 INFO L290 TraceCheckUtils]: 91: Hoare triple {1972#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1972#false} is VALID [2022-04-27 21:34:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 21:34:46,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:46,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195753117] [2022-04-27 21:34:46,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195753117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:46,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:46,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:34:46,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477610678] [2022-04-27 21:34:46,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:46,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 92 [2022-04-27 21:34:46,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:46,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-27 21:34:46,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:46,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:34:46,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:46,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:34:46,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:46,724 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-27 21:34:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:47,319 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2022-04-27 21:34:47,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:34:47,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 92 [2022-04-27 21:34:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-27 21:34:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-27 21:34:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-27 21:34:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-27 21:34:47,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2022-04-27 21:34:47,388 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-27 21:34:47,389 INFO L225 Difference]: With dead ends: 75 [2022-04-27 21:34:47,389 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:34:47,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:34:47,390 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:47,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 74 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 21:34:47,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:34:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:34:47,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:47,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:34:47,391 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:34:47,391 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:34:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:47,391 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:34:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:34:47,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:47,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:47,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:34:47,391 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:34:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:47,391 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:34:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:34:47,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:47,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:47,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:47,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:34:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:34:47,392 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2022-04-27 21:34:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:47,392 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:34:47,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-27 21:34:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:34:47,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:47,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:34:47,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 21:34:47,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:34:47,685 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:34:47,685 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:34:47,685 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:34:47,685 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:34:47,685 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:34:47,685 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:34:47,685 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:34:47,685 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 83) the Hoare annotation is: true [2022-04-27 21:34:47,685 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-04-27 21:34:47,686 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 83) no Hoare annotation was computed. [2022-04-27 21:34:47,686 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-27 21:34:47,686 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 83) no Hoare annotation was computed. [2022-04-27 21:34:47,686 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-04-27 21:34:47,686 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-27 21:34:47,686 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2022-04-27 21:34:47,686 INFO L902 garLoopResultBuilder]: At program point L81(lines 25 83) the Hoare annotation is: true [2022-04-27 21:34:47,686 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2022-04-27 21:34:47,686 INFO L899 garLoopResultBuilder]: For program point L37(lines 25 83) no Hoare annotation was computed. [2022-04-27 21:34:47,686 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,686 INFO L895 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,686 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-04-27 21:34:47,686 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2022-04-27 21:34:47,686 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,687 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,687 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 46 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,687 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,687 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-04-27 21:34:47,687 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,687 INFO L899 garLoopResultBuilder]: For program point L54(lines 44 80) no Hoare annotation was computed. [2022-04-27 21:34:47,687 INFO L895 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,687 INFO L899 garLoopResultBuilder]: For program point L57(lines 44 80) no Hoare annotation was computed. [2022-04-27 21:34:47,687 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (= main_~c~0 0) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,687 INFO L895 garLoopResultBuilder]: At program point L65-1(lines 64 77) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (<= 1 main_~cp~0))) (or (and .cse0 .cse1 (= main_~c~0 0) .cse2) (and .cse0 (<= 1 main_~c~0) .cse1 .cse2))) [2022-04-27 21:34:47,687 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-04-27 21:34:47,687 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-04-27 21:34:47,688 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,688 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,688 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,688 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2022-04-27 21:34:47,688 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 47 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,688 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-04-27 21:34:47,688 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,688 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2022-04-27 21:34:47,688 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-04-27 21:34:47,688 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-04-27 21:34:47,688 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,688 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (= main_~c~0 0) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,689 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-27 21:34:47,689 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 21:34:47,689 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 21:34:47,689 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 21:34:47,689 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:34:47,689 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 21:34:47,689 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:34:47,691 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-27 21:34:47,692 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:34:47,695 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,696 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 21:34:47,697 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 21:34:47,699 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 21:34:47,700 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 21:34:47,700 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-27 21:34:47,700 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-27 21:34:47,700 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-27 21:34:47,700 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-27 21:34:47,701 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-27 21:34:47,701 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-27 21:34:47,701 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 21:34:47,702 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 21:34:47,702 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:34:47,702 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 21:34:47,702 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 21:34:47,702 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 21:34:47,702 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 21:34:47,702 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-27 21:34:47,702 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-27 21:34:47,702 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-04-27 21:34:47,702 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-04-27 21:34:47,702 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 21:34:47,702 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 21:34:47,702 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 21:34:47,702 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 21:34:47,702 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:34:47,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:34:47 BasicIcfg [2022-04-27 21:34:47,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:34:47,711 INFO L158 Benchmark]: Toolchain (without parser) took 6218.80ms. Allocated memory was 210.8MB in the beginning and 308.3MB in the end (delta: 97.5MB). Free memory was 153.4MB in the beginning and 115.2MB in the end (delta: 38.2MB). Peak memory consumption was 136.6MB. Max. memory is 8.0GB. [2022-04-27 21:34:47,711 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 210.8MB. Free memory was 169.6MB in the beginning and 169.6MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:34:47,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.81ms. Allocated memory was 210.8MB in the beginning and 256.9MB in the end (delta: 46.1MB). Free memory was 153.1MB in the beginning and 225.4MB in the end (delta: -72.3MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-04-27 21:34:47,712 INFO L158 Benchmark]: Boogie Preprocessor took 38.36ms. Allocated memory is still 256.9MB. Free memory was 225.4MB in the beginning and 224.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:34:47,712 INFO L158 Benchmark]: RCFGBuilder took 294.45ms. Allocated memory is still 256.9MB. Free memory was 223.7MB in the beginning and 206.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-27 21:34:47,712 INFO L158 Benchmark]: IcfgTransformer took 57.25ms. Allocated memory is still 256.9MB. Free memory was 206.9MB in the beginning and 203.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 21:34:47,712 INFO L158 Benchmark]: TraceAbstraction took 5631.03ms. Allocated memory was 256.9MB in the beginning and 308.3MB in the end (delta: 51.4MB). Free memory was 203.4MB in the beginning and 115.2MB in the end (delta: 88.3MB). Peak memory consumption was 140.0MB. Max. memory is 8.0GB. [2022-04-27 21:34:47,713 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 210.8MB. Free memory was 169.6MB in the beginning and 169.6MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.81ms. Allocated memory was 210.8MB in the beginning and 256.9MB in the end (delta: 46.1MB). Free memory was 153.1MB in the beginning and 225.4MB in the end (delta: -72.3MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.36ms. Allocated memory is still 256.9MB. Free memory was 225.4MB in the beginning and 224.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 294.45ms. Allocated memory is still 256.9MB. Free memory was 223.7MB in the beginning and 206.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * IcfgTransformer took 57.25ms. Allocated memory is still 256.9MB. Free memory was 206.9MB in the beginning and 203.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5631.03ms. Allocated memory was 256.9MB in the beginning and 308.3MB in the end (delta: 51.4MB). Free memory was 203.4MB in the beginning and 115.2MB in the end (delta: 88.3MB). Peak memory consumption was 140.0MB. 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: 19]: 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 4 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 277 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 319 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1253 IncrementalHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 319 mSolverCounterUnsat, 300 mSDtfsCounter, 1253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=5, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 76 PreInvPairs, 105 NumberOfFragments, 461 HoareAnnotationTreeSize, 76 FomulaSimplifications, 29 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 26 FomulaSimplificationsInter, 287 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 511 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 772/772 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((0 < scheme + 1 && cp < urilen) && c == 0) && 1 <= cp) || (((0 < scheme + 1 && 1 <= c) && cp < urilen) && 1 <= cp) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (0 < scheme + 1 && cp + 1 <= urilen) && 1 <= cp RESULT: Ultimate proved your program to be correct! [2022-04-27 21:34:47,739 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...