/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-e106359-m [2022-04-15 00:32:56,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:32:56,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:32:56,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:32:56,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:32:56,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:32:56,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:32:56,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:32:56,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:32:56,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:32:56,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:32:56,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:32:56,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:32:56,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:32:56,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:32:56,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:32:56,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:32:56,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:32:56,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:32:56,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:32:56,818 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:32:56,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:32:56,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:32:56,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:32:56,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:32:56,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:32:56,823 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:32:56,823 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:32:56,824 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:32:56,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:32:56,825 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:32:56,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:32:56,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:32:56,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:32:56,827 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:32:56,828 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:32:56,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:32:56,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:32:56,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:32:56,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:32:56,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:32:56,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:32:56,835 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:32:56,863 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:32:56,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:32:56,865 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:32:56,865 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:32:56,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:32:56,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:32:56,866 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:32:56,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:32:56,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:32:56,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:32:56,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:32:56,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:32:56,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:32:56,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:32:56,867 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:32:56,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:32:56,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:32:56,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:32:56,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:32:56,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:32:56,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:32:56,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:32:56,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:32:56,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:32:56,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:32:56,869 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:32:56,869 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:32:56,869 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:32:56,870 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:32:56,870 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 00:32:57,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:32:57,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:32:57,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:32:57,100 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:32:57,101 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:32:57,102 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-15 00:32:57,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/624801310/5a678046085e48c98b5a6c5185375d20/FLAGf45ad165f [2022-04-15 00:32:57,518 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:32:57,519 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2022-04-15 00:32:57,524 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/624801310/5a678046085e48c98b5a6c5185375d20/FLAGf45ad165f [2022-04-15 00:32:57,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/624801310/5a678046085e48c98b5a6c5185375d20 [2022-04-15 00:32:57,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:32:57,538 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:32:57,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:32:57,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:32:57,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:32:57,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:57" (1/1) ... [2022-04-15 00:32:57,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22db5b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:57, skipping insertion in model container [2022-04-15 00:32:57,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:57" (1/1) ... [2022-04-15 00:32:57,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:32:57,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:32:57,701 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-15 00:32:57,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:32:57,736 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:32:57,745 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-15 00:32:57,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:32:57,766 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:32:57,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:57 WrapperNode [2022-04-15 00:32:57,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:32:57,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:32:57,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:32:57,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:32:57,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:57" (1/1) ... [2022-04-15 00:32:57,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:57" (1/1) ... [2022-04-15 00:32:57,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:57" (1/1) ... [2022-04-15 00:32:57,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:57" (1/1) ... [2022-04-15 00:32:57,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:57" (1/1) ... [2022-04-15 00:32:57,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:57" (1/1) ... [2022-04-15 00:32:57,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:57" (1/1) ... [2022-04-15 00:32:57,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:32:57,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:32:57,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:32:57,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:32:57,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:57" (1/1) ... [2022-04-15 00:32:57,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:32:57,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:32:57,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 00:32:57,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 00:32:57,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:32:57,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:32:57,866 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:32:57,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 00:32:57,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:32:57,866 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:32:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:32:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:32:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 00:32:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 00:32:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:32:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:32:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 00:32:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:32:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 00:32:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:32:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:32:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:32:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:32:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:32:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:32:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:32:57,930 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:32:57,931 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:32:58,267 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:32:58,274 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:32:58,274 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 00:32:58,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:58 BoogieIcfgContainer [2022-04-15 00:32:58,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:32:58,277 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:32:58,277 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:32:58,278 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:32:58,280 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:58" (1/1) ... [2022-04-15 00:32:58,282 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:32:58,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:32:58 BasicIcfg [2022-04-15 00:32:58,322 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:32:58,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:32:58,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:32:58,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:32:58,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:32:57" (1/4) ... [2022-04-15 00:32:58,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9349dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:58, skipping insertion in model container [2022-04-15 00:32:58,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:57" (2/4) ... [2022-04-15 00:32:58,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9349dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:58, skipping insertion in model container [2022-04-15 00:32:58,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:58" (3/4) ... [2022-04-15 00:32:58,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9349dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:32:58, skipping insertion in model container [2022-04-15 00:32:58,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:32:58" (4/4) ... [2022-04-15 00:32:58,329 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.iqvasr [2022-04-15 00:32:58,333 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:32:58,333 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:32:58,370 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:32:58,376 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 00:32:58,377 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:32:58,395 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-15 00:32:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 00:32:58,399 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:58,399 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:58,400 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:58,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:58,404 INFO L85 PathProgramCache]: Analyzing trace with hash -505878006, now seen corresponding path program 1 times [2022-04-15 00:32:58,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:58,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240948532] [2022-04-15 00:32:58,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:58,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:58,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:58,686 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-15 00:32:58,687 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-15 00:32:58,687 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-15 00:32:58,689 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-15 00:32:58,689 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-15 00:32:58,690 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-15 00:32:58,690 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-15 00:32:58,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {57#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-15 00:32:58,690 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-15 00:32:58,691 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-15 00:32:58,691 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-15 00:32:58,691 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-15 00:32:58,692 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-15 00:32:58,692 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-15 00:32:58,692 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-15 00:32:58,693 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-15 00:32:58,694 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-15 00:32:58,696 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-15 00:32:58,696 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-15 00:32:58,697 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-15 00:32:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:32:58,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:58,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240948532] [2022-04-15 00:32:58,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240948532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:58,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:58,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:58,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851564424] [2022-04-15 00:32:58,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:58,708 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-15 00:32:58,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:58,712 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-15 00:32:58,738 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-15 00:32:58,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:58,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:58,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:58,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:58,770 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-15 00:32:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:59,681 INFO L93 Difference]: Finished difference Result 112 states and 207 transitions. [2022-04-15 00:32:59,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:32:59,682 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-15 00:32:59,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:59,683 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-15 00:32:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2022-04-15 00:32:59,709 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-15 00:32:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2022-04-15 00:32:59,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 207 transitions. [2022-04-15 00:32:59,946 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-15 00:32:59,961 INFO L225 Difference]: With dead ends: 112 [2022-04-15 00:32:59,962 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 00:32:59,965 INFO L912 BasicCegarLoop]: 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-15 00:32:59,970 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 70 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:59,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 82 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 00:32:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 00:33:00,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2022-04-15 00:33:00,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:33:00,031 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-15 00:33:00,031 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-15 00:33:00,032 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-15 00:33:00,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:00,043 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-15 00:33:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-15 00:33:00,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:00,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:00,048 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-15 00:33:00,049 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-15 00:33:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:00,058 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-15 00:33:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-15 00:33:00,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:00,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:00,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:33:00,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:33:00,060 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-15 00:33:00,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2022-04-15 00:33:00,065 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 17 [2022-04-15 00:33:00,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:33:00,065 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2022-04-15 00:33:00,066 INFO L479 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-15 00:33:00,066 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2022-04-15 00:33:00,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 00:33:00,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:33:00,067 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:33:00,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:33:00,067 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:33:00,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:33:00,068 INFO L85 PathProgramCache]: Analyzing trace with hash 722598363, now seen corresponding path program 1 times [2022-04-15 00:33:00,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:33:00,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190451820] [2022-04-15 00:33:00,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:33:00,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:33:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:00,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:33:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:00,145 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-15 00:33:00,145 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-15 00:33:00,145 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-15 00:33:00,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 00:33:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:00,152 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-15 00:33:00,152 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-15 00:33:00,152 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-15 00:33:00,153 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-15 00:33:00,154 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-15 00:33:00,154 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-15 00:33:00,154 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-15 00:33:00,154 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-15 00:33:00,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:33:00,155 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-15 00:33:00,155 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-15 00:33:00,155 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-15 00:33:00,155 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-15 00:33:00,156 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-15 00:33:00,156 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-15 00:33:00,156 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-15 00:33:00,157 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-15 00:33:00,157 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-15 00:33:00,158 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-15 00:33:00,158 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-15 00:33:00,158 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-15 00:33:00,159 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-15 00:33:00,159 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-15 00:33:00,160 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-15 00:33:00,160 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-15 00:33:00,160 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-15 00:33:00,161 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-15 00:33:00,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:33:00,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190451820] [2022-04-15 00:33:00,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190451820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:33:00,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:33:00,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 00:33:00,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300690546] [2022-04-15 00:33:00,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:33:00,163 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-15 00:33:00,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:33:00,164 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-15 00:33:00,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:33:00,179 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:33:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:33:00,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:33:00,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:33:00,181 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-15 00:33:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:00,966 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2022-04-15 00:33:00,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:33:00,967 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-15 00:33:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:33:00,967 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-15 00:33:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-15 00:33:00,970 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-15 00:33:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-15 00:33:00,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-04-15 00:33:01,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:33:01,057 INFO L225 Difference]: With dead ends: 63 [2022-04-15 00:33:01,057 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 00:33:01,058 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:33:01,059 INFO L913 BasicCegarLoop]: 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-15 00:33:01,060 INFO L914 BasicCegarLoop]: 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-15 00:33:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 00:33:01,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-15 00:33:01,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:33:01,096 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-15 00:33:01,096 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-15 00:33:01,097 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-15 00:33:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:01,100 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-15 00:33:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-15 00:33:01,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:01,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:01,102 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-15 00:33:01,102 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-15 00:33:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:01,106 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-15 00:33:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-15 00:33:01,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:01,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:01,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:33:01,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:33:01,108 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-15 00:33:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2022-04-15 00:33:01,110 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 22 [2022-04-15 00:33:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:33:01,111 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-04-15 00:33:01,111 INFO L479 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-15 00:33:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-15 00:33:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 00:33:01,112 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:33:01,112 INFO L499 BasicCegarLoop]: 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-15 00:33:01,113 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:33:01,113 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:33:01,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:33:01,113 INFO L85 PathProgramCache]: Analyzing trace with hash 349034817, now seen corresponding path program 1 times [2022-04-15 00:33:01,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:33:01,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309552062] [2022-04-15 00:33:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:33:01,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:33:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:33:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,215 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-15 00:33:01,215 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-15 00:33:01,216 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-15 00:33:01,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 00:33:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,220 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-15 00:33:01,220 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-15 00:33:01,221 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-15 00:33:01,221 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-15 00:33:01,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 00:33:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,225 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-15 00:33:01,225 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-15 00:33:01,225 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-15 00:33:01,225 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-15 00:33:01,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-15 00:33:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,229 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-15 00:33:01,229 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-15 00:33:01,229 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-15 00:33:01,230 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-15 00:33:01,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-15 00:33:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,233 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-15 00:33:01,233 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-15 00:33:01,234 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-15 00:33:01,234 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-15 00:33:01,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 00:33:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,239 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-15 00:33:01,240 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-15 00:33:01,240 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-15 00:33:01,240 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-15 00:33:01,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-15 00:33:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,246 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-15 00:33:01,246 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-15 00:33:01,246 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-15 00:33:01,247 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-15 00:33:01,247 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-15 00:33:01,247 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-15 00:33:01,248 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-15 00:33:01,248 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-15 00:33:01,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-15 00:33:01,248 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-15 00:33:01,248 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-15 00:33:01,249 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-15 00:33:01,249 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-15 00:33:01,249 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-15 00:33:01,249 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-15 00:33:01,249 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-15 00:33:01,250 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-15 00:33:01,250 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-15 00:33:01,250 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-15 00:33:01,250 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-15 00:33:01,250 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-15 00:33:01,251 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-15 00:33:01,251 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-15 00:33:01,251 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-15 00:33:01,251 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-15 00:33:01,251 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-15 00:33:01,252 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-15 00:33:01,252 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-15 00:33:01,252 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-15 00:33:01,252 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-15 00:33:01,252 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-15 00:33:01,252 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-15 00:33:01,253 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-15 00:33:01,253 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-15 00:33:01,253 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-15 00:33:01,253 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-15 00:33:01,253 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-15 00:33:01,254 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-15 00:33:01,254 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-15 00:33:01,256 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-15 00:33:01,256 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-15 00:33:01,257 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-15 00:33:01,257 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-15 00:33:01,257 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-15 00:33:01,258 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-15 00:33:01,258 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-15 00:33:01,258 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-15 00:33:01,258 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-15 00:33:01,259 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-15 00:33:01,259 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-15 00:33:01,260 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-15 00:33:01,260 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-15 00:33:01,260 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-15 00:33:01,260 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-15 00:33:01,261 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-15 00:33:01,261 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-15 00:33:01,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:33:01,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309552062] [2022-04-15 00:33:01,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309552062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:33:01,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:33:01,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 00:33:01,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279326230] [2022-04-15 00:33:01,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:33:01,263 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-15 00:33:01,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:33:01,263 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-15 00:33:01,288 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-15 00:33:01,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 00:33:01,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:33:01,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 00:33:01,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 00:33:01,289 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-15 00:33:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:01,595 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2022-04-15 00:33:01,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 00:33:01,596 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-15 00:33:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:33:01,596 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-15 00:33:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-15 00:33:01,599 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-15 00:33:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-15 00:33:01,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-15 00:33:01,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:33:01,696 INFO L225 Difference]: With dead ends: 90 [2022-04-15 00:33:01,696 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 00:33:01,697 INFO L912 BasicCegarLoop]: 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-15 00:33:01,698 INFO L913 BasicCegarLoop]: 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-15 00:33:01,699 INFO L914 BasicCegarLoop]: 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-15 00:33:01,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 00:33:01,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-15 00:33:01,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:33:01,742 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-15 00:33:01,747 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-15 00:33:01,749 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-15 00:33:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:01,753 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-15 00:33:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-15 00:33:01,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:01,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:01,754 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-15 00:33:01,755 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-15 00:33:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:01,758 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-15 00:33:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-15 00:33:01,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:01,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:01,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:33:01,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:33:01,759 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-15 00:33:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-04-15 00:33:01,761 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 51 [2022-04-15 00:33:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:33:01,762 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-04-15 00:33:01,762 INFO L479 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-15 00:33:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-15 00:33:01,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 00:33:01,766 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:33:01,766 INFO L499 BasicCegarLoop]: 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-15 00:33:01,766 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 00:33:01,766 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:33:01,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:33:01,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1328286090, now seen corresponding path program 1 times [2022-04-15 00:33:01,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:33:01,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383176104] [2022-04-15 00:33:01,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:33:01,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:33:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:33:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,916 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-15 00:33:01,916 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-15 00:33:01,916 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-15 00:33:01,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 00:33:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,922 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-15 00:33:01,922 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-15 00:33:01,922 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-15 00:33:01,923 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-15 00:33:01,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 00:33:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,927 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-15 00:33:01,928 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-15 00:33:01,928 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-15 00:33:01,928 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-15 00:33:01,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-15 00:33:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,932 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-15 00:33:01,933 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-15 00:33:01,933 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-15 00:33:01,933 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-15 00:33:01,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-15 00:33:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,938 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-15 00:33:01,938 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-15 00:33:01,938 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-15 00:33:01,939 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-15 00:33:01,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 00:33:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,943 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-15 00:33:01,943 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-15 00:33:01,944 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-15 00:33:01,944 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-15 00:33:01,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 00:33:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:01,949 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-15 00:33:01,949 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-15 00:33:01,949 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-15 00:33:01,950 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-15 00:33:01,950 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-15 00:33:01,950 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-15 00:33:01,951 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-15 00:33:01,951 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-15 00:33:01,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-15 00:33:01,951 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-15 00:33:01,951 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-15 00:33:01,951 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-15 00:33:01,952 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-15 00:33:01,952 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-15 00:33:01,952 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-15 00:33:01,952 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-15 00:33:01,953 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-15 00:33:01,953 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-15 00:33:01,953 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-15 00:33:01,953 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-15 00:33:01,953 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-15 00:33:01,954 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-15 00:33:01,954 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-15 00:33:01,954 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-15 00:33:01,954 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-15 00:33:01,955 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-15 00:33:01,955 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-15 00:33:01,956 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-15 00:33:01,956 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-15 00:33:01,956 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-15 00:33:01,956 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-15 00:33:01,956 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-15 00:33:01,957 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-15 00:33:01,957 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-15 00:33:01,957 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-15 00:33:01,957 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-15 00:33:01,958 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-15 00:33:01,958 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-15 00:33:01,958 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-15 00:33:01,959 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-15 00:33:01,959 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-15 00:33:01,959 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-15 00:33:01,960 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-15 00:33:01,960 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-15 00:33:01,960 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-15 00:33:01,961 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-15 00:33:01,961 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-15 00:33:01,961 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-15 00:33:01,961 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-15 00:33:01,961 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-15 00:33:01,962 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-15 00:33:01,962 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-15 00:33:01,963 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-15 00:33:01,963 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-15 00:33:01,964 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-15 00:33:01,964 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-15 00:33:01,964 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-15 00:33:01,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:33:01,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383176104] [2022-04-15 00:33:01,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383176104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:33:01,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:33:01,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 00:33:01,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982322596] [2022-04-15 00:33:01,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:33:01,966 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-15 00:33:01,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:33:01,966 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-15 00:33:01,992 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-15 00:33:01,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:33:01,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:33:01,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:33:01,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:33:01,993 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-15 00:33:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:02,655 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-04-15 00:33:02,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:33:02,655 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-15 00:33:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:33:02,656 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-15 00:33:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-15 00:33:02,658 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-15 00:33:02,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-15 00:33:02,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-04-15 00:33:02,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:33:02,753 INFO L225 Difference]: With dead ends: 68 [2022-04-15 00:33:02,754 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 00:33:02,754 INFO L912 BasicCegarLoop]: 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-15 00:33:02,765 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 00:33:02,766 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 59 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 00:33:02,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 00:33:02,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-04-15 00:33:02,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:33:02,812 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-15 00:33:02,813 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-15 00:33:02,813 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-15 00:33:02,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:02,816 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-15 00:33:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-15 00:33:02,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:02,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:02,817 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-15 00:33:02,817 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-15 00:33:02,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:02,820 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-15 00:33:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-15 00:33:02,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:02,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:02,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:33:02,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:33:02,821 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-15 00:33:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-04-15 00:33:02,824 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 52 [2022-04-15 00:33:02,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:33:02,824 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-04-15 00:33:02,825 INFO L479 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-15 00:33:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-15 00:33:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 00:33:02,826 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:33:02,827 INFO L499 BasicCegarLoop]: 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-15 00:33:02,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 00:33:02,827 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:33:02,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:33:02,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1785526948, now seen corresponding path program 1 times [2022-04-15 00:33:02,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:33:02,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107709735] [2022-04-15 00:33:02,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:33:02,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:33:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:02,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:33:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:02,955 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-15 00:33:02,956 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-15 00:33:02,956 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-15 00:33:02,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 00:33:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:02,959 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-15 00:33:02,959 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-15 00:33:02,959 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-15 00:33:02,960 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-15 00:33:02,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 00:33:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:02,963 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-15 00:33:02,963 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-15 00:33:02,963 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-15 00:33:02,963 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-15 00:33:02,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-15 00:33:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:02,966 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-15 00:33:02,966 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-15 00:33:02,966 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-15 00:33:02,967 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-15 00:33:02,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-15 00:33:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:02,970 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-15 00:33:02,970 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-15 00:33:02,970 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-15 00:33:02,970 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-15 00:33:02,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 00:33:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:02,973 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-15 00:33:02,973 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-15 00:33:02,973 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-15 00:33:02,973 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-15 00:33:02,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 00:33:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:02,976 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-15 00:33:02,976 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-15 00:33:02,977 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-15 00:33:02,977 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-15 00:33:02,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 00:33:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:02,980 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-15 00:33:02,980 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-15 00:33:02,980 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-15 00:33:02,980 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-15 00:33:02,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-15 00:33:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:02,983 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-15 00:33:02,983 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-15 00:33:02,983 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-15 00:33:02,984 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-15 00:33:02,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 00:33:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:02,986 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-15 00:33:02,987 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-15 00:33:02,987 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-15 00:33:02,987 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-15 00:33:02,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-15 00:33:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:02,990 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-15 00:33:02,990 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-15 00:33:02,990 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-15 00:33:02,990 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-15 00:33:02,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-15 00:33:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:02,994 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-15 00:33:02,994 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-15 00:33:02,995 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-15 00:33:02,995 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-15 00:33:02,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-15 00:33:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:02,999 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-15 00:33:02,999 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-15 00:33:02,999 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-15 00:33:03,000 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-15 00:33:03,000 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-15 00:33:03,000 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-15 00:33:03,001 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-15 00:33:03,001 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-15 00:33:03,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {1548#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-15 00:33:03,001 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-15 00:33:03,001 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-15 00:33:03,001 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-15 00:33:03,002 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-15 00:33:03,002 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-15 00:33:03,002 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-15 00:33:03,002 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-15 00:33:03,002 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-15 00:33:03,002 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-15 00:33:03,002 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-15 00:33:03,003 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-15 00:33:03,003 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-15 00:33:03,003 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-15 00:33:03,003 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-15 00:33:03,003 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-15 00:33:03,004 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-15 00:33:03,004 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-15 00:33:03,004 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-15 00:33:03,004 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-15 00:33:03,004 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-15 00:33:03,004 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-15 00:33:03,004 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-15 00:33:03,005 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-15 00:33:03,005 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-15 00:33:03,005 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-15 00:33:03,005 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-15 00:33:03,005 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-15 00:33:03,005 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-15 00:33:03,006 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-15 00:33:03,006 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-15 00:33:03,006 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-15 00:33:03,006 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-15 00:33:03,006 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-15 00:33:03,007 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-15 00:33:03,007 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-15 00:33:03,007 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-15 00:33:03,007 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-15 00:33:03,007 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-15 00:33:03,007 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-15 00:33:03,008 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-15 00:33:03,008 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-15 00:33:03,008 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-15 00:33:03,008 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-15 00:33:03,008 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-15 00:33:03,008 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-15 00:33:03,009 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-15 00:33:03,009 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-15 00:33:03,009 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-15 00:33:03,009 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-15 00:33:03,009 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-15 00:33:03,009 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-15 00:33:03,010 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-15 00:33:03,010 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-15 00:33:03,010 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-15 00:33:03,010 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-15 00:33:03,010 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-15 00:33:03,011 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-15 00:33:03,011 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-15 00:33:03,011 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-15 00:33:03,011 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-15 00:33:03,011 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-15 00:33:03,011 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-15 00:33:03,011 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-15 00:33:03,012 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-15 00:33:03,012 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-15 00:33:03,012 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-15 00:33:03,013 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-15 00:33:03,013 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-15 00:33:03,013 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-15 00:33:03,013 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-15 00:33:03,014 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-15 00:33:03,014 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-15 00:33:03,014 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-15 00:33:03,014 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-15 00:33:03,014 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-15 00:33:03,015 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-15 00:33:03,015 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-15 00:33:03,016 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-15 00:33:03,016 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-15 00:33:03,017 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-15 00:33:03,017 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-15 00:33:03,017 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-15 00:33:03,018 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-15 00:33:03,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:33:03,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107709735] [2022-04-15 00:33:03,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107709735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:33:03,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:33:03,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 00:33:03,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438942880] [2022-04-15 00:33:03,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:33:03,019 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-15 00:33:03,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:33:03,020 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-15 00:33:03,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:33:03,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:33:03,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:33:03,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:33:03,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:33:03,067 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-15 00:33:03,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:03,648 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2022-04-15 00:33:03,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:33:03,648 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-15 00:33:03,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:33:03,648 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-15 00:33:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-04-15 00:33:03,650 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-15 00:33:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-04-15 00:33:03,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 76 transitions. [2022-04-15 00:33:03,731 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-15 00:33:03,733 INFO L225 Difference]: With dead ends: 74 [2022-04-15 00:33:03,733 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 00:33:03,733 INFO L912 BasicCegarLoop]: 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-15 00:33:03,734 INFO L913 BasicCegarLoop]: 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-15 00:33:03,734 INFO L914 BasicCegarLoop]: 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-15 00:33:03,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 00:33:03,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-04-15 00:33:03,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:33:03,791 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-15 00:33:03,792 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-15 00:33:03,792 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-15 00:33:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:03,795 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2022-04-15 00:33:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-04-15 00:33:03,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:03,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:03,796 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-15 00:33:03,796 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-15 00:33:03,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:03,799 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2022-04-15 00:33:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-04-15 00:33:03,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:03,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:03,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:33:03,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:33:03,800 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-15 00:33:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2022-04-15 00:33:03,802 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 87 [2022-04-15 00:33:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:33:03,803 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2022-04-15 00:33:03,803 INFO L479 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-15 00:33:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-04-15 00:33:03,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 00:33:03,804 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:33:03,804 INFO L499 BasicCegarLoop]: 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-15 00:33:03,804 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 00:33:03,805 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:33:03,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:33:03,805 INFO L85 PathProgramCache]: Analyzing trace with hash 874819922, now seen corresponding path program 1 times [2022-04-15 00:33:03,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:33:03,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787389367] [2022-04-15 00:33:03,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:33:03,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:33:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:03,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:33:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:03,909 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-15 00:33:03,910 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-15 00:33:03,910 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-15 00:33:03,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 00:33:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:03,914 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-15 00:33:03,915 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-15 00:33:03,915 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-15 00:33:03,915 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-15 00:33:03,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 00:33:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:03,919 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-15 00:33:03,919 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-15 00:33:03,919 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-15 00:33:03,920 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-15 00:33:03,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-15 00:33:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:03,924 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-15 00:33:03,924 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-15 00:33:03,925 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-15 00:33:03,925 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-15 00:33:03,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-15 00:33:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:03,931 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-15 00:33:03,931 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-15 00:33:03,931 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-15 00:33:03,931 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-15 00:33:03,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 00:33:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:03,935 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-15 00:33:03,935 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-15 00:33:03,935 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-15 00:33:03,935 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-15 00:33:03,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 00:33:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:03,939 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-15 00:33:03,939 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-15 00:33:03,939 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-15 00:33:03,944 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-15 00:33:03,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 00:33:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:03,947 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-15 00:33:03,948 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-15 00:33:03,948 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-15 00:33:03,951 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-15 00:33:03,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-15 00:33:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:03,958 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-15 00:33:03,959 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-15 00:33:03,959 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-15 00:33:03,959 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-15 00:33:03,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 00:33:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:03,966 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-15 00:33:03,967 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-15 00:33:03,967 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-15 00:33:03,968 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-15 00:33:03,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-15 00:33:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:03,973 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-15 00:33:03,973 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-15 00:33:03,974 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-15 00:33:03,974 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-15 00:33:03,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-15 00:33:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:03,982 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-15 00:33:03,982 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-15 00:33:03,982 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-15 00:33:03,983 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-15 00:33:03,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-15 00:33:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:03,988 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-15 00:33:03,988 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-15 00:33:03,989 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-15 00:33:03,989 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-15 00:33:03,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-04-15 00:33:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:03,996 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-15 00:33:03,996 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-15 00:33:03,996 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-15 00:33:03,997 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-15 00:33:03,997 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-15 00:33:03,998 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-15 00:33:03,998 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-15 00:33:03,998 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-15 00:33:03,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {1971#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-15 00:33:03,998 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-15 00:33:03,999 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-15 00:33:03,999 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-15 00:33:03,999 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-15 00:33:03,999 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-15 00:33:03,999 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-15 00:33:03,999 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-15 00:33:04,000 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-15 00:33:04,000 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-15 00:33:04,000 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-15 00:33:04,000 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-15 00:33:04,000 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-15 00:33:04,000 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-15 00:33:04,000 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-15 00:33:04,001 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-15 00:33:04,001 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-15 00:33:04,001 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-15 00:33:04,001 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-15 00:33:04,001 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-15 00:33:04,001 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-15 00:33:04,001 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-15 00:33:04,001 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-15 00:33:04,001 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-15 00:33:04,002 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-15 00:33:04,002 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-15 00:33:04,002 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-15 00:33:04,002 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-15 00:33:04,002 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-15 00:33:04,002 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-15 00:33:04,003 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-15 00:33:04,003 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-15 00:33:04,003 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-15 00:33:04,003 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-15 00:33:04,003 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-15 00:33:04,003 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-15 00:33:04,004 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-15 00:33:04,004 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-15 00:33:04,004 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-15 00:33:04,004 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-15 00:33:04,004 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-15 00:33:04,005 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-15 00:33:04,005 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-15 00:33:04,005 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-15 00:33:04,005 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-15 00:33:04,005 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-15 00:33:04,005 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-15 00:33:04,006 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-15 00:33:04,006 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-15 00:33:04,006 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-15 00:33:04,006 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-15 00:33:04,006 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-15 00:33:04,006 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-15 00:33:04,007 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-15 00:33:04,007 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-15 00:33:04,007 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-15 00:33:04,007 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-15 00:33:04,007 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-15 00:33:04,008 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-15 00:33:04,008 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-15 00:33:04,008 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-15 00:33:04,009 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-15 00:33:04,009 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-15 00:33:04,009 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-15 00:33:04,009 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-15 00:33:04,015 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-15 00:33:04,016 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-15 00:33:04,016 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-15 00:33:04,016 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-15 00:33:04,016 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-15 00:33:04,016 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-15 00:33:04,017 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-15 00:33:04,017 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-15 00:33:04,017 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-15 00:33:04,017 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-15 00:33:04,018 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-15 00:33:04,018 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-15 00:33:04,018 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-15 00:33:04,019 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-15 00:33:04,019 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-15 00:33:04,019 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-15 00:33:04,019 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-15 00:33:04,020 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-15 00:33:04,021 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-15 00:33:04,022 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-15 00:33:04,022 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-15 00:33:04,022 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-15 00:33:04,023 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-15 00:33:04,025 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-15 00:33:04,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:33:04,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787389367] [2022-04-15 00:33:04,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787389367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:33:04,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:33:04,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 00:33:04,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179697686] [2022-04-15 00:33:04,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:33:04,027 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-15 00:33:04,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:33:04,027 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-15 00:33:04,066 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-15 00:33:04,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:33:04,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:33:04,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:33:04,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:33:04,067 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-15 00:33:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:04,761 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2022-04-15 00:33:04,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:33:04,761 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-15 00:33:04,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:33:04,762 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-15 00:33:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-15 00:33:04,764 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-15 00:33:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-15 00:33:04,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2022-04-15 00:33:04,852 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-15 00:33:04,852 INFO L225 Difference]: With dead ends: 75 [2022-04-15 00:33:04,852 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:33:04,853 INFO L912 BasicCegarLoop]: 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-15 00:33:04,854 INFO L913 BasicCegarLoop]: 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-15 00:33:04,854 INFO L914 BasicCegarLoop]: 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-15 00:33:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:33:04,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:33:04,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:33:04,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:33:04,855 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:33:04,855 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:33:04,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:04,855 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:33:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:33:04,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:04,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:04,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:33:04,856 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:33:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:04,856 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:33:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:33:04,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:04,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:04,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:33:04,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:33:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:33:04,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:33:04,857 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2022-04-15 00:33:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:33:04,857 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:33:04,857 INFO L479 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-15 00:33:04,857 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:33:04,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:04,859 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:33:04,860 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 00:33:04,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:33:05,197 INFO L878 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-15 00:33:05,197 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:33:05,197 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:33:05,197 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:33:05,197 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:33:05,197 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:33:05,197 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:33:05,198 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 83) the Hoare annotation is: true [2022-04-15 00:33:05,198 INFO L882 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-04-15 00:33:05,198 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 24 83) no Hoare annotation was computed. [2022-04-15 00:33:05,198 INFO L882 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-15 00:33:05,198 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 24 83) no Hoare annotation was computed. [2022-04-15 00:33:05,198 INFO L882 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-04-15 00:33:05,198 INFO L882 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-15 00:33:05,198 INFO L882 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2022-04-15 00:33:05,198 INFO L885 garLoopResultBuilder]: At program point L81(lines 25 83) the Hoare annotation is: true [2022-04-15 00:33:05,198 INFO L882 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2022-04-15 00:33:05,198 INFO L882 garLoopResultBuilder]: For program point L37(lines 25 83) no Hoare annotation was computed. [2022-04-15 00:33:05,198 INFO L878 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-15 00:33:05,198 INFO L878 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-15 00:33:05,198 INFO L882 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-04-15 00:33:05,199 INFO L882 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2022-04-15 00:33:05,199 INFO L878 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-15 00:33:05,199 INFO L878 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-15 00:33:05,199 INFO L878 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-15 00:33:05,199 INFO L878 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-15 00:33:05,199 INFO L882 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-04-15 00:33:05,199 INFO L878 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-15 00:33:05,199 INFO L882 garLoopResultBuilder]: For program point L54(lines 44 80) no Hoare annotation was computed. [2022-04-15 00:33:05,199 INFO L878 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-15 00:33:05,199 INFO L882 garLoopResultBuilder]: For program point L57(lines 44 80) no Hoare annotation was computed. [2022-04-15 00:33:05,199 INFO L878 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-15 00:33:05,199 INFO L878 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-15 00:33:05,200 INFO L878 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-15 00:33:05,200 INFO L882 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-04-15 00:33:05,200 INFO L878 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-15 00:33:05,200 INFO L878 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-15 00:33:05,200 INFO L878 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-15 00:33:05,200 INFO L882 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2022-04-15 00:33:05,200 INFO L878 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-15 00:33:05,200 INFO L882 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-04-15 00:33:05,200 INFO L878 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-15 00:33:05,200 INFO L882 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2022-04-15 00:33:05,200 INFO L878 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-15 00:33:05,201 INFO L882 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-04-15 00:33:05,201 INFO L878 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-15 00:33:05,201 INFO L878 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-15 00:33:05,201 INFO L878 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-15 00:33:05,201 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-15 00:33:05,201 INFO L882 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-15 00:33:05,201 INFO L882 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-15 00:33:05,201 INFO L882 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-15 00:33:05,201 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-15 00:33:05,201 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-15 00:33:05,204 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-15 00:33:05,205 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:33:05,208 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:33:05,208 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-15 00:33:05,208 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,209 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 00:33:05,210 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 00:33:05,211 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 00:33:05,213 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 00:33:05,213 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-15 00:33:05,213 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-15 00:33:05,213 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-15 00:33:05,213 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-15 00:33:05,213 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-15 00:33:05,215 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-15 00:33:05,215 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-15 00:33:05,215 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 00:33:05,215 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 00:33:05,215 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:33:05,215 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-15 00:33:05,215 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-15 00:33:05,215 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 00:33:05,215 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 00:33:05,215 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-15 00:33:05,215 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-15 00:33:05,215 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-04-15 00:33:05,215 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-04-15 00:33:05,215 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-15 00:33:05,216 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-15 00:33:05,216 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 00:33:05,216 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 00:33:05,216 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-15 00:33:05,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:33:05 BasicIcfg [2022-04-15 00:33:05,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:33:05,227 INFO L158 Benchmark]: Toolchain (without parser) took 7688.69ms. Allocated memory was 189.8MB in the beginning and 287.3MB in the end (delta: 97.5MB). Free memory was 133.1MB in the beginning and 126.4MB in the end (delta: 6.7MB). Peak memory consumption was 104.9MB. Max. memory is 8.0GB. [2022-04-15 00:33:05,227 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:33:05,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.22ms. Allocated memory was 189.8MB in the beginning and 239.1MB in the end (delta: 49.3MB). Free memory was 132.8MB in the beginning and 208.9MB in the end (delta: -76.1MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2022-04-15 00:33:05,227 INFO L158 Benchmark]: Boogie Preprocessor took 27.92ms. Allocated memory is still 239.1MB. Free memory was 208.9MB in the beginning and 207.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:33:05,228 INFO L158 Benchmark]: RCFGBuilder took 477.10ms. Allocated memory is still 239.1MB. Free memory was 207.4MB in the beginning and 190.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-15 00:33:05,228 INFO L158 Benchmark]: IcfgTransformer took 45.72ms. Allocated memory is still 239.1MB. Free memory was 190.1MB in the beginning and 186.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-15 00:33:05,228 INFO L158 Benchmark]: TraceAbstraction took 6901.77ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 186.4MB in the beginning and 126.4MB in the end (delta: 60.0MB). Peak memory consumption was 109.3MB. Max. memory is 8.0GB. [2022-04-15 00:33:05,229 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.11ms. Allocated memory is still 189.8MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.22ms. Allocated memory was 189.8MB in the beginning and 239.1MB in the end (delta: 49.3MB). Free memory was 132.8MB in the beginning and 208.9MB in the end (delta: -76.1MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.92ms. Allocated memory is still 239.1MB. Free memory was 208.9MB in the beginning and 207.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 477.10ms. Allocated memory is still 239.1MB. Free memory was 207.4MB in the beginning and 190.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * IcfgTransformer took 45.72ms. Allocated memory is still 239.1MB. Free memory was 190.1MB in the beginning and 186.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6901.77ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 186.4MB in the beginning and 126.4MB in the end (delta: 60.0MB). Peak memory consumption was 109.3MB. 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: 6.8s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 277 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 1.6s 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.3s 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.3s 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.8s 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-15 00:33:05,261 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...