/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:22:50,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:22:50,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:22:50,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:22:50,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:22:50,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:22:50,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:22:50,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:22:50,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:22:50,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:22:50,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:22:50,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:22:50,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:22:50,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:22:50,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:22:50,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:22:50,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:22:50,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:22:50,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:22:50,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:22:50,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:22:50,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:22:50,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:22:50,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:22:50,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:22:50,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:22:50,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:22:50,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:22:50,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:22:50,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:22:50,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:22:50,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:22:50,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:22:50,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:22:50,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:22:50,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:22:50,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:22:50,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:22:50,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:22:50,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:22:50,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:22:50,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:22:51,000 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:22:51,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:22:51,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:22:51,004 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:22:51,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:22:51,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:22:51,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:22:51,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:22:51,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:22:51,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:22:51,005 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:22:51,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:22:51,005 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:22:51,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:22:51,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:22:51,006 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:22:51,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:22:51,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:22:51,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:22:51,007 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:22:51,007 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:22:51,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:22:51,007 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:22:51,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:22:51,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:22:51,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:22:51,372 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:22:51,373 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:22:51,374 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-07-10 20:22:51,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d835fe15d/a0a77d167563470f8c6405a0ea914b78/FLAG1f70e9f9e [2020-07-10 20:22:52,041 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:22:52,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-07-10 20:22:52,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d835fe15d/a0a77d167563470f8c6405a0ea914b78/FLAG1f70e9f9e [2020-07-10 20:22:52,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d835fe15d/a0a77d167563470f8c6405a0ea914b78 [2020-07-10 20:22:52,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:22:52,404 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:22:52,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:52,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:22:52,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:22:52,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:52" (1/1) ... [2020-07-10 20:22:52,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a520b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:52, skipping insertion in model container [2020-07-10 20:22:52,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:52" (1/1) ... [2020-07-10 20:22:52,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:22:52,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:22:52,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:52,706 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:22:52,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:52,803 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:22:52,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:52 WrapperNode [2020-07-10 20:22:52,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:52,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:22:52,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:22:52,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:22:52,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:52" (1/1) ... [2020-07-10 20:22:52,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:52" (1/1) ... [2020-07-10 20:22:52,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:52" (1/1) ... [2020-07-10 20:22:52,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:52" (1/1) ... [2020-07-10 20:22:52,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:52" (1/1) ... [2020-07-10 20:22:52,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:52" (1/1) ... [2020-07-10 20:22:52,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:52" (1/1) ... [2020-07-10 20:22:52,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:22:52,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:22:52,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:22:52,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:22:52,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:22:53,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:22:53,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:22:53,012 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:22:53,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:22:53,013 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:22:53,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:22:53,013 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:22:53,013 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:22:53,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:22:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:22:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:22:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:22:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:22:53,725 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:22:53,725 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 20:22:53,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:53 BoogieIcfgContainer [2020-07-10 20:22:53,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:22:53,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:22:53,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:22:53,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:22:53,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:22:52" (1/3) ... [2020-07-10 20:22:53,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645136ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:53, skipping insertion in model container [2020-07-10 20:22:53,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:52" (2/3) ... [2020-07-10 20:22:53,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645136ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:53, skipping insertion in model container [2020-07-10 20:22:53,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:53" (3/3) ... [2020-07-10 20:22:53,744 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2020-07-10 20:22:53,758 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:22:53,768 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:22:53,787 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:22:53,815 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:22:53,815 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:22:53,815 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:22:53,816 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:22:53,816 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:22:53,816 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:22:53,817 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:22:53,817 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:22:53,838 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2020-07-10 20:22:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 20:22:53,851 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:53,852 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:53,852 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:53,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:53,859 INFO L82 PathProgramCache]: Analyzing trace with hash 60896664, now seen corresponding path program 1 times [2020-07-10 20:22:53,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:53,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [225999158] [2020-07-10 20:22:53,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:54,222 INFO L280 TraceCheckUtils]: 0: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-10 20:22:54,222 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {95#true} {95#true} #180#return; {95#true} is VALID [2020-07-10 20:22:54,225 INFO L263 TraceCheckUtils]: 0: Hoare triple {95#true} call ULTIMATE.init(); {95#true} is VALID [2020-07-10 20:22:54,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-10 20:22:54,226 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {95#true} {95#true} #180#return; {95#true} is VALID [2020-07-10 20:22:54,227 INFO L263 TraceCheckUtils]: 3: Hoare triple {95#true} call #t~ret11 := main(); {95#true} is VALID [2020-07-10 20:22:54,227 INFO L280 TraceCheckUtils]: 4: Hoare triple {95#true} havoc ~scheme~0; {95#true} is VALID [2020-07-10 20:22:54,228 INFO L280 TraceCheckUtils]: 5: Hoare triple {95#true} havoc ~urilen~0; {95#true} is VALID [2020-07-10 20:22:54,228 INFO L280 TraceCheckUtils]: 6: Hoare triple {95#true} havoc ~tokenlen~0; {95#true} is VALID [2020-07-10 20:22:54,228 INFO L280 TraceCheckUtils]: 7: Hoare triple {95#true} havoc ~cp~0; {95#true} is VALID [2020-07-10 20:22:54,229 INFO L280 TraceCheckUtils]: 8: Hoare triple {95#true} havoc ~c~0; {95#true} is VALID [2020-07-10 20:22:54,229 INFO L280 TraceCheckUtils]: 9: Hoare triple {95#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {95#true} is VALID [2020-07-10 20:22:54,230 INFO L280 TraceCheckUtils]: 10: Hoare triple {95#true} ~urilen~0 := #t~nondet0; {95#true} is VALID [2020-07-10 20:22:54,230 INFO L280 TraceCheckUtils]: 11: Hoare triple {95#true} havoc #t~nondet0; {95#true} is VALID [2020-07-10 20:22:54,230 INFO L280 TraceCheckUtils]: 12: Hoare triple {95#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {95#true} is VALID [2020-07-10 20:22:54,231 INFO L280 TraceCheckUtils]: 13: Hoare triple {95#true} ~tokenlen~0 := #t~nondet1; {95#true} is VALID [2020-07-10 20:22:54,231 INFO L280 TraceCheckUtils]: 14: Hoare triple {95#true} havoc #t~nondet1; {95#true} is VALID [2020-07-10 20:22:54,233 INFO L280 TraceCheckUtils]: 15: Hoare triple {95#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {95#true} is VALID [2020-07-10 20:22:54,233 INFO L280 TraceCheckUtils]: 16: Hoare triple {95#true} ~scheme~0 := #t~nondet2; {95#true} is VALID [2020-07-10 20:22:54,234 INFO L280 TraceCheckUtils]: 17: Hoare triple {95#true} havoc #t~nondet2; {95#true} is VALID [2020-07-10 20:22:54,237 INFO L280 TraceCheckUtils]: 18: Hoare triple {95#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {95#true} is VALID [2020-07-10 20:22:54,238 INFO L280 TraceCheckUtils]: 19: Hoare triple {95#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {95#true} is VALID [2020-07-10 20:22:54,239 INFO L280 TraceCheckUtils]: 20: Hoare triple {95#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {95#true} is VALID [2020-07-10 20:22:54,239 INFO L280 TraceCheckUtils]: 21: Hoare triple {95#true} assume ~urilen~0 > 0; {95#true} is VALID [2020-07-10 20:22:54,240 INFO L280 TraceCheckUtils]: 22: Hoare triple {95#true} assume ~tokenlen~0 > 0; {95#true} is VALID [2020-07-10 20:22:54,240 INFO L280 TraceCheckUtils]: 23: Hoare triple {95#true} assume ~scheme~0 >= 0; {95#true} is VALID [2020-07-10 20:22:54,242 INFO L280 TraceCheckUtils]: 24: Hoare triple {95#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {99#(<= (+ main_~scheme~0 1) main_~urilen~0)} is VALID [2020-07-10 20:22:54,243 INFO L280 TraceCheckUtils]: 25: Hoare triple {99#(<= (+ main_~scheme~0 1) main_~urilen~0)} ~cp~0 := ~scheme~0; {100#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-10 20:22:54,246 INFO L263 TraceCheckUtils]: 26: Hoare triple {100#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {101#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:54,249 INFO L280 TraceCheckUtils]: 27: Hoare triple {101#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {102#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:54,250 INFO L280 TraceCheckUtils]: 28: Hoare triple {102#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {96#false} is VALID [2020-07-10 20:22:54,251 INFO L280 TraceCheckUtils]: 29: Hoare triple {96#false} assume !false; {96#false} is VALID [2020-07-10 20:22:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:54,262 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:54,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [225999158] [2020-07-10 20:22:54,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:54,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:22:54,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732183871] [2020-07-10 20:22:54,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 20:22:54,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:54,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:22:54,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:54,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:22:54,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:54,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:22:54,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:22:54,383 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 6 states. [2020-07-10 20:22:55,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:55,941 INFO L93 Difference]: Finished difference Result 178 states and 273 transitions. [2020-07-10 20:22:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 20:22:55,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 20:22:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:22:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 273 transitions. [2020-07-10 20:22:55,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:22:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 273 transitions. [2020-07-10 20:22:56,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 273 transitions. [2020-07-10 20:22:56,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:56,476 INFO L225 Difference]: With dead ends: 178 [2020-07-10 20:22:56,477 INFO L226 Difference]: Without dead ends: 103 [2020-07-10 20:22:56,484 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:22:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-10 20:22:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2020-07-10 20:22:56,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:56,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 93 states. [2020-07-10 20:22:56,642 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 93 states. [2020-07-10 20:22:56,643 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 93 states. [2020-07-10 20:22:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:56,656 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2020-07-10 20:22:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2020-07-10 20:22:56,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:56,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:56,660 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 103 states. [2020-07-10 20:22:56,661 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 103 states. [2020-07-10 20:22:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:56,672 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2020-07-10 20:22:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2020-07-10 20:22:56,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:56,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:56,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:56,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-10 20:22:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2020-07-10 20:22:56,686 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 30 [2020-07-10 20:22:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:56,687 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2020-07-10 20:22:56,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:22:56,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states and 116 transitions. [2020-07-10 20:22:56,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:56,863 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2020-07-10 20:22:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 20:22:56,865 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:56,865 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:56,866 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:22:56,866 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:56,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1464371663, now seen corresponding path program 1 times [2020-07-10 20:22:56,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:56,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1538483642] [2020-07-10 20:22:56,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:57,042 INFO L280 TraceCheckUtils]: 0: Hoare triple {857#true} assume true; {857#true} is VALID [2020-07-10 20:22:57,043 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {857#true} {857#true} #180#return; {857#true} is VALID [2020-07-10 20:22:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:57,055 INFO L280 TraceCheckUtils]: 0: Hoare triple {857#true} ~cond := #in~cond; {857#true} is VALID [2020-07-10 20:22:57,056 INFO L280 TraceCheckUtils]: 1: Hoare triple {857#true} assume !(0 == ~cond); {857#true} is VALID [2020-07-10 20:22:57,056 INFO L280 TraceCheckUtils]: 2: Hoare triple {857#true} assume true; {857#true} is VALID [2020-07-10 20:22:57,057 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {857#true} {863#(<= 1 main_~cp~0)} #184#return; {863#(<= 1 main_~cp~0)} is VALID [2020-07-10 20:22:57,058 INFO L263 TraceCheckUtils]: 0: Hoare triple {857#true} call ULTIMATE.init(); {857#true} is VALID [2020-07-10 20:22:57,058 INFO L280 TraceCheckUtils]: 1: Hoare triple {857#true} assume true; {857#true} is VALID [2020-07-10 20:22:57,058 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {857#true} {857#true} #180#return; {857#true} is VALID [2020-07-10 20:22:57,059 INFO L263 TraceCheckUtils]: 3: Hoare triple {857#true} call #t~ret11 := main(); {857#true} is VALID [2020-07-10 20:22:57,059 INFO L280 TraceCheckUtils]: 4: Hoare triple {857#true} havoc ~scheme~0; {857#true} is VALID [2020-07-10 20:22:57,060 INFO L280 TraceCheckUtils]: 5: Hoare triple {857#true} havoc ~urilen~0; {857#true} is VALID [2020-07-10 20:22:57,060 INFO L280 TraceCheckUtils]: 6: Hoare triple {857#true} havoc ~tokenlen~0; {857#true} is VALID [2020-07-10 20:22:57,060 INFO L280 TraceCheckUtils]: 7: Hoare triple {857#true} havoc ~cp~0; {857#true} is VALID [2020-07-10 20:22:57,061 INFO L280 TraceCheckUtils]: 8: Hoare triple {857#true} havoc ~c~0; {857#true} is VALID [2020-07-10 20:22:57,061 INFO L280 TraceCheckUtils]: 9: Hoare triple {857#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {857#true} is VALID [2020-07-10 20:22:57,061 INFO L280 TraceCheckUtils]: 10: Hoare triple {857#true} ~urilen~0 := #t~nondet0; {857#true} is VALID [2020-07-10 20:22:57,062 INFO L280 TraceCheckUtils]: 11: Hoare triple {857#true} havoc #t~nondet0; {857#true} is VALID [2020-07-10 20:22:57,062 INFO L280 TraceCheckUtils]: 12: Hoare triple {857#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {857#true} is VALID [2020-07-10 20:22:57,062 INFO L280 TraceCheckUtils]: 13: Hoare triple {857#true} ~tokenlen~0 := #t~nondet1; {857#true} is VALID [2020-07-10 20:22:57,063 INFO L280 TraceCheckUtils]: 14: Hoare triple {857#true} havoc #t~nondet1; {857#true} is VALID [2020-07-10 20:22:57,063 INFO L280 TraceCheckUtils]: 15: Hoare triple {857#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {857#true} is VALID [2020-07-10 20:22:57,063 INFO L280 TraceCheckUtils]: 16: Hoare triple {857#true} ~scheme~0 := #t~nondet2; {857#true} is VALID [2020-07-10 20:22:57,064 INFO L280 TraceCheckUtils]: 17: Hoare triple {857#true} havoc #t~nondet2; {857#true} is VALID [2020-07-10 20:22:57,064 INFO L280 TraceCheckUtils]: 18: Hoare triple {857#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {857#true} is VALID [2020-07-10 20:22:57,064 INFO L280 TraceCheckUtils]: 19: Hoare triple {857#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {857#true} is VALID [2020-07-10 20:22:57,064 INFO L280 TraceCheckUtils]: 20: Hoare triple {857#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {857#true} is VALID [2020-07-10 20:22:57,065 INFO L280 TraceCheckUtils]: 21: Hoare triple {857#true} assume ~urilen~0 > 0; {857#true} is VALID [2020-07-10 20:22:57,065 INFO L280 TraceCheckUtils]: 22: Hoare triple {857#true} assume ~tokenlen~0 > 0; {857#true} is VALID [2020-07-10 20:22:57,066 INFO L280 TraceCheckUtils]: 23: Hoare triple {857#true} assume ~scheme~0 >= 0; {861#(< 0 (+ main_~scheme~0 1))} is VALID [2020-07-10 20:22:57,068 INFO L280 TraceCheckUtils]: 24: Hoare triple {861#(< 0 (+ main_~scheme~0 1))} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {862#(< 0 main_~scheme~0)} is VALID [2020-07-10 20:22:57,069 INFO L280 TraceCheckUtils]: 25: Hoare triple {862#(< 0 main_~scheme~0)} ~cp~0 := ~scheme~0; {863#(<= 1 main_~cp~0)} is VALID [2020-07-10 20:22:57,070 INFO L263 TraceCheckUtils]: 26: Hoare triple {863#(<= 1 main_~cp~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {857#true} is VALID [2020-07-10 20:22:57,070 INFO L280 TraceCheckUtils]: 27: Hoare triple {857#true} ~cond := #in~cond; {857#true} is VALID [2020-07-10 20:22:57,071 INFO L280 TraceCheckUtils]: 28: Hoare triple {857#true} assume !(0 == ~cond); {857#true} is VALID [2020-07-10 20:22:57,071 INFO L280 TraceCheckUtils]: 29: Hoare triple {857#true} assume true; {857#true} is VALID [2020-07-10 20:22:57,072 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {857#true} {863#(<= 1 main_~cp~0)} #184#return; {863#(<= 1 main_~cp~0)} is VALID [2020-07-10 20:22:57,073 INFO L263 TraceCheckUtils]: 31: Hoare triple {863#(<= 1 main_~cp~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {868#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:57,075 INFO L280 TraceCheckUtils]: 32: Hoare triple {868#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {869#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:57,076 INFO L280 TraceCheckUtils]: 33: Hoare triple {869#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {858#false} is VALID [2020-07-10 20:22:57,076 INFO L280 TraceCheckUtils]: 34: Hoare triple {858#false} assume !false; {858#false} is VALID [2020-07-10 20:22:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:57,079 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:57,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1538483642] [2020-07-10 20:22:57,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:57,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:22:57,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740804606] [2020-07-10 20:22:57,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-10 20:22:57,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:57,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:22:57,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:57,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:22:57,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:57,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:22:57,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:22:57,127 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand 7 states. [2020-07-10 20:22:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:58,232 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2020-07-10 20:22:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 20:22:58,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-10 20:22:58,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:22:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2020-07-10 20:22:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:22:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2020-07-10 20:22:58,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2020-07-10 20:22:58,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:58,396 INFO L225 Difference]: With dead ends: 99 [2020-07-10 20:22:58,396 INFO L226 Difference]: Without dead ends: 97 [2020-07-10 20:22:58,398 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:22:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-10 20:22:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-07-10 20:22:58,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:58,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 97 states. [2020-07-10 20:22:58,566 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-10 20:22:58,566 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-10 20:22:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:58,574 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2020-07-10 20:22:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2020-07-10 20:22:58,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:58,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:58,577 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-10 20:22:58,577 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-10 20:22:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:58,585 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2020-07-10 20:22:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2020-07-10 20:22:58,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:58,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:58,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:58,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-10 20:22:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2020-07-10 20:22:58,593 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 35 [2020-07-10 20:22:58,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:58,594 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2020-07-10 20:22:58,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:22:58,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 119 transitions. [2020-07-10 20:22:58,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:58,784 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2020-07-10 20:22:58,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-10 20:22:58,786 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:58,789 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:58,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:22:58,789 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:58,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1188311592, now seen corresponding path program 1 times [2020-07-10 20:22:58,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:58,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1089202674] [2020-07-10 20:22:58,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:58,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-10 20:22:58,929 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1462#true} {1462#true} #180#return; {1462#true} is VALID [2020-07-10 20:22:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:58,935 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-10 20:22:58,936 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-10 20:22:58,936 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-10 20:22:58,937 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1462#true} #184#return; {1462#true} is VALID [2020-07-10 20:22:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:58,942 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-10 20:22:58,942 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-10 20:22:58,943 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-10 20:22:58,943 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1462#true} #186#return; {1462#true} is VALID [2020-07-10 20:22:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:58,950 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-10 20:22:58,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-10 20:22:58,951 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-10 20:22:58,952 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1462#true} #188#return; {1462#true} is VALID [2020-07-10 20:22:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:58,958 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-10 20:22:58,959 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-10 20:22:58,959 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-10 20:22:58,960 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1462#true} #190#return; {1462#true} is VALID [2020-07-10 20:22:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:58,968 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-10 20:22:58,969 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-10 20:22:58,969 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-10 20:22:58,970 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1482#(= (+ main_~cp~0 1) main_~urilen~0)} #196#return; {1482#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-10 20:22:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:58,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-10 20:22:58,982 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-10 20:22:58,983 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-10 20:22:58,984 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1482#(= (+ main_~cp~0 1) main_~urilen~0)} #198#return; {1482#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-10 20:22:58,984 INFO L263 TraceCheckUtils]: 0: Hoare triple {1462#true} call ULTIMATE.init(); {1462#true} is VALID [2020-07-10 20:22:58,984 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-10 20:22:58,985 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1462#true} {1462#true} #180#return; {1462#true} is VALID [2020-07-10 20:22:58,985 INFO L263 TraceCheckUtils]: 3: Hoare triple {1462#true} call #t~ret11 := main(); {1462#true} is VALID [2020-07-10 20:22:58,985 INFO L280 TraceCheckUtils]: 4: Hoare triple {1462#true} havoc ~scheme~0; {1462#true} is VALID [2020-07-10 20:22:58,986 INFO L280 TraceCheckUtils]: 5: Hoare triple {1462#true} havoc ~urilen~0; {1462#true} is VALID [2020-07-10 20:22:58,986 INFO L280 TraceCheckUtils]: 6: Hoare triple {1462#true} havoc ~tokenlen~0; {1462#true} is VALID [2020-07-10 20:22:58,986 INFO L280 TraceCheckUtils]: 7: Hoare triple {1462#true} havoc ~cp~0; {1462#true} is VALID [2020-07-10 20:22:58,986 INFO L280 TraceCheckUtils]: 8: Hoare triple {1462#true} havoc ~c~0; {1462#true} is VALID [2020-07-10 20:22:58,987 INFO L280 TraceCheckUtils]: 9: Hoare triple {1462#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1462#true} is VALID [2020-07-10 20:22:58,987 INFO L280 TraceCheckUtils]: 10: Hoare triple {1462#true} ~urilen~0 := #t~nondet0; {1462#true} is VALID [2020-07-10 20:22:58,987 INFO L280 TraceCheckUtils]: 11: Hoare triple {1462#true} havoc #t~nondet0; {1462#true} is VALID [2020-07-10 20:22:58,988 INFO L280 TraceCheckUtils]: 12: Hoare triple {1462#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1462#true} is VALID [2020-07-10 20:22:58,988 INFO L280 TraceCheckUtils]: 13: Hoare triple {1462#true} ~tokenlen~0 := #t~nondet1; {1462#true} is VALID [2020-07-10 20:22:58,988 INFO L280 TraceCheckUtils]: 14: Hoare triple {1462#true} havoc #t~nondet1; {1462#true} is VALID [2020-07-10 20:22:58,988 INFO L280 TraceCheckUtils]: 15: Hoare triple {1462#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1462#true} is VALID [2020-07-10 20:22:58,989 INFO L280 TraceCheckUtils]: 16: Hoare triple {1462#true} ~scheme~0 := #t~nondet2; {1462#true} is VALID [2020-07-10 20:22:58,989 INFO L280 TraceCheckUtils]: 17: Hoare triple {1462#true} havoc #t~nondet2; {1462#true} is VALID [2020-07-10 20:22:58,989 INFO L280 TraceCheckUtils]: 18: Hoare triple {1462#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1462#true} is VALID [2020-07-10 20:22:58,990 INFO L280 TraceCheckUtils]: 19: Hoare triple {1462#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1462#true} is VALID [2020-07-10 20:22:58,990 INFO L280 TraceCheckUtils]: 20: Hoare triple {1462#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1462#true} is VALID [2020-07-10 20:22:58,990 INFO L280 TraceCheckUtils]: 21: Hoare triple {1462#true} assume ~urilen~0 > 0; {1462#true} is VALID [2020-07-10 20:22:58,990 INFO L280 TraceCheckUtils]: 22: Hoare triple {1462#true} assume ~tokenlen~0 > 0; {1462#true} is VALID [2020-07-10 20:22:58,991 INFO L280 TraceCheckUtils]: 23: Hoare triple {1462#true} assume ~scheme~0 >= 0; {1462#true} is VALID [2020-07-10 20:22:58,991 INFO L280 TraceCheckUtils]: 24: Hoare triple {1462#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {1462#true} is VALID [2020-07-10 20:22:58,991 INFO L280 TraceCheckUtils]: 25: Hoare triple {1462#true} ~cp~0 := ~scheme~0; {1462#true} is VALID [2020-07-10 20:22:58,992 INFO L263 TraceCheckUtils]: 26: Hoare triple {1462#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1462#true} is VALID [2020-07-10 20:22:58,992 INFO L280 TraceCheckUtils]: 27: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-10 20:22:58,992 INFO L280 TraceCheckUtils]: 28: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-10 20:22:58,993 INFO L280 TraceCheckUtils]: 29: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-10 20:22:58,993 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1462#true} {1462#true} #184#return; {1462#true} is VALID [2020-07-10 20:22:58,993 INFO L263 TraceCheckUtils]: 31: Hoare triple {1462#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1462#true} is VALID [2020-07-10 20:22:58,994 INFO L280 TraceCheckUtils]: 32: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-10 20:22:58,994 INFO L280 TraceCheckUtils]: 33: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-10 20:22:58,994 INFO L280 TraceCheckUtils]: 34: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-10 20:22:58,995 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1462#true} {1462#true} #186#return; {1462#true} is VALID [2020-07-10 20:22:58,995 INFO L280 TraceCheckUtils]: 36: Hoare triple {1462#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1462#true} is VALID [2020-07-10 20:22:58,995 INFO L280 TraceCheckUtils]: 37: Hoare triple {1462#true} assume 0 != #t~nondet3; {1462#true} is VALID [2020-07-10 20:22:58,996 INFO L280 TraceCheckUtils]: 38: Hoare triple {1462#true} havoc #t~nondet3; {1462#true} is VALID [2020-07-10 20:22:58,996 INFO L263 TraceCheckUtils]: 39: Hoare triple {1462#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1462#true} is VALID [2020-07-10 20:22:58,996 INFO L280 TraceCheckUtils]: 40: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-10 20:22:58,996 INFO L280 TraceCheckUtils]: 41: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-10 20:22:58,997 INFO L280 TraceCheckUtils]: 42: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-10 20:22:58,997 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {1462#true} {1462#true} #188#return; {1462#true} is VALID [2020-07-10 20:22:58,997 INFO L263 TraceCheckUtils]: 44: Hoare triple {1462#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1462#true} is VALID [2020-07-10 20:22:58,998 INFO L280 TraceCheckUtils]: 45: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-10 20:22:58,998 INFO L280 TraceCheckUtils]: 46: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-10 20:22:58,998 INFO L280 TraceCheckUtils]: 47: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-10 20:22:58,999 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {1462#true} {1462#true} #190#return; {1462#true} is VALID [2020-07-10 20:22:59,000 INFO L280 TraceCheckUtils]: 49: Hoare triple {1462#true} assume !(~cp~0 != ~urilen~0 - 1); {1482#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-10 20:22:59,000 INFO L263 TraceCheckUtils]: 50: Hoare triple {1482#(= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1462#true} is VALID [2020-07-10 20:22:59,000 INFO L280 TraceCheckUtils]: 51: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-10 20:22:59,001 INFO L280 TraceCheckUtils]: 52: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-10 20:22:59,001 INFO L280 TraceCheckUtils]: 53: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-10 20:22:59,002 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {1462#true} {1482#(= (+ main_~cp~0 1) main_~urilen~0)} #196#return; {1482#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-10 20:22:59,003 INFO L263 TraceCheckUtils]: 55: Hoare triple {1482#(= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1462#true} is VALID [2020-07-10 20:22:59,003 INFO L280 TraceCheckUtils]: 56: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-10 20:22:59,004 INFO L280 TraceCheckUtils]: 57: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-10 20:22:59,004 INFO L280 TraceCheckUtils]: 58: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-10 20:22:59,005 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {1462#true} {1482#(= (+ main_~cp~0 1) main_~urilen~0)} #198#return; {1482#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-10 20:22:59,007 INFO L280 TraceCheckUtils]: 60: Hoare triple {1482#(= (+ main_~cp~0 1) main_~urilen~0)} assume !(~cp~0 == ~urilen~0 - 1); {1463#false} is VALID [2020-07-10 20:22:59,007 INFO L263 TraceCheckUtils]: 61: Hoare triple {1463#false} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1463#false} is VALID [2020-07-10 20:22:59,008 INFO L280 TraceCheckUtils]: 62: Hoare triple {1463#false} ~cond := #in~cond; {1463#false} is VALID [2020-07-10 20:22:59,008 INFO L280 TraceCheckUtils]: 63: Hoare triple {1463#false} assume 0 == ~cond; {1463#false} is VALID [2020-07-10 20:22:59,009 INFO L280 TraceCheckUtils]: 64: Hoare triple {1463#false} assume !false; {1463#false} is VALID [2020-07-10 20:22:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-10 20:22:59,016 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:59,017 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1089202674] [2020-07-10 20:22:59,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:59,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:22:59,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337809891] [2020-07-10 20:22:59,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-10 20:22:59,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:59,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:22:59,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:59,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:22:59,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:59,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:22:59,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:22:59,084 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand 3 states. [2020-07-10 20:22:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:59,508 INFO L93 Difference]: Finished difference Result 140 states and 173 transitions. [2020-07-10 20:22:59,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:22:59,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-10 20:22:59,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:22:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2020-07-10 20:22:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:22:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2020-07-10 20:22:59,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2020-07-10 20:22:59,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:59,689 INFO L225 Difference]: With dead ends: 140 [2020-07-10 20:22:59,689 INFO L226 Difference]: Without dead ends: 97 [2020-07-10 20:22:59,691 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:22:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-10 20:22:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-07-10 20:22:59,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:59,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 97 states. [2020-07-10 20:22:59,849 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-10 20:22:59,849 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-10 20:22:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:59,857 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2020-07-10 20:22:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2020-07-10 20:22:59,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:59,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:59,859 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-10 20:22:59,860 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-10 20:22:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:59,873 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2020-07-10 20:22:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2020-07-10 20:22:59,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:59,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:59,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:59,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-10 20:22:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2020-07-10 20:22:59,893 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 65 [2020-07-10 20:22:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:59,896 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2020-07-10 20:22:59,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:22:59,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 117 transitions. [2020-07-10 20:23:00,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2020-07-10 20:23:00,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-10 20:23:00,085 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:00,085 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:00,085 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:23:00,085 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:00,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:00,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2082475577, now seen corresponding path program 1 times [2020-07-10 20:23:00,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:00,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1138231397] [2020-07-10 20:23:00,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:00,281 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-10 20:23:00,282 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2161#true} {2161#true} #180#return; {2161#true} is VALID [2020-07-10 20:23:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:00,291 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-10 20:23:00,291 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-10 20:23:00,292 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-10 20:23:00,293 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #184#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 20:23:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:00,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-10 20:23:00,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-10 20:23:00,314 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-10 20:23:00,314 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #186#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 20:23:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:00,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-10 20:23:00,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-10 20:23:00,322 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-10 20:23:00,323 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #188#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 20:23:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:00,331 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-10 20:23:00,331 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-10 20:23:00,332 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-10 20:23:00,333 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #190#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 20:23:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:00,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-10 20:23:00,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-10 20:23:00,341 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-10 20:23:00,342 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #196#return; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 20:23:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:00,350 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-10 20:23:00,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-10 20:23:00,351 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-10 20:23:00,354 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #198#return; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 20:23:00,354 INFO L263 TraceCheckUtils]: 0: Hoare triple {2161#true} call ULTIMATE.init(); {2161#true} is VALID [2020-07-10 20:23:00,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-10 20:23:00,355 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2161#true} {2161#true} #180#return; {2161#true} is VALID [2020-07-10 20:23:00,355 INFO L263 TraceCheckUtils]: 3: Hoare triple {2161#true} call #t~ret11 := main(); {2161#true} is VALID [2020-07-10 20:23:00,355 INFO L280 TraceCheckUtils]: 4: Hoare triple {2161#true} havoc ~scheme~0; {2161#true} is VALID [2020-07-10 20:23:00,356 INFO L280 TraceCheckUtils]: 5: Hoare triple {2161#true} havoc ~urilen~0; {2161#true} is VALID [2020-07-10 20:23:00,356 INFO L280 TraceCheckUtils]: 6: Hoare triple {2161#true} havoc ~tokenlen~0; {2161#true} is VALID [2020-07-10 20:23:00,356 INFO L280 TraceCheckUtils]: 7: Hoare triple {2161#true} havoc ~cp~0; {2161#true} is VALID [2020-07-10 20:23:00,356 INFO L280 TraceCheckUtils]: 8: Hoare triple {2161#true} havoc ~c~0; {2161#true} is VALID [2020-07-10 20:23:00,357 INFO L280 TraceCheckUtils]: 9: Hoare triple {2161#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2161#true} is VALID [2020-07-10 20:23:00,357 INFO L280 TraceCheckUtils]: 10: Hoare triple {2161#true} ~urilen~0 := #t~nondet0; {2161#true} is VALID [2020-07-10 20:23:00,357 INFO L280 TraceCheckUtils]: 11: Hoare triple {2161#true} havoc #t~nondet0; {2161#true} is VALID [2020-07-10 20:23:00,357 INFO L280 TraceCheckUtils]: 12: Hoare triple {2161#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2161#true} is VALID [2020-07-10 20:23:00,358 INFO L280 TraceCheckUtils]: 13: Hoare triple {2161#true} ~tokenlen~0 := #t~nondet1; {2161#true} is VALID [2020-07-10 20:23:00,358 INFO L280 TraceCheckUtils]: 14: Hoare triple {2161#true} havoc #t~nondet1; {2161#true} is VALID [2020-07-10 20:23:00,358 INFO L280 TraceCheckUtils]: 15: Hoare triple {2161#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2161#true} is VALID [2020-07-10 20:23:00,359 INFO L280 TraceCheckUtils]: 16: Hoare triple {2161#true} ~scheme~0 := #t~nondet2; {2161#true} is VALID [2020-07-10 20:23:00,359 INFO L280 TraceCheckUtils]: 17: Hoare triple {2161#true} havoc #t~nondet2; {2161#true} is VALID [2020-07-10 20:23:00,359 INFO L280 TraceCheckUtils]: 18: Hoare triple {2161#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {2161#true} is VALID [2020-07-10 20:23:00,359 INFO L280 TraceCheckUtils]: 19: Hoare triple {2161#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {2161#true} is VALID [2020-07-10 20:23:00,360 INFO L280 TraceCheckUtils]: 20: Hoare triple {2161#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {2161#true} is VALID [2020-07-10 20:23:00,360 INFO L280 TraceCheckUtils]: 21: Hoare triple {2161#true} assume ~urilen~0 > 0; {2161#true} is VALID [2020-07-10 20:23:00,360 INFO L280 TraceCheckUtils]: 22: Hoare triple {2161#true} assume ~tokenlen~0 > 0; {2161#true} is VALID [2020-07-10 20:23:00,361 INFO L280 TraceCheckUtils]: 23: Hoare triple {2161#true} assume ~scheme~0 >= 0; {2161#true} is VALID [2020-07-10 20:23:00,363 INFO L280 TraceCheckUtils]: 24: Hoare triple {2161#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {2165#(<= (+ main_~scheme~0 1) main_~urilen~0)} is VALID [2020-07-10 20:23:00,366 INFO L280 TraceCheckUtils]: 25: Hoare triple {2165#(<= (+ main_~scheme~0 1) main_~urilen~0)} ~cp~0 := ~scheme~0; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 20:23:00,366 INFO L263 TraceCheckUtils]: 26: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {2161#true} is VALID [2020-07-10 20:23:00,366 INFO L280 TraceCheckUtils]: 27: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-10 20:23:00,367 INFO L280 TraceCheckUtils]: 28: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-10 20:23:00,367 INFO L280 TraceCheckUtils]: 29: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-10 20:23:00,368 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #184#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 20:23:00,368 INFO L263 TraceCheckUtils]: 31: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {2161#true} is VALID [2020-07-10 20:23:00,368 INFO L280 TraceCheckUtils]: 32: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-10 20:23:00,368 INFO L280 TraceCheckUtils]: 33: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-10 20:23:00,368 INFO L280 TraceCheckUtils]: 34: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-10 20:23:00,369 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #186#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 20:23:00,370 INFO L280 TraceCheckUtils]: 36: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 20:23:00,370 INFO L280 TraceCheckUtils]: 37: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} assume 0 != #t~nondet3; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 20:23:00,371 INFO L280 TraceCheckUtils]: 38: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} havoc #t~nondet3; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 20:23:00,371 INFO L263 TraceCheckUtils]: 39: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2161#true} is VALID [2020-07-10 20:23:00,371 INFO L280 TraceCheckUtils]: 40: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-10 20:23:00,371 INFO L280 TraceCheckUtils]: 41: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-10 20:23:00,372 INFO L280 TraceCheckUtils]: 42: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-10 20:23:00,373 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #188#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 20:23:00,374 INFO L263 TraceCheckUtils]: 44: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2161#true} is VALID [2020-07-10 20:23:00,374 INFO L280 TraceCheckUtils]: 45: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-10 20:23:00,374 INFO L280 TraceCheckUtils]: 46: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-10 20:23:00,375 INFO L280 TraceCheckUtils]: 47: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-10 20:23:00,381 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #190#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 20:23:00,387 INFO L280 TraceCheckUtils]: 49: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} assume !!(~cp~0 != ~urilen~0 - 1); {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 20:23:00,390 INFO L280 TraceCheckUtils]: 50: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 20:23:00,397 INFO L280 TraceCheckUtils]: 51: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} assume 0 != #t~nondet4; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 20:23:00,398 INFO L280 TraceCheckUtils]: 52: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} havoc #t~nondet4; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 20:23:00,399 INFO L263 TraceCheckUtils]: 53: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2161#true} is VALID [2020-07-10 20:23:00,399 INFO L280 TraceCheckUtils]: 54: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-10 20:23:00,399 INFO L280 TraceCheckUtils]: 55: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-10 20:23:00,399 INFO L280 TraceCheckUtils]: 56: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-10 20:23:00,400 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2161#true} {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #196#return; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 20:23:00,401 INFO L263 TraceCheckUtils]: 58: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2161#true} is VALID [2020-07-10 20:23:00,401 INFO L280 TraceCheckUtils]: 59: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-10 20:23:00,402 INFO L280 TraceCheckUtils]: 60: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-10 20:23:00,402 INFO L280 TraceCheckUtils]: 61: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-10 20:23:00,404 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2161#true} {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #198#return; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 20:23:00,407 INFO L280 TraceCheckUtils]: 63: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} assume !(~cp~0 == ~urilen~0 - 1); {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 20:23:00,416 INFO L263 TraceCheckUtils]: 64: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {2192#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:00,420 INFO L280 TraceCheckUtils]: 65: Hoare triple {2192#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2193#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:00,424 INFO L280 TraceCheckUtils]: 66: Hoare triple {2193#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2162#false} is VALID [2020-07-10 20:23:00,424 INFO L280 TraceCheckUtils]: 67: Hoare triple {2162#false} assume !false; {2162#false} is VALID [2020-07-10 20:23:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-10 20:23:00,433 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:00,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1138231397] [2020-07-10 20:23:00,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:00,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:23:00,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929174846] [2020-07-10 20:23:00,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2020-07-10 20:23:00,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:00,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:23:00,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:00,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:23:00,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:00,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:23:00,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:23:00,508 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 7 states. [2020-07-10 20:23:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:01,589 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2020-07-10 20:23:01,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 20:23:01,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2020-07-10 20:23:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:23:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2020-07-10 20:23:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:23:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2020-07-10 20:23:01,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 106 transitions. [2020-07-10 20:23:01,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:01,770 INFO L225 Difference]: With dead ends: 103 [2020-07-10 20:23:01,770 INFO L226 Difference]: Without dead ends: 101 [2020-07-10 20:23:01,771 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:23:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-10 20:23:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-07-10 20:23:01,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:01,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 101 states. [2020-07-10 20:23:01,984 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2020-07-10 20:23:01,984 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2020-07-10 20:23:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:01,991 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2020-07-10 20:23:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2020-07-10 20:23:01,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:01,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:01,992 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2020-07-10 20:23:01,992 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2020-07-10 20:23:01,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:01,998 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2020-07-10 20:23:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2020-07-10 20:23:01,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:01,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:01,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:02,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-07-10 20:23:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2020-07-10 20:23:02,004 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 68 [2020-07-10 20:23:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:02,005 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2020-07-10 20:23:02,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:23:02,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 101 states and 120 transitions. [2020-07-10 20:23:02,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2020-07-10 20:23:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-07-10 20:23:02,206 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:02,206 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:02,208 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:23:02,209 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:02,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:02,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1342891699, now seen corresponding path program 1 times [2020-07-10 20:23:02,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:02,210 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1820519718] [2020-07-10 20:23:02,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:02,389 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,389 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2812#true} {2812#true} #180#return; {2812#true} is VALID [2020-07-10 20:23:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:02,402 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,402 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,403 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,403 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #184#return; {2812#true} is VALID [2020-07-10 20:23:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:02,415 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,415 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,416 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #186#return; {2812#true} is VALID [2020-07-10 20:23:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:02,427 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,427 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,427 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #188#return; {2812#true} is VALID [2020-07-10 20:23:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:02,433 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,434 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,434 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #190#return; {2812#true} is VALID [2020-07-10 20:23:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:02,441 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,442 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,442 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,442 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #196#return; {2812#true} is VALID [2020-07-10 20:23:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:02,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,448 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,448 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #198#return; {2812#true} is VALID [2020-07-10 20:23:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:02,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,454 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,454 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #200#return; {2812#true} is VALID [2020-07-10 20:23:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:02,457 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,458 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,458 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #202#return; {2812#true} is VALID [2020-07-10 20:23:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:02,468 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,468 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,468 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,469 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2848#(= 0 main_~c~0)} #204#return; {2848#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:02,477 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,477 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,478 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,478 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2848#(= 0 main_~c~0)} #206#return; {2848#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:02,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,500 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,506 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #208#return; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-10 20:23:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:02,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,517 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,518 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #210#return; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-10 20:23:02,519 INFO L263 TraceCheckUtils]: 0: Hoare triple {2812#true} call ULTIMATE.init(); {2812#true} is VALID [2020-07-10 20:23:02,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,519 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2812#true} {2812#true} #180#return; {2812#true} is VALID [2020-07-10 20:23:02,519 INFO L263 TraceCheckUtils]: 3: Hoare triple {2812#true} call #t~ret11 := main(); {2812#true} is VALID [2020-07-10 20:23:02,520 INFO L280 TraceCheckUtils]: 4: Hoare triple {2812#true} havoc ~scheme~0; {2812#true} is VALID [2020-07-10 20:23:02,520 INFO L280 TraceCheckUtils]: 5: Hoare triple {2812#true} havoc ~urilen~0; {2812#true} is VALID [2020-07-10 20:23:02,520 INFO L280 TraceCheckUtils]: 6: Hoare triple {2812#true} havoc ~tokenlen~0; {2812#true} is VALID [2020-07-10 20:23:02,520 INFO L280 TraceCheckUtils]: 7: Hoare triple {2812#true} havoc ~cp~0; {2812#true} is VALID [2020-07-10 20:23:02,521 INFO L280 TraceCheckUtils]: 8: Hoare triple {2812#true} havoc ~c~0; {2812#true} is VALID [2020-07-10 20:23:02,521 INFO L280 TraceCheckUtils]: 9: Hoare triple {2812#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2812#true} is VALID [2020-07-10 20:23:02,521 INFO L280 TraceCheckUtils]: 10: Hoare triple {2812#true} ~urilen~0 := #t~nondet0; {2812#true} is VALID [2020-07-10 20:23:02,521 INFO L280 TraceCheckUtils]: 11: Hoare triple {2812#true} havoc #t~nondet0; {2812#true} is VALID [2020-07-10 20:23:02,522 INFO L280 TraceCheckUtils]: 12: Hoare triple {2812#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2812#true} is VALID [2020-07-10 20:23:02,522 INFO L280 TraceCheckUtils]: 13: Hoare triple {2812#true} ~tokenlen~0 := #t~nondet1; {2812#true} is VALID [2020-07-10 20:23:02,522 INFO L280 TraceCheckUtils]: 14: Hoare triple {2812#true} havoc #t~nondet1; {2812#true} is VALID [2020-07-10 20:23:02,522 INFO L280 TraceCheckUtils]: 15: Hoare triple {2812#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2812#true} is VALID [2020-07-10 20:23:02,523 INFO L280 TraceCheckUtils]: 16: Hoare triple {2812#true} ~scheme~0 := #t~nondet2; {2812#true} is VALID [2020-07-10 20:23:02,523 INFO L280 TraceCheckUtils]: 17: Hoare triple {2812#true} havoc #t~nondet2; {2812#true} is VALID [2020-07-10 20:23:02,523 INFO L280 TraceCheckUtils]: 18: Hoare triple {2812#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {2812#true} is VALID [2020-07-10 20:23:02,524 INFO L280 TraceCheckUtils]: 19: Hoare triple {2812#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {2812#true} is VALID [2020-07-10 20:23:02,524 INFO L280 TraceCheckUtils]: 20: Hoare triple {2812#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {2812#true} is VALID [2020-07-10 20:23:02,524 INFO L280 TraceCheckUtils]: 21: Hoare triple {2812#true} assume ~urilen~0 > 0; {2812#true} is VALID [2020-07-10 20:23:02,524 INFO L280 TraceCheckUtils]: 22: Hoare triple {2812#true} assume ~tokenlen~0 > 0; {2812#true} is VALID [2020-07-10 20:23:02,525 INFO L280 TraceCheckUtils]: 23: Hoare triple {2812#true} assume ~scheme~0 >= 0; {2812#true} is VALID [2020-07-10 20:23:02,525 INFO L280 TraceCheckUtils]: 24: Hoare triple {2812#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {2812#true} is VALID [2020-07-10 20:23:02,525 INFO L280 TraceCheckUtils]: 25: Hoare triple {2812#true} ~cp~0 := ~scheme~0; {2812#true} is VALID [2020-07-10 20:23:02,525 INFO L263 TraceCheckUtils]: 26: Hoare triple {2812#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-10 20:23:02,525 INFO L280 TraceCheckUtils]: 27: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,526 INFO L280 TraceCheckUtils]: 28: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,526 INFO L280 TraceCheckUtils]: 29: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,526 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2812#true} {2812#true} #184#return; {2812#true} is VALID [2020-07-10 20:23:02,526 INFO L263 TraceCheckUtils]: 31: Hoare triple {2812#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {2812#true} is VALID [2020-07-10 20:23:02,527 INFO L280 TraceCheckUtils]: 32: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,527 INFO L280 TraceCheckUtils]: 33: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,527 INFO L280 TraceCheckUtils]: 34: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,527 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2812#true} {2812#true} #186#return; {2812#true} is VALID [2020-07-10 20:23:02,528 INFO L280 TraceCheckUtils]: 36: Hoare triple {2812#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2812#true} is VALID [2020-07-10 20:23:02,528 INFO L280 TraceCheckUtils]: 37: Hoare triple {2812#true} assume 0 != #t~nondet3; {2812#true} is VALID [2020-07-10 20:23:02,528 INFO L280 TraceCheckUtils]: 38: Hoare triple {2812#true} havoc #t~nondet3; {2812#true} is VALID [2020-07-10 20:23:02,528 INFO L263 TraceCheckUtils]: 39: Hoare triple {2812#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-10 20:23:02,529 INFO L280 TraceCheckUtils]: 40: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,529 INFO L280 TraceCheckUtils]: 41: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,529 INFO L280 TraceCheckUtils]: 42: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,529 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2812#true} {2812#true} #188#return; {2812#true} is VALID [2020-07-10 20:23:02,530 INFO L263 TraceCheckUtils]: 44: Hoare triple {2812#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2812#true} is VALID [2020-07-10 20:23:02,530 INFO L280 TraceCheckUtils]: 45: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,530 INFO L280 TraceCheckUtils]: 46: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,530 INFO L280 TraceCheckUtils]: 47: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,531 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2812#true} {2812#true} #190#return; {2812#true} is VALID [2020-07-10 20:23:02,531 INFO L280 TraceCheckUtils]: 49: Hoare triple {2812#true} assume !!(~cp~0 != ~urilen~0 - 1); {2812#true} is VALID [2020-07-10 20:23:02,531 INFO L280 TraceCheckUtils]: 50: Hoare triple {2812#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2812#true} is VALID [2020-07-10 20:23:02,531 INFO L280 TraceCheckUtils]: 51: Hoare triple {2812#true} assume 0 != #t~nondet4; {2812#true} is VALID [2020-07-10 20:23:02,531 INFO L280 TraceCheckUtils]: 52: Hoare triple {2812#true} havoc #t~nondet4; {2812#true} is VALID [2020-07-10 20:23:02,532 INFO L263 TraceCheckUtils]: 53: Hoare triple {2812#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-10 20:23:02,532 INFO L280 TraceCheckUtils]: 54: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,532 INFO L280 TraceCheckUtils]: 55: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,532 INFO L280 TraceCheckUtils]: 56: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,533 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2812#true} {2812#true} #196#return; {2812#true} is VALID [2020-07-10 20:23:02,533 INFO L263 TraceCheckUtils]: 58: Hoare triple {2812#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2812#true} is VALID [2020-07-10 20:23:02,533 INFO L280 TraceCheckUtils]: 59: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,533 INFO L280 TraceCheckUtils]: 60: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,534 INFO L280 TraceCheckUtils]: 61: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,534 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2812#true} {2812#true} #198#return; {2812#true} is VALID [2020-07-10 20:23:02,534 INFO L280 TraceCheckUtils]: 63: Hoare triple {2812#true} assume !(~cp~0 == ~urilen~0 - 1); {2812#true} is VALID [2020-07-10 20:23:02,534 INFO L263 TraceCheckUtils]: 64: Hoare triple {2812#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-10 20:23:02,535 INFO L280 TraceCheckUtils]: 65: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,535 INFO L280 TraceCheckUtils]: 66: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,535 INFO L280 TraceCheckUtils]: 67: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,535 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {2812#true} {2812#true} #200#return; {2812#true} is VALID [2020-07-10 20:23:02,536 INFO L263 TraceCheckUtils]: 69: Hoare triple {2812#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {2812#true} is VALID [2020-07-10 20:23:02,536 INFO L280 TraceCheckUtils]: 70: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,536 INFO L280 TraceCheckUtils]: 71: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,536 INFO L280 TraceCheckUtils]: 72: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,537 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {2812#true} {2812#true} #202#return; {2812#true} is VALID [2020-07-10 20:23:02,537 INFO L280 TraceCheckUtils]: 74: Hoare triple {2812#true} assume !(1 + ~cp~0 == ~urilen~0 - 1); {2812#true} is VALID [2020-07-10 20:23:02,537 INFO L280 TraceCheckUtils]: 75: Hoare triple {2812#true} #t~pre6 := 1 + ~cp~0; {2812#true} is VALID [2020-07-10 20:23:02,537 INFO L280 TraceCheckUtils]: 76: Hoare triple {2812#true} ~cp~0 := 1 + ~cp~0; {2812#true} is VALID [2020-07-10 20:23:02,538 INFO L280 TraceCheckUtils]: 77: Hoare triple {2812#true} havoc #t~pre6; {2812#true} is VALID [2020-07-10 20:23:02,538 INFO L280 TraceCheckUtils]: 78: Hoare triple {2812#true} ~scheme~0 := ~cp~0; {2812#true} is VALID [2020-07-10 20:23:02,538 INFO L280 TraceCheckUtils]: 79: Hoare triple {2812#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2812#true} is VALID [2020-07-10 20:23:02,538 INFO L280 TraceCheckUtils]: 80: Hoare triple {2812#true} assume 0 != #t~nondet7; {2812#true} is VALID [2020-07-10 20:23:02,539 INFO L280 TraceCheckUtils]: 81: Hoare triple {2812#true} havoc #t~nondet7; {2812#true} is VALID [2020-07-10 20:23:02,540 INFO L280 TraceCheckUtils]: 82: Hoare triple {2812#true} ~c~0 := 0; {2848#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:02,540 INFO L263 TraceCheckUtils]: 83: Hoare triple {2848#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-10 20:23:02,540 INFO L280 TraceCheckUtils]: 84: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,541 INFO L280 TraceCheckUtils]: 85: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,541 INFO L280 TraceCheckUtils]: 86: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,542 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {2812#true} {2848#(= 0 main_~c~0)} #204#return; {2848#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:02,542 INFO L263 TraceCheckUtils]: 88: Hoare triple {2848#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2812#true} is VALID [2020-07-10 20:23:02,543 INFO L280 TraceCheckUtils]: 89: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,543 INFO L280 TraceCheckUtils]: 90: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,543 INFO L280 TraceCheckUtils]: 91: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,544 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {2812#true} {2848#(= 0 main_~c~0)} #206#return; {2848#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:02,545 INFO L280 TraceCheckUtils]: 93: Hoare triple {2848#(= 0 main_~c~0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-10 20:23:02,546 INFO L263 TraceCheckUtils]: 94: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-10 20:23:02,546 INFO L280 TraceCheckUtils]: 95: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,546 INFO L280 TraceCheckUtils]: 96: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,546 INFO L280 TraceCheckUtils]: 97: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,548 INFO L275 TraceCheckUtils]: 98: Hoare quadruple {2812#true} {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #208#return; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-10 20:23:02,548 INFO L263 TraceCheckUtils]: 99: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2812#true} is VALID [2020-07-10 20:23:02,548 INFO L280 TraceCheckUtils]: 100: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-10 20:23:02,548 INFO L280 TraceCheckUtils]: 101: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-10 20:23:02,549 INFO L280 TraceCheckUtils]: 102: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-10 20:23:02,550 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {2812#true} {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #210#return; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-10 20:23:02,551 INFO L280 TraceCheckUtils]: 104: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-10 20:23:02,552 INFO L280 TraceCheckUtils]: 105: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} assume 0 != #t~nondet8; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-10 20:23:02,553 INFO L280 TraceCheckUtils]: 106: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} havoc #t~nondet8; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-10 20:23:02,554 INFO L280 TraceCheckUtils]: 107: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #t~pre9 := 1 + ~c~0; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-10 20:23:02,556 INFO L280 TraceCheckUtils]: 108: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} ~c~0 := 1 + ~c~0; {2866#(< main_~c~0 main_~tokenlen~0)} is VALID [2020-07-10 20:23:02,557 INFO L280 TraceCheckUtils]: 109: Hoare triple {2866#(< main_~c~0 main_~tokenlen~0)} havoc #t~pre9; {2866#(< main_~c~0 main_~tokenlen~0)} is VALID [2020-07-10 20:23:02,558 INFO L263 TraceCheckUtils]: 110: Hoare triple {2866#(< main_~c~0 main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {2867#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:02,559 INFO L280 TraceCheckUtils]: 111: Hoare triple {2867#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2868#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:02,559 INFO L280 TraceCheckUtils]: 112: Hoare triple {2868#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2813#false} is VALID [2020-07-10 20:23:02,560 INFO L280 TraceCheckUtils]: 113: Hoare triple {2813#false} assume !false; {2813#false} is VALID [2020-07-10 20:23:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-10 20:23:02,571 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:02,571 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1820519718] [2020-07-10 20:23:02,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:02,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:23:02,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085112904] [2020-07-10 20:23:02,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2020-07-10 20:23:02,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:02,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:23:02,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:02,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:23:02,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:02,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:23:02,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:23:02,673 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand 7 states. [2020-07-10 20:23:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:03,563 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2020-07-10 20:23:03,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 20:23:03,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2020-07-10 20:23:03,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:23:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2020-07-10 20:23:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:23:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2020-07-10 20:23:03,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 135 transitions. [2020-07-10 20:23:03,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:03,744 INFO L225 Difference]: With dead ends: 129 [2020-07-10 20:23:03,744 INFO L226 Difference]: Without dead ends: 127 [2020-07-10 20:23:03,745 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:23:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-10 20:23:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2020-07-10 20:23:04,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:04,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 119 states. [2020-07-10 20:23:04,047 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 119 states. [2020-07-10 20:23:04,047 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 119 states. [2020-07-10 20:23:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:04,052 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2020-07-10 20:23:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2020-07-10 20:23:04,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:04,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:04,054 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 127 states. [2020-07-10 20:23:04,054 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 127 states. [2020-07-10 20:23:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:04,060 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2020-07-10 20:23:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2020-07-10 20:23:04,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:04,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:04,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:04,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-10 20:23:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2020-07-10 20:23:04,067 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 114 [2020-07-10 20:23:04,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:04,068 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2020-07-10 20:23:04,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:23:04,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 119 states and 141 transitions. [2020-07-10 20:23:04,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2020-07-10 20:23:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-07-10 20:23:04,304 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:04,304 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:04,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:23:04,305 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:04,305 INFO L82 PathProgramCache]: Analyzing trace with hash -279016842, now seen corresponding path program 1 times [2020-07-10 20:23:04,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:04,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1069113142] [2020-07-10 20:23:04,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:04,496 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,496 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3623#true} {3623#true} #180#return; {3623#true} is VALID [2020-07-10 20:23:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:04,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,502 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,502 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,503 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #184#return; {3623#true} is VALID [2020-07-10 20:23:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:04,507 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,508 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,508 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #186#return; {3623#true} is VALID [2020-07-10 20:23:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:04,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,512 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,513 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #188#return; {3623#true} is VALID [2020-07-10 20:23:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:04,518 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,518 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,519 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #190#return; {3623#true} is VALID [2020-07-10 20:23:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:04,523 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,524 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,524 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #196#return; {3623#true} is VALID [2020-07-10 20:23:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:04,529 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,530 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,530 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #198#return; {3623#true} is VALID [2020-07-10 20:23:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:04,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,535 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,536 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #200#return; {3623#true} is VALID [2020-07-10 20:23:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:04,541 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,541 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,542 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,542 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #202#return; {3623#true} is VALID [2020-07-10 20:23:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:04,549 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,549 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,550 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #204#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:04,556 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,557 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,558 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #206#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:04,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,565 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,566 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #208#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:04,574 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,574 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,575 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,576 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #210#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:04,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,583 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,584 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3676#(<= 0 main_~c~0)} #212#return; {3676#(<= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,584 INFO L263 TraceCheckUtils]: 0: Hoare triple {3623#true} call ULTIMATE.init(); {3623#true} is VALID [2020-07-10 20:23:04,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,585 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3623#true} {3623#true} #180#return; {3623#true} is VALID [2020-07-10 20:23:04,585 INFO L263 TraceCheckUtils]: 3: Hoare triple {3623#true} call #t~ret11 := main(); {3623#true} is VALID [2020-07-10 20:23:04,585 INFO L280 TraceCheckUtils]: 4: Hoare triple {3623#true} havoc ~scheme~0; {3623#true} is VALID [2020-07-10 20:23:04,586 INFO L280 TraceCheckUtils]: 5: Hoare triple {3623#true} havoc ~urilen~0; {3623#true} is VALID [2020-07-10 20:23:04,586 INFO L280 TraceCheckUtils]: 6: Hoare triple {3623#true} havoc ~tokenlen~0; {3623#true} is VALID [2020-07-10 20:23:04,586 INFO L280 TraceCheckUtils]: 7: Hoare triple {3623#true} havoc ~cp~0; {3623#true} is VALID [2020-07-10 20:23:04,586 INFO L280 TraceCheckUtils]: 8: Hoare triple {3623#true} havoc ~c~0; {3623#true} is VALID [2020-07-10 20:23:04,586 INFO L280 TraceCheckUtils]: 9: Hoare triple {3623#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3623#true} is VALID [2020-07-10 20:23:04,587 INFO L280 TraceCheckUtils]: 10: Hoare triple {3623#true} ~urilen~0 := #t~nondet0; {3623#true} is VALID [2020-07-10 20:23:04,587 INFO L280 TraceCheckUtils]: 11: Hoare triple {3623#true} havoc #t~nondet0; {3623#true} is VALID [2020-07-10 20:23:04,587 INFO L280 TraceCheckUtils]: 12: Hoare triple {3623#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3623#true} is VALID [2020-07-10 20:23:04,587 INFO L280 TraceCheckUtils]: 13: Hoare triple {3623#true} ~tokenlen~0 := #t~nondet1; {3623#true} is VALID [2020-07-10 20:23:04,587 INFO L280 TraceCheckUtils]: 14: Hoare triple {3623#true} havoc #t~nondet1; {3623#true} is VALID [2020-07-10 20:23:04,588 INFO L280 TraceCheckUtils]: 15: Hoare triple {3623#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3623#true} is VALID [2020-07-10 20:23:04,588 INFO L280 TraceCheckUtils]: 16: Hoare triple {3623#true} ~scheme~0 := #t~nondet2; {3623#true} is VALID [2020-07-10 20:23:04,588 INFO L280 TraceCheckUtils]: 17: Hoare triple {3623#true} havoc #t~nondet2; {3623#true} is VALID [2020-07-10 20:23:04,588 INFO L280 TraceCheckUtils]: 18: Hoare triple {3623#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {3623#true} is VALID [2020-07-10 20:23:04,589 INFO L280 TraceCheckUtils]: 19: Hoare triple {3623#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {3623#true} is VALID [2020-07-10 20:23:04,589 INFO L280 TraceCheckUtils]: 20: Hoare triple {3623#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {3623#true} is VALID [2020-07-10 20:23:04,589 INFO L280 TraceCheckUtils]: 21: Hoare triple {3623#true} assume ~urilen~0 > 0; {3623#true} is VALID [2020-07-10 20:23:04,589 INFO L280 TraceCheckUtils]: 22: Hoare triple {3623#true} assume ~tokenlen~0 > 0; {3623#true} is VALID [2020-07-10 20:23:04,590 INFO L280 TraceCheckUtils]: 23: Hoare triple {3623#true} assume ~scheme~0 >= 0; {3623#true} is VALID [2020-07-10 20:23:04,590 INFO L280 TraceCheckUtils]: 24: Hoare triple {3623#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {3623#true} is VALID [2020-07-10 20:23:04,590 INFO L280 TraceCheckUtils]: 25: Hoare triple {3623#true} ~cp~0 := ~scheme~0; {3623#true} is VALID [2020-07-10 20:23:04,590 INFO L263 TraceCheckUtils]: 26: Hoare triple {3623#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-10 20:23:04,590 INFO L280 TraceCheckUtils]: 27: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,591 INFO L280 TraceCheckUtils]: 28: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,591 INFO L280 TraceCheckUtils]: 29: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,591 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3623#true} {3623#true} #184#return; {3623#true} is VALID [2020-07-10 20:23:04,591 INFO L263 TraceCheckUtils]: 31: Hoare triple {3623#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {3623#true} is VALID [2020-07-10 20:23:04,592 INFO L280 TraceCheckUtils]: 32: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,592 INFO L280 TraceCheckUtils]: 33: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,592 INFO L280 TraceCheckUtils]: 34: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,592 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {3623#true} {3623#true} #186#return; {3623#true} is VALID [2020-07-10 20:23:04,593 INFO L280 TraceCheckUtils]: 36: Hoare triple {3623#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3623#true} is VALID [2020-07-10 20:23:04,593 INFO L280 TraceCheckUtils]: 37: Hoare triple {3623#true} assume 0 != #t~nondet3; {3623#true} is VALID [2020-07-10 20:23:04,593 INFO L280 TraceCheckUtils]: 38: Hoare triple {3623#true} havoc #t~nondet3; {3623#true} is VALID [2020-07-10 20:23:04,593 INFO L263 TraceCheckUtils]: 39: Hoare triple {3623#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-10 20:23:04,594 INFO L280 TraceCheckUtils]: 40: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,594 INFO L280 TraceCheckUtils]: 41: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,594 INFO L280 TraceCheckUtils]: 42: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,594 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3623#true} {3623#true} #188#return; {3623#true} is VALID [2020-07-10 20:23:04,594 INFO L263 TraceCheckUtils]: 44: Hoare triple {3623#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {3623#true} is VALID [2020-07-10 20:23:04,595 INFO L280 TraceCheckUtils]: 45: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,595 INFO L280 TraceCheckUtils]: 46: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,595 INFO L280 TraceCheckUtils]: 47: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,595 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3623#true} {3623#true} #190#return; {3623#true} is VALID [2020-07-10 20:23:04,596 INFO L280 TraceCheckUtils]: 49: Hoare triple {3623#true} assume !!(~cp~0 != ~urilen~0 - 1); {3623#true} is VALID [2020-07-10 20:23:04,596 INFO L280 TraceCheckUtils]: 50: Hoare triple {3623#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3623#true} is VALID [2020-07-10 20:23:04,596 INFO L280 TraceCheckUtils]: 51: Hoare triple {3623#true} assume 0 != #t~nondet4; {3623#true} is VALID [2020-07-10 20:23:04,596 INFO L280 TraceCheckUtils]: 52: Hoare triple {3623#true} havoc #t~nondet4; {3623#true} is VALID [2020-07-10 20:23:04,596 INFO L263 TraceCheckUtils]: 53: Hoare triple {3623#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-10 20:23:04,597 INFO L280 TraceCheckUtils]: 54: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,597 INFO L280 TraceCheckUtils]: 55: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,597 INFO L280 TraceCheckUtils]: 56: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,597 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {3623#true} {3623#true} #196#return; {3623#true} is VALID [2020-07-10 20:23:04,597 INFO L263 TraceCheckUtils]: 58: Hoare triple {3623#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {3623#true} is VALID [2020-07-10 20:23:04,598 INFO L280 TraceCheckUtils]: 59: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,598 INFO L280 TraceCheckUtils]: 60: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,598 INFO L280 TraceCheckUtils]: 61: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,598 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {3623#true} {3623#true} #198#return; {3623#true} is VALID [2020-07-10 20:23:04,598 INFO L280 TraceCheckUtils]: 63: Hoare triple {3623#true} assume !(~cp~0 == ~urilen~0 - 1); {3623#true} is VALID [2020-07-10 20:23:04,599 INFO L263 TraceCheckUtils]: 64: Hoare triple {3623#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-10 20:23:04,599 INFO L280 TraceCheckUtils]: 65: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,599 INFO L280 TraceCheckUtils]: 66: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,599 INFO L280 TraceCheckUtils]: 67: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,599 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {3623#true} {3623#true} #200#return; {3623#true} is VALID [2020-07-10 20:23:04,600 INFO L263 TraceCheckUtils]: 69: Hoare triple {3623#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {3623#true} is VALID [2020-07-10 20:23:04,600 INFO L280 TraceCheckUtils]: 70: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,600 INFO L280 TraceCheckUtils]: 71: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,600 INFO L280 TraceCheckUtils]: 72: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,600 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3623#true} {3623#true} #202#return; {3623#true} is VALID [2020-07-10 20:23:04,601 INFO L280 TraceCheckUtils]: 74: Hoare triple {3623#true} assume !(1 + ~cp~0 == ~urilen~0 - 1); {3623#true} is VALID [2020-07-10 20:23:04,601 INFO L280 TraceCheckUtils]: 75: Hoare triple {3623#true} #t~pre6 := 1 + ~cp~0; {3623#true} is VALID [2020-07-10 20:23:04,601 INFO L280 TraceCheckUtils]: 76: Hoare triple {3623#true} ~cp~0 := 1 + ~cp~0; {3623#true} is VALID [2020-07-10 20:23:04,601 INFO L280 TraceCheckUtils]: 77: Hoare triple {3623#true} havoc #t~pre6; {3623#true} is VALID [2020-07-10 20:23:04,602 INFO L280 TraceCheckUtils]: 78: Hoare triple {3623#true} ~scheme~0 := ~cp~0; {3623#true} is VALID [2020-07-10 20:23:04,602 INFO L280 TraceCheckUtils]: 79: Hoare triple {3623#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3623#true} is VALID [2020-07-10 20:23:04,602 INFO L280 TraceCheckUtils]: 80: Hoare triple {3623#true} assume 0 != #t~nondet7; {3623#true} is VALID [2020-07-10 20:23:04,602 INFO L280 TraceCheckUtils]: 81: Hoare triple {3623#true} havoc #t~nondet7; {3623#true} is VALID [2020-07-10 20:23:04,603 INFO L280 TraceCheckUtils]: 82: Hoare triple {3623#true} ~c~0 := 0; {3659#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,603 INFO L263 TraceCheckUtils]: 83: Hoare triple {3659#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-10 20:23:04,604 INFO L280 TraceCheckUtils]: 84: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,604 INFO L280 TraceCheckUtils]: 85: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,604 INFO L280 TraceCheckUtils]: 86: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,605 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #204#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,606 INFO L263 TraceCheckUtils]: 88: Hoare triple {3659#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {3623#true} is VALID [2020-07-10 20:23:04,606 INFO L280 TraceCheckUtils]: 89: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,606 INFO L280 TraceCheckUtils]: 90: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,606 INFO L280 TraceCheckUtils]: 91: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,607 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #206#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,608 INFO L280 TraceCheckUtils]: 93: Hoare triple {3659#(= 0 main_~c~0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {3659#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,608 INFO L263 TraceCheckUtils]: 94: Hoare triple {3659#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-10 20:23:04,609 INFO L280 TraceCheckUtils]: 95: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,609 INFO L280 TraceCheckUtils]: 96: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,609 INFO L280 TraceCheckUtils]: 97: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,610 INFO L275 TraceCheckUtils]: 98: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #208#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,611 INFO L263 TraceCheckUtils]: 99: Hoare triple {3659#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {3623#true} is VALID [2020-07-10 20:23:04,611 INFO L280 TraceCheckUtils]: 100: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,611 INFO L280 TraceCheckUtils]: 101: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,611 INFO L280 TraceCheckUtils]: 102: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,612 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #210#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,613 INFO L280 TraceCheckUtils]: 104: Hoare triple {3659#(= 0 main_~c~0)} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3659#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,614 INFO L280 TraceCheckUtils]: 105: Hoare triple {3659#(= 0 main_~c~0)} assume 0 != #t~nondet8; {3659#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,615 INFO L280 TraceCheckUtils]: 106: Hoare triple {3659#(= 0 main_~c~0)} havoc #t~nondet8; {3659#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,616 INFO L280 TraceCheckUtils]: 107: Hoare triple {3659#(= 0 main_~c~0)} #t~pre9 := 1 + ~c~0; {3659#(= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,617 INFO L280 TraceCheckUtils]: 108: Hoare triple {3659#(= 0 main_~c~0)} ~c~0 := 1 + ~c~0; {3676#(<= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,617 INFO L280 TraceCheckUtils]: 109: Hoare triple {3676#(<= 0 main_~c~0)} havoc #t~pre9; {3676#(<= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,618 INFO L263 TraceCheckUtils]: 110: Hoare triple {3676#(<= 0 main_~c~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {3623#true} is VALID [2020-07-10 20:23:04,618 INFO L280 TraceCheckUtils]: 111: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-10 20:23:04,618 INFO L280 TraceCheckUtils]: 112: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-10 20:23:04,618 INFO L280 TraceCheckUtils]: 113: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-10 20:23:04,619 INFO L275 TraceCheckUtils]: 114: Hoare quadruple {3623#true} {3676#(<= 0 main_~c~0)} #212#return; {3676#(<= 0 main_~c~0)} is VALID [2020-07-10 20:23:04,620 INFO L263 TraceCheckUtils]: 115: Hoare triple {3676#(<= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {3681#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:04,621 INFO L280 TraceCheckUtils]: 116: Hoare triple {3681#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3682#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:04,621 INFO L280 TraceCheckUtils]: 117: Hoare triple {3682#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3624#false} is VALID [2020-07-10 20:23:04,622 INFO L280 TraceCheckUtils]: 118: Hoare triple {3624#false} assume !false; {3624#false} is VALID [2020-07-10 20:23:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-10 20:23:04,631 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:04,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1069113142] [2020-07-10 20:23:04,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:04,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:23:04,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412719714] [2020-07-10 20:23:04,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-07-10 20:23:04,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:04,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:23:04,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:04,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:23:04,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:04,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:23:04,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:23:04,736 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 6 states. [2020-07-10 20:23:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:05,507 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2020-07-10 20:23:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 20:23:05,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-07-10 20:23:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:23:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2020-07-10 20:23:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:23:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2020-07-10 20:23:05,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 121 transitions. [2020-07-10 20:23:05,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:05,672 INFO L225 Difference]: With dead ends: 125 [2020-07-10 20:23:05,672 INFO L226 Difference]: Without dead ends: 123 [2020-07-10 20:23:05,673 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:23:05,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-07-10 20:23:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-07-10 20:23:05,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:05,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 123 states. [2020-07-10 20:23:05,948 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2020-07-10 20:23:05,948 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2020-07-10 20:23:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:05,954 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2020-07-10 20:23:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2020-07-10 20:23:05,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:05,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:05,955 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2020-07-10 20:23:05,955 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2020-07-10 20:23:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:05,961 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2020-07-10 20:23:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2020-07-10 20:23:05,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:05,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:05,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:05,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:05,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-10 20:23:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2020-07-10 20:23:05,968 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 119 [2020-07-10 20:23:05,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:05,968 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2020-07-10 20:23:05,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:23:05,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 123 states and 144 transitions. [2020-07-10 20:23:06,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2020-07-10 20:23:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-07-10 20:23:06,211 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:06,211 INFO L422 BasicCegarLoop]: trace histogram [19, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:06,212 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 20:23:06,212 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:06,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:06,212 INFO L82 PathProgramCache]: Analyzing trace with hash 486899888, now seen corresponding path program 1 times [2020-07-10 20:23:06,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:06,213 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [433289198] [2020-07-10 20:23:06,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,360 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4429#true} {4429#true} #180#return; {4429#true} is VALID [2020-07-10 20:23:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,369 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,370 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,370 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,370 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #184#return; {4429#true} is VALID [2020-07-10 20:23:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,375 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,376 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #186#return; {4429#true} is VALID [2020-07-10 20:23:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,380 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,380 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,381 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,381 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #188#return; {4429#true} is VALID [2020-07-10 20:23:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,387 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,387 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #190#return; {4429#true} is VALID [2020-07-10 20:23:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,401 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,401 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #196#return; {4429#true} is VALID [2020-07-10 20:23:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,413 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,414 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,414 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #198#return; {4429#true} is VALID [2020-07-10 20:23:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,422 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,423 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,423 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #200#return; {4429#true} is VALID [2020-07-10 20:23:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,427 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,428 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,428 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #202#return; {4429#true} is VALID [2020-07-10 20:23:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,432 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,432 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,433 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,433 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #204#return; {4429#true} is VALID [2020-07-10 20:23:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,440 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,441 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #206#return; {4429#true} is VALID [2020-07-10 20:23:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,444 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,445 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,445 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #208#return; {4429#true} is VALID [2020-07-10 20:23:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,452 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,452 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #210#return; {4429#true} is VALID [2020-07-10 20:23:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,457 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,458 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,458 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #212#return; {4429#true} is VALID [2020-07-10 20:23:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,462 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,462 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,462 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,463 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #214#return; {4429#true} is VALID [2020-07-10 20:23:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,491 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,492 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,492 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #216#return; {4429#true} is VALID [2020-07-10 20:23:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,513 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,513 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #218#return; {4429#true} is VALID [2020-07-10 20:23:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,526 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,527 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,527 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,529 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} #208#return; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-10 20:23:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:06,536 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,537 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,537 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,538 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} #210#return; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-10 20:23:06,539 INFO L263 TraceCheckUtils]: 0: Hoare triple {4429#true} call ULTIMATE.init(); {4429#true} is VALID [2020-07-10 20:23:06,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,540 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4429#true} {4429#true} #180#return; {4429#true} is VALID [2020-07-10 20:23:06,540 INFO L263 TraceCheckUtils]: 3: Hoare triple {4429#true} call #t~ret11 := main(); {4429#true} is VALID [2020-07-10 20:23:06,540 INFO L280 TraceCheckUtils]: 4: Hoare triple {4429#true} havoc ~scheme~0; {4429#true} is VALID [2020-07-10 20:23:06,540 INFO L280 TraceCheckUtils]: 5: Hoare triple {4429#true} havoc ~urilen~0; {4429#true} is VALID [2020-07-10 20:23:06,541 INFO L280 TraceCheckUtils]: 6: Hoare triple {4429#true} havoc ~tokenlen~0; {4429#true} is VALID [2020-07-10 20:23:06,541 INFO L280 TraceCheckUtils]: 7: Hoare triple {4429#true} havoc ~cp~0; {4429#true} is VALID [2020-07-10 20:23:06,541 INFO L280 TraceCheckUtils]: 8: Hoare triple {4429#true} havoc ~c~0; {4429#true} is VALID [2020-07-10 20:23:06,541 INFO L280 TraceCheckUtils]: 9: Hoare triple {4429#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4429#true} is VALID [2020-07-10 20:23:06,541 INFO L280 TraceCheckUtils]: 10: Hoare triple {4429#true} ~urilen~0 := #t~nondet0; {4429#true} is VALID [2020-07-10 20:23:06,542 INFO L280 TraceCheckUtils]: 11: Hoare triple {4429#true} havoc #t~nondet0; {4429#true} is VALID [2020-07-10 20:23:06,542 INFO L280 TraceCheckUtils]: 12: Hoare triple {4429#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4429#true} is VALID [2020-07-10 20:23:06,542 INFO L280 TraceCheckUtils]: 13: Hoare triple {4429#true} ~tokenlen~0 := #t~nondet1; {4429#true} is VALID [2020-07-10 20:23:06,542 INFO L280 TraceCheckUtils]: 14: Hoare triple {4429#true} havoc #t~nondet1; {4429#true} is VALID [2020-07-10 20:23:06,543 INFO L280 TraceCheckUtils]: 15: Hoare triple {4429#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4429#true} is VALID [2020-07-10 20:23:06,543 INFO L280 TraceCheckUtils]: 16: Hoare triple {4429#true} ~scheme~0 := #t~nondet2; {4429#true} is VALID [2020-07-10 20:23:06,543 INFO L280 TraceCheckUtils]: 17: Hoare triple {4429#true} havoc #t~nondet2; {4429#true} is VALID [2020-07-10 20:23:06,543 INFO L280 TraceCheckUtils]: 18: Hoare triple {4429#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {4429#true} is VALID [2020-07-10 20:23:06,543 INFO L280 TraceCheckUtils]: 19: Hoare triple {4429#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {4429#true} is VALID [2020-07-10 20:23:06,544 INFO L280 TraceCheckUtils]: 20: Hoare triple {4429#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {4429#true} is VALID [2020-07-10 20:23:06,544 INFO L280 TraceCheckUtils]: 21: Hoare triple {4429#true} assume ~urilen~0 > 0; {4429#true} is VALID [2020-07-10 20:23:06,544 INFO L280 TraceCheckUtils]: 22: Hoare triple {4429#true} assume ~tokenlen~0 > 0; {4429#true} is VALID [2020-07-10 20:23:06,544 INFO L280 TraceCheckUtils]: 23: Hoare triple {4429#true} assume ~scheme~0 >= 0; {4429#true} is VALID [2020-07-10 20:23:06,545 INFO L280 TraceCheckUtils]: 24: Hoare triple {4429#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {4429#true} is VALID [2020-07-10 20:23:06,545 INFO L280 TraceCheckUtils]: 25: Hoare triple {4429#true} ~cp~0 := ~scheme~0; {4429#true} is VALID [2020-07-10 20:23:06,545 INFO L263 TraceCheckUtils]: 26: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,545 INFO L280 TraceCheckUtils]: 27: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,545 INFO L280 TraceCheckUtils]: 28: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,546 INFO L280 TraceCheckUtils]: 29: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,546 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {4429#true} {4429#true} #184#return; {4429#true} is VALID [2020-07-10 20:23:06,546 INFO L263 TraceCheckUtils]: 31: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,546 INFO L280 TraceCheckUtils]: 32: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,546 INFO L280 TraceCheckUtils]: 33: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,547 INFO L280 TraceCheckUtils]: 34: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,547 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {4429#true} {4429#true} #186#return; {4429#true} is VALID [2020-07-10 20:23:06,547 INFO L280 TraceCheckUtils]: 36: Hoare triple {4429#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4429#true} is VALID [2020-07-10 20:23:06,547 INFO L280 TraceCheckUtils]: 37: Hoare triple {4429#true} assume 0 != #t~nondet3; {4429#true} is VALID [2020-07-10 20:23:06,548 INFO L280 TraceCheckUtils]: 38: Hoare triple {4429#true} havoc #t~nondet3; {4429#true} is VALID [2020-07-10 20:23:06,548 INFO L263 TraceCheckUtils]: 39: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,548 INFO L280 TraceCheckUtils]: 40: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,548 INFO L280 TraceCheckUtils]: 41: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,548 INFO L280 TraceCheckUtils]: 42: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,549 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4429#true} {4429#true} #188#return; {4429#true} is VALID [2020-07-10 20:23:06,549 INFO L263 TraceCheckUtils]: 44: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,549 INFO L280 TraceCheckUtils]: 45: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,549 INFO L280 TraceCheckUtils]: 46: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,549 INFO L280 TraceCheckUtils]: 47: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,550 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {4429#true} {4429#true} #190#return; {4429#true} is VALID [2020-07-10 20:23:06,550 INFO L280 TraceCheckUtils]: 49: Hoare triple {4429#true} assume !!(~cp~0 != ~urilen~0 - 1); {4429#true} is VALID [2020-07-10 20:23:06,550 INFO L280 TraceCheckUtils]: 50: Hoare triple {4429#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4429#true} is VALID [2020-07-10 20:23:06,550 INFO L280 TraceCheckUtils]: 51: Hoare triple {4429#true} assume 0 != #t~nondet4; {4429#true} is VALID [2020-07-10 20:23:06,550 INFO L280 TraceCheckUtils]: 52: Hoare triple {4429#true} havoc #t~nondet4; {4429#true} is VALID [2020-07-10 20:23:06,551 INFO L263 TraceCheckUtils]: 53: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,551 INFO L280 TraceCheckUtils]: 54: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,551 INFO L280 TraceCheckUtils]: 55: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,551 INFO L280 TraceCheckUtils]: 56: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,552 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {4429#true} {4429#true} #196#return; {4429#true} is VALID [2020-07-10 20:23:06,552 INFO L263 TraceCheckUtils]: 58: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,552 INFO L280 TraceCheckUtils]: 59: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,552 INFO L280 TraceCheckUtils]: 60: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,553 INFO L280 TraceCheckUtils]: 61: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,553 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {4429#true} {4429#true} #198#return; {4429#true} is VALID [2020-07-10 20:23:06,553 INFO L280 TraceCheckUtils]: 63: Hoare triple {4429#true} assume !(~cp~0 == ~urilen~0 - 1); {4429#true} is VALID [2020-07-10 20:23:06,553 INFO L263 TraceCheckUtils]: 64: Hoare triple {4429#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,553 INFO L280 TraceCheckUtils]: 65: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,554 INFO L280 TraceCheckUtils]: 66: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,554 INFO L280 TraceCheckUtils]: 67: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,554 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {4429#true} {4429#true} #200#return; {4429#true} is VALID [2020-07-10 20:23:06,555 INFO L263 TraceCheckUtils]: 69: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,555 INFO L280 TraceCheckUtils]: 70: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,555 INFO L280 TraceCheckUtils]: 71: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,555 INFO L280 TraceCheckUtils]: 72: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,555 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {4429#true} {4429#true} #202#return; {4429#true} is VALID [2020-07-10 20:23:06,556 INFO L280 TraceCheckUtils]: 74: Hoare triple {4429#true} assume !(1 + ~cp~0 == ~urilen~0 - 1); {4429#true} is VALID [2020-07-10 20:23:06,556 INFO L280 TraceCheckUtils]: 75: Hoare triple {4429#true} #t~pre6 := 1 + ~cp~0; {4429#true} is VALID [2020-07-10 20:23:06,556 INFO L280 TraceCheckUtils]: 76: Hoare triple {4429#true} ~cp~0 := 1 + ~cp~0; {4429#true} is VALID [2020-07-10 20:23:06,556 INFO L280 TraceCheckUtils]: 77: Hoare triple {4429#true} havoc #t~pre6; {4429#true} is VALID [2020-07-10 20:23:06,557 INFO L280 TraceCheckUtils]: 78: Hoare triple {4429#true} ~scheme~0 := ~cp~0; {4429#true} is VALID [2020-07-10 20:23:06,557 INFO L280 TraceCheckUtils]: 79: Hoare triple {4429#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {4429#true} is VALID [2020-07-10 20:23:06,557 INFO L280 TraceCheckUtils]: 80: Hoare triple {4429#true} assume 0 != #t~nondet7; {4429#true} is VALID [2020-07-10 20:23:06,557 INFO L280 TraceCheckUtils]: 81: Hoare triple {4429#true} havoc #t~nondet7; {4429#true} is VALID [2020-07-10 20:23:06,558 INFO L280 TraceCheckUtils]: 82: Hoare triple {4429#true} ~c~0 := 0; {4429#true} is VALID [2020-07-10 20:23:06,558 INFO L263 TraceCheckUtils]: 83: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,558 INFO L280 TraceCheckUtils]: 84: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,558 INFO L280 TraceCheckUtils]: 85: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,558 INFO L280 TraceCheckUtils]: 86: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,559 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {4429#true} {4429#true} #204#return; {4429#true} is VALID [2020-07-10 20:23:06,559 INFO L263 TraceCheckUtils]: 88: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,559 INFO L280 TraceCheckUtils]: 89: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,559 INFO L280 TraceCheckUtils]: 90: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,560 INFO L280 TraceCheckUtils]: 91: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,560 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {4429#true} {4429#true} #206#return; {4429#true} is VALID [2020-07-10 20:23:06,560 INFO L280 TraceCheckUtils]: 93: Hoare triple {4429#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {4429#true} is VALID [2020-07-10 20:23:06,561 INFO L263 TraceCheckUtils]: 94: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,561 INFO L280 TraceCheckUtils]: 95: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,561 INFO L280 TraceCheckUtils]: 96: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,561 INFO L280 TraceCheckUtils]: 97: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,561 INFO L275 TraceCheckUtils]: 98: Hoare quadruple {4429#true} {4429#true} #208#return; {4429#true} is VALID [2020-07-10 20:23:06,562 INFO L263 TraceCheckUtils]: 99: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,562 INFO L280 TraceCheckUtils]: 100: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,562 INFO L280 TraceCheckUtils]: 101: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,562 INFO L280 TraceCheckUtils]: 102: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,563 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {4429#true} {4429#true} #210#return; {4429#true} is VALID [2020-07-10 20:23:06,563 INFO L280 TraceCheckUtils]: 104: Hoare triple {4429#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4429#true} is VALID [2020-07-10 20:23:06,563 INFO L280 TraceCheckUtils]: 105: Hoare triple {4429#true} assume 0 != #t~nondet8; {4429#true} is VALID [2020-07-10 20:23:06,563 INFO L280 TraceCheckUtils]: 106: Hoare triple {4429#true} havoc #t~nondet8; {4429#true} is VALID [2020-07-10 20:23:06,564 INFO L280 TraceCheckUtils]: 107: Hoare triple {4429#true} #t~pre9 := 1 + ~c~0; {4429#true} is VALID [2020-07-10 20:23:06,564 INFO L280 TraceCheckUtils]: 108: Hoare triple {4429#true} ~c~0 := 1 + ~c~0; {4429#true} is VALID [2020-07-10 20:23:06,564 INFO L280 TraceCheckUtils]: 109: Hoare triple {4429#true} havoc #t~pre9; {4429#true} is VALID [2020-07-10 20:23:06,564 INFO L263 TraceCheckUtils]: 110: Hoare triple {4429#true} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,565 INFO L280 TraceCheckUtils]: 111: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,565 INFO L280 TraceCheckUtils]: 112: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,565 INFO L280 TraceCheckUtils]: 113: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,565 INFO L275 TraceCheckUtils]: 114: Hoare quadruple {4429#true} {4429#true} #212#return; {4429#true} is VALID [2020-07-10 20:23:06,566 INFO L263 TraceCheckUtils]: 115: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,566 INFO L280 TraceCheckUtils]: 116: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,566 INFO L280 TraceCheckUtils]: 117: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,566 INFO L280 TraceCheckUtils]: 118: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,567 INFO L275 TraceCheckUtils]: 119: Hoare quadruple {4429#true} {4429#true} #214#return; {4429#true} is VALID [2020-07-10 20:23:06,567 INFO L263 TraceCheckUtils]: 120: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,567 INFO L280 TraceCheckUtils]: 121: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,568 INFO L280 TraceCheckUtils]: 122: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,568 INFO L280 TraceCheckUtils]: 123: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,568 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {4429#true} {4429#true} #216#return; {4429#true} is VALID [2020-07-10 20:23:06,569 INFO L263 TraceCheckUtils]: 125: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,569 INFO L280 TraceCheckUtils]: 126: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,569 INFO L280 TraceCheckUtils]: 127: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,569 INFO L280 TraceCheckUtils]: 128: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,569 INFO L275 TraceCheckUtils]: 129: Hoare quadruple {4429#true} {4429#true} #218#return; {4429#true} is VALID [2020-07-10 20:23:06,570 INFO L280 TraceCheckUtils]: 130: Hoare triple {4429#true} #t~pre10 := 1 + ~cp~0; {4429#true} is VALID [2020-07-10 20:23:06,570 INFO L280 TraceCheckUtils]: 131: Hoare triple {4429#true} ~cp~0 := 1 + ~cp~0; {4429#true} is VALID [2020-07-10 20:23:06,570 INFO L280 TraceCheckUtils]: 132: Hoare triple {4429#true} havoc #t~pre10; {4429#true} is VALID [2020-07-10 20:23:06,574 INFO L280 TraceCheckUtils]: 133: Hoare triple {4429#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-10 20:23:06,574 INFO L263 TraceCheckUtils]: 134: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,575 INFO L280 TraceCheckUtils]: 135: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,575 INFO L280 TraceCheckUtils]: 136: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,575 INFO L280 TraceCheckUtils]: 137: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,576 INFO L275 TraceCheckUtils]: 138: Hoare quadruple {4429#true} {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} #208#return; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-10 20:23:06,576 INFO L263 TraceCheckUtils]: 139: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-10 20:23:06,577 INFO L280 TraceCheckUtils]: 140: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-10 20:23:06,577 INFO L280 TraceCheckUtils]: 141: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-10 20:23:06,577 INFO L280 TraceCheckUtils]: 142: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-10 20:23:06,578 INFO L275 TraceCheckUtils]: 143: Hoare quadruple {4429#true} {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} #210#return; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-10 20:23:06,579 INFO L280 TraceCheckUtils]: 144: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-10 20:23:06,580 INFO L280 TraceCheckUtils]: 145: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume 0 != #t~nondet8; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-10 20:23:06,580 INFO L280 TraceCheckUtils]: 146: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} havoc #t~nondet8; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-10 20:23:06,581 INFO L280 TraceCheckUtils]: 147: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} #t~pre9 := 1 + ~c~0; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-10 20:23:06,582 INFO L280 TraceCheckUtils]: 148: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} ~c~0 := 1 + ~c~0; {4506#(<= (+ main_~c~0 1) main_~tokenlen~0)} is VALID [2020-07-10 20:23:06,583 INFO L280 TraceCheckUtils]: 149: Hoare triple {4506#(<= (+ main_~c~0 1) main_~tokenlen~0)} havoc #t~pre9; {4506#(<= (+ main_~c~0 1) main_~tokenlen~0)} is VALID [2020-07-10 20:23:06,584 INFO L263 TraceCheckUtils]: 150: Hoare triple {4506#(<= (+ main_~c~0 1) main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {4507#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:06,585 INFO L280 TraceCheckUtils]: 151: Hoare triple {4507#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4508#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:06,586 INFO L280 TraceCheckUtils]: 152: Hoare triple {4508#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4430#false} is VALID [2020-07-10 20:23:06,587 INFO L280 TraceCheckUtils]: 153: Hoare triple {4430#false} assume !false; {4430#false} is VALID [2020-07-10 20:23:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2020-07-10 20:23:06,633 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:06,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [433289198] [2020-07-10 20:23:06,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:06,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:23:06,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97864441] [2020-07-10 20:23:06,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2020-07-10 20:23:06,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:06,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:23:06,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:06,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:23:06,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:06,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:23:06,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:23:06,751 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand 6 states. [2020-07-10 20:23:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:07,500 INFO L93 Difference]: Finished difference Result 128 states and 149 transitions. [2020-07-10 20:23:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 20:23:07,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2020-07-10 20:23:07,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:23:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2020-07-10 20:23:07,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:23:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2020-07-10 20:23:07,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 109 transitions. [2020-07-10 20:23:07,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:07,641 INFO L225 Difference]: With dead ends: 128 [2020-07-10 20:23:07,642 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:23:07,643 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:23:07,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:23:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:23:07,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:07,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:23:07,644 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:23:07,644 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:23:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:07,645 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:23:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:23:07,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:07,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:07,645 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:23:07,645 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:23:07,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:07,646 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:23:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:23:07,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:07,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:07,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:07,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:23:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:23:07,647 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2020-07-10 20:23:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:07,648 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:23:07,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:23:07,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:23:07,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:23:07,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:07,649 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 20:23:07,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:23:09,668 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:23:09,668 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:23:09,668 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:23:09,668 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:23:09,668 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:23:09,669 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:23:09,669 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:23:09,669 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:23:09,669 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 20:23:09,669 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-10 20:23:09,669 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:23:09,669 INFO L264 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,670 INFO L264 CegarLoopResult]: At program point L60-1(line 60) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,670 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 72) the Hoare annotation is: true [2020-07-10 20:23:09,670 INFO L264 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (= 0 main_~c~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,670 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-10 20:23:09,670 INFO L264 CegarLoopResult]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (= 0 main_~c~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,670 INFO L271 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: true [2020-07-10 20:23:09,671 INFO L271 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: true [2020-07-10 20:23:09,671 INFO L264 CegarLoopResult]: At program point L36-1(lines 35 41) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,671 INFO L264 CegarLoopResult]: At program point L36-2(lines 36 41) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2020-07-10 20:23:09,671 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,671 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-10 20:23:09,671 INFO L271 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-07-10 20:23:09,672 INFO L271 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-07-10 20:23:09,672 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,672 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,672 INFO L271 CegarLoopResult]: At program point L70(lines 14 72) the Hoare annotation is: true [2020-07-10 20:23:09,672 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,673 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,673 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,673 INFO L264 CegarLoopResult]: At program point L37-4(line 37) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,673 INFO L264 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,673 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-10 20:23:09,673 INFO L264 CegarLoopResult]: At program point L54-1(lines 53 66) the Hoare annotation is: (let ((.cse0 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse1 (< 0 main_~scheme~0)) (.cse2 (<= 1 main_~cp~0)) (.cse3 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 .cse1 .cse2 (= 0 main_~c~0) .cse3) (and .cse0 (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) .cse1 .cse2 .cse3))) [2020-07-10 20:23:09,673 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-10 20:23:09,674 INFO L264 CegarLoopResult]: At program point L46(lines 33 69) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,674 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 72) the Hoare annotation is: true [2020-07-10 20:23:09,674 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,674 INFO L264 CegarLoopResult]: At program point L38-1(line 38) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,674 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0)) [2020-07-10 20:23:09,674 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 72) the Hoare annotation is: true [2020-07-10 20:23:09,675 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-10 20:23:09,675 INFO L271 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: true [2020-07-10 20:23:09,675 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,675 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,675 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,675 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,675 INFO L271 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-07-10 20:23:09,676 INFO L264 CegarLoopResult]: At program point L56-1(line 56) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,676 INFO L271 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-07-10 20:23:09,676 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,676 INFO L264 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,676 INFO L264 CegarLoopResult]: At program point L48-2(line 48) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,676 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,677 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,677 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,677 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,677 INFO L264 CegarLoopResult]: At program point L65-1(line 65) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,677 INFO L264 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,677 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-10 20:23:09,677 INFO L271 CegarLoopResult]: At program point L24-1(lines 14 72) the Hoare annotation is: true [2020-07-10 20:23:09,677 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,678 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-10 20:23:09,678 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-10 20:23:09,678 INFO L264 CegarLoopResult]: At program point L33(lines 33 69) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,678 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,678 INFO L264 CegarLoopResult]: At program point L33-3(line 33) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~cp~0 1) main_~urilen~0)) [2020-07-10 20:23:09,678 INFO L264 CegarLoopResult]: At program point L58(lines 58 64) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,679 INFO L271 CegarLoopResult]: At program point L25(lines 14 72) the Hoare annotation is: true [2020-07-10 20:23:09,679 INFO L264 CegarLoopResult]: At program point L58-1(line 58) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,679 INFO L264 CegarLoopResult]: At program point L58-2(line 58) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,679 INFO L264 CegarLoopResult]: At program point L58-3(lines 58 64) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,679 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,679 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-10 20:23:09,680 INFO L264 CegarLoopResult]: At program point L50-1(lines 50 68) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,680 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-10 20:23:09,680 INFO L264 CegarLoopResult]: At program point L50-2(line 50) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,680 INFO L271 CegarLoopResult]: At program point L50-3(line 50) the Hoare annotation is: true [2020-07-10 20:23:09,680 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,681 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,681 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,681 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,681 INFO L264 CegarLoopResult]: At program point L26(lines 14 72) the Hoare annotation is: (< 0 (+ main_~scheme~0 1)) [2020-07-10 20:23:09,682 INFO L264 CegarLoopResult]: At program point L59-1(line 59) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,682 INFO L264 CegarLoopResult]: At program point L59-2(line 59) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,682 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,682 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-10 20:23:09,682 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-10 20:23:09,682 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-10 20:23:09,683 INFO L264 CegarLoopResult]: At program point L43(lines 33 69) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 20:23:09,683 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 20:23:09,683 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:23:09,683 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:23:09,683 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:23:09,684 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:23:09,684 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:23:09,690 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:23:09,698 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:23:09,698 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:23:09,699 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-10 20:23:09,700 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-10 20:23:09,763 INFO L163 areAnnotationChecker]: CFG has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:23:09,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:23:09 BoogieIcfgContainer [2020-07-10 20:23:09,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:23:09,793 INFO L168 Benchmark]: Toolchain (without parser) took 17387.47 ms. Allocated memory was 144.7 MB in the beginning and 381.2 MB in the end (delta: 236.5 MB). Free memory was 103.5 MB in the beginning and 103.2 MB in the end (delta: 328.5 kB). Peak memory consumption was 236.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:23:09,800 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 20:23:09,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.79 ms. Allocated memory is still 144.7 MB. Free memory was 103.3 MB in the beginning and 92.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:23:09,803 INFO L168 Benchmark]: Boogie Preprocessor took 143.70 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 92.2 MB in the beginning and 180.0 MB in the end (delta: -87.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:23:09,804 INFO L168 Benchmark]: RCFGBuilder took 783.48 ms. Allocated memory is still 201.9 MB. Free memory was 180.0 MB in the beginning and 136.6 MB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:23:09,804 INFO L168 Benchmark]: TraceAbstraction took 16054.19 ms. Allocated memory was 201.9 MB in the beginning and 381.2 MB in the end (delta: 179.3 MB). Free memory was 136.6 MB in the beginning and 103.2 MB in the end (delta: 33.5 MB). Peak memory consumption was 212.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:23:09,815 INFO L336 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.41 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 398.79 ms. Allocated memory is still 144.7 MB. Free memory was 103.3 MB in the beginning and 92.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.70 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 92.2 MB in the beginning and 180.0 MB in the end (delta: -87.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 783.48 ms. Allocated memory is still 201.9 MB. Free memory was 180.0 MB in the beginning and 136.6 MB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16054.19 ms. Allocated memory was 201.9 MB in the beginning and 381.2 MB in the end (delta: 179.3 MB). Free memory was 136.6 MB in the beginning and 103.2 MB in the end (delta: 33.5 MB). Peak memory consumption was 212.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((scheme + 1 <= urilen && 0 < scheme) && 1 <= cp) && cp < urilen - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((scheme + 1 <= urilen && 0 < scheme) && 1 <= cp) && 0 == c) && cp < urilen) || (((((scheme + 1 <= urilen && c + 1 <= tokenlen) && 0 <= c) && 0 < scheme) && 1 <= cp) && cp < urilen) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.8s, OverallIterations: 7, TraceHistogramMax: 19, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 681 SDtfs, 320 SDslu, 1933 SDs, 0 SdLazy, 490 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 92 LocationsWithAnnotation, 398 PreInvPairs, 536 NumberOfFragments, 1170 HoareAnnotationTreeSize, 398 FomulaSimplifications, 795 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 92 FomulaSimplificationsInter, 565 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...