/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:28:26,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:28:26,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:28:26,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:28:26,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:28:26,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:28:26,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:28:26,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:28:26,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:28:26,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:28:26,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:28:26,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:28:26,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:28:26,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:28:26,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:28:26,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:28:26,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:28:26,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:28:26,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:28:26,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:28:26,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:28:26,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:28:26,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:28:26,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:28:26,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:28:26,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:28:26,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:28:26,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:28:26,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:28:26,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:28:26,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:28:26,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:28:26,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:28:26,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:28:26,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:28:26,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:28:26,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:28:26,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:28:26,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:28:26,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:28:26,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:28:26,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:28:26,443 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:28:26,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:28:26,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:28:26,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:28:26,445 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:28:26,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:28:26,446 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:28:26,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:28:26,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:28:26,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:28:26,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:28:26,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:28:26,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:28:26,447 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:28:26,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:28:26,447 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:28:26,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:28:26,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:28:26,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:28:26,448 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:28:26,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:28:26,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:28:26,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:28:26,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:28:26,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:28:26,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:28:26,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:28:26,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:28:26,450 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:28:26,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:28:26,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:28:26,774 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:28:26,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:28:26,779 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:28:26,779 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:28:26,780 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 15:28:26,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb5bdf88/02f5de89a35441b4a5262ee6957a9de3/FLAGa877f82be [2020-07-10 15:28:27,312 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:28:27,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-07-10 15:28:27,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb5bdf88/02f5de89a35441b4a5262ee6957a9de3/FLAGa877f82be [2020-07-10 15:28:27,694 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb5bdf88/02f5de89a35441b4a5262ee6957a9de3 [2020-07-10 15:28:27,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:28:27,707 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:28:27,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:27,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:28:27,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:28:27,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8154e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27, skipping insertion in model container [2020-07-10 15:28:27,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:28:27,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:28:27,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:27,969 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:28:27,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:28,013 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:28:28,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28 WrapperNode [2020-07-10 15:28:28,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:28,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:28:28,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:28:28,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:28:28,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:28:28,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:28:28,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:28:28,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:28:28,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (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 15:28:28,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:28:28,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:28:28,215 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:28:28,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:28:28,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:28:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:28:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:28:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:28:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:28:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:28:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:28:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:28:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:28:28,792 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:28:28,793 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 15:28:28,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:28 BoogieIcfgContainer [2020-07-10 15:28:28,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:28:28,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:28:28,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:28:28,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:28:28,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:28:27" (1/3) ... [2020-07-10 15:28:28,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363945a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:28, skipping insertion in model container [2020-07-10 15:28:28,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (2/3) ... [2020-07-10 15:28:28,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363945a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:28, skipping insertion in model container [2020-07-10 15:28:28,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:28" (3/3) ... [2020-07-10 15:28:28,807 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2020-07-10 15:28:28,819 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:28:28,827 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:28:28,840 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:28:28,866 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:28:28,867 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:28:28,867 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:28:28,867 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:28:28,867 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:28:28,868 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:28:28,868 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:28:28,868 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:28:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2020-07-10 15:28:28,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:28:28,893 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:28,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:28,894 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:28,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:28,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1626077920, now seen corresponding path program 1 times [2020-07-10 15:28:28,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:28,909 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557057101] [2020-07-10 15:28:28,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,162 INFO L280 TraceCheckUtils]: 0: Hoare triple {56#true} assume true; {56#true} is VALID [2020-07-10 15:28:29,163 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {56#true} {56#true} #140#return; {56#true} is VALID [2020-07-10 15:28:29,165 INFO L263 TraceCheckUtils]: 0: Hoare triple {56#true} call ULTIMATE.init(); {56#true} is VALID [2020-07-10 15:28:29,166 INFO L280 TraceCheckUtils]: 1: Hoare triple {56#true} assume true; {56#true} is VALID [2020-07-10 15:28:29,166 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {56#true} {56#true} #140#return; {56#true} is VALID [2020-07-10 15:28:29,167 INFO L263 TraceCheckUtils]: 3: Hoare triple {56#true} call #t~ret11 := main(); {56#true} is VALID [2020-07-10 15:28:29,167 INFO L280 TraceCheckUtils]: 4: Hoare triple {56#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~scheme~0 := #t~nondet2;havoc #t~nondet2; {56#true} is VALID [2020-07-10 15:28:29,168 INFO L280 TraceCheckUtils]: 5: Hoare triple {56#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {56#true} is VALID [2020-07-10 15:28:29,168 INFO L280 TraceCheckUtils]: 6: Hoare triple {56#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {56#true} is VALID [2020-07-10 15:28:29,169 INFO L280 TraceCheckUtils]: 7: Hoare triple {56#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {56#true} is VALID [2020-07-10 15:28:29,169 INFO L280 TraceCheckUtils]: 8: Hoare triple {56#true} assume ~urilen~0 > 0; {56#true} is VALID [2020-07-10 15:28:29,170 INFO L280 TraceCheckUtils]: 9: Hoare triple {56#true} assume ~tokenlen~0 > 0; {56#true} is VALID [2020-07-10 15:28:29,170 INFO L280 TraceCheckUtils]: 10: Hoare triple {56#true} assume ~scheme~0 >= 0; {56#true} is VALID [2020-07-10 15:28:29,172 INFO L280 TraceCheckUtils]: 11: Hoare triple {56#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {60#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-10 15:28:29,174 INFO L263 TraceCheckUtils]: 12: Hoare triple {60#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {61#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:29,176 INFO L280 TraceCheckUtils]: 13: Hoare triple {61#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {62#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:29,177 INFO L280 TraceCheckUtils]: 14: Hoare triple {62#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {57#false} is VALID [2020-07-10 15:28:29,177 INFO L280 TraceCheckUtils]: 15: Hoare triple {57#false} assume !false; {57#false} is VALID [2020-07-10 15:28:29,180 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 15:28:29,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557057101] [2020-07-10 15:28:29,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:29,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:29,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354557067] [2020-07-10 15:28:29,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-10 15:28:29,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:29,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:29,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:29,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:29,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:29,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:29,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:29,269 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 5 states. [2020-07-10 15:28:30,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:30,034 INFO L93 Difference]: Finished difference Result 111 states and 206 transitions. [2020-07-10 15:28:30,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:30,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-10 15:28:30,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:30,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2020-07-10 15:28:30,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2020-07-10 15:28:30,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 206 transitions. [2020-07-10 15:28:30,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:30,390 INFO L225 Difference]: With dead ends: 111 [2020-07-10 15:28:30,390 INFO L226 Difference]: Without dead ends: 63 [2020-07-10 15:28:30,396 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:30,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-10 15:28:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2020-07-10 15:28:30,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:30,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 56 states. [2020-07-10 15:28:30,471 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 56 states. [2020-07-10 15:28:30,471 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 56 states. [2020-07-10 15:28:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:30,482 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2020-07-10 15:28:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2020-07-10 15:28:30,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:30,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:30,486 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 63 states. [2020-07-10 15:28:30,486 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 63 states. [2020-07-10 15:28:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:30,494 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2020-07-10 15:28:30,495 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2020-07-10 15:28:30,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:30,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:30,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:30,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-10 15:28:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2020-07-10 15:28:30,505 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 16 [2020-07-10 15:28:30,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:30,506 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2020-07-10 15:28:30,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:30,507 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2020-07-10 15:28:30,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:28:30,508 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:30,508 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] [2020-07-10 15:28:30,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:28:30,509 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:30,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:30,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1393145919, now seen corresponding path program 1 times [2020-07-10 15:28:30,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:30,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323359193] [2020-07-10 15:28:30,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:30,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {445#true} assume true; {445#true} is VALID [2020-07-10 15:28:30,699 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {445#true} {445#true} #140#return; {445#true} is VALID [2020-07-10 15:28:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:30,713 INFO L280 TraceCheckUtils]: 0: Hoare triple {445#true} ~cond := #in~cond; {445#true} is VALID [2020-07-10 15:28:30,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {445#true} assume !(0 == ~cond); {445#true} is VALID [2020-07-10 15:28:30,714 INFO L280 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2020-07-10 15:28:30,717 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {445#true} {450#(<= 1 main_~cp~0)} #144#return; {450#(<= 1 main_~cp~0)} is VALID [2020-07-10 15:28:30,720 INFO L263 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2020-07-10 15:28:30,721 INFO L280 TraceCheckUtils]: 1: Hoare triple {445#true} assume true; {445#true} is VALID [2020-07-10 15:28:30,721 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {445#true} {445#true} #140#return; {445#true} is VALID [2020-07-10 15:28:30,722 INFO L263 TraceCheckUtils]: 3: Hoare triple {445#true} call #t~ret11 := main(); {445#true} is VALID [2020-07-10 15:28:30,723 INFO L280 TraceCheckUtils]: 4: Hoare triple {445#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~scheme~0 := #t~nondet2;havoc #t~nondet2; {445#true} is VALID [2020-07-10 15:28:30,723 INFO L280 TraceCheckUtils]: 5: Hoare triple {445#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {445#true} is VALID [2020-07-10 15:28:30,724 INFO L280 TraceCheckUtils]: 6: Hoare triple {445#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {445#true} is VALID [2020-07-10 15:28:30,724 INFO L280 TraceCheckUtils]: 7: Hoare triple {445#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {445#true} is VALID [2020-07-10 15:28:30,725 INFO L280 TraceCheckUtils]: 8: Hoare triple {445#true} assume ~urilen~0 > 0; {445#true} is VALID [2020-07-10 15:28:30,725 INFO L280 TraceCheckUtils]: 9: Hoare triple {445#true} assume ~tokenlen~0 > 0; {445#true} is VALID [2020-07-10 15:28:30,726 INFO L280 TraceCheckUtils]: 10: Hoare triple {445#true} assume ~scheme~0 >= 0; {449#(< 0 (+ main_~scheme~0 1))} is VALID [2020-07-10 15:28:30,735 INFO L280 TraceCheckUtils]: 11: Hoare triple {449#(< 0 (+ main_~scheme~0 1))} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {450#(<= 1 main_~cp~0)} is VALID [2020-07-10 15:28:30,736 INFO L263 TraceCheckUtils]: 12: Hoare triple {450#(<= 1 main_~cp~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {445#true} is VALID [2020-07-10 15:28:30,736 INFO L280 TraceCheckUtils]: 13: Hoare triple {445#true} ~cond := #in~cond; {445#true} is VALID [2020-07-10 15:28:30,736 INFO L280 TraceCheckUtils]: 14: Hoare triple {445#true} assume !(0 == ~cond); {445#true} is VALID [2020-07-10 15:28:30,737 INFO L280 TraceCheckUtils]: 15: Hoare triple {445#true} assume true; {445#true} is VALID [2020-07-10 15:28:30,738 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {445#true} {450#(<= 1 main_~cp~0)} #144#return; {450#(<= 1 main_~cp~0)} is VALID [2020-07-10 15:28:30,739 INFO L263 TraceCheckUtils]: 17: Hoare triple {450#(<= 1 main_~cp~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {455#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:30,741 INFO L280 TraceCheckUtils]: 18: Hoare triple {455#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {456#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:30,743 INFO L280 TraceCheckUtils]: 19: Hoare triple {456#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {446#false} is VALID [2020-07-10 15:28:30,743 INFO L280 TraceCheckUtils]: 20: Hoare triple {446#false} assume !false; {446#false} is VALID [2020-07-10 15:28:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:30,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323359193] [2020-07-10 15:28:30,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:30,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:30,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095860712] [2020-07-10 15:28:30,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-10 15:28:30,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:30,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:30,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:30,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:30,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:30,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:30,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:30,782 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 6 states. [2020-07-10 15:28:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:31,458 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2020-07-10 15:28:31,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:31,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-10 15:28:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-10 15:28:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-10 15:28:31,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2020-07-10 15:28:31,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:31,571 INFO L225 Difference]: With dead ends: 62 [2020-07-10 15:28:31,571 INFO L226 Difference]: Without dead ends: 60 [2020-07-10 15:28:31,573 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-10 15:28:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-07-10 15:28:31,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:31,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2020-07-10 15:28:31,625 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2020-07-10 15:28:31,625 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2020-07-10 15:28:31,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:31,644 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2020-07-10 15:28:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2020-07-10 15:28:31,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:31,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:31,646 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2020-07-10 15:28:31,646 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2020-07-10 15:28:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:31,655 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2020-07-10 15:28:31,655 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2020-07-10 15:28:31,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:31,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:31,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:31,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-10 15:28:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2020-07-10 15:28:31,665 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 21 [2020-07-10 15:28:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:31,666 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2020-07-10 15:28:31,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2020-07-10 15:28:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-10 15:28:31,674 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:31,675 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] [2020-07-10 15:28:31,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:28:31,675 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:31,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:31,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1101915893, now seen corresponding path program 1 times [2020-07-10 15:28:31,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:31,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786694802] [2020-07-10 15:28:31,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:31,740 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-10 15:28:31,740 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {765#true} {765#true} #140#return; {765#true} is VALID [2020-07-10 15:28:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:31,745 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-10 15:28:31,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-10 15:28:31,746 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-10 15:28:31,746 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #144#return; {765#true} is VALID [2020-07-10 15:28:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:31,750 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-10 15:28:31,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-10 15:28:31,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-10 15:28:31,751 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #146#return; {765#true} is VALID [2020-07-10 15:28:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:31,756 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-10 15:28:31,757 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-10 15:28:31,757 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-10 15:28:31,757 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #148#return; {765#true} is VALID [2020-07-10 15:28:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:31,762 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-10 15:28:31,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-10 15:28:31,763 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-10 15:28:31,763 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #150#return; {765#true} is VALID [2020-07-10 15:28:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:31,771 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-10 15:28:31,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-10 15:28:31,772 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-10 15:28:31,772 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {785#(= (+ main_~cp~0 1) main_~urilen~0)} #156#return; {785#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-10 15:28:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:31,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-10 15:28:31,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-10 15:28:31,781 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-10 15:28:31,781 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {785#(= (+ main_~cp~0 1) main_~urilen~0)} #158#return; {785#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-10 15:28:31,782 INFO L263 TraceCheckUtils]: 0: Hoare triple {765#true} call ULTIMATE.init(); {765#true} is VALID [2020-07-10 15:28:31,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-10 15:28:31,782 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {765#true} {765#true} #140#return; {765#true} is VALID [2020-07-10 15:28:31,783 INFO L263 TraceCheckUtils]: 3: Hoare triple {765#true} call #t~ret11 := main(); {765#true} is VALID [2020-07-10 15:28:31,783 INFO L280 TraceCheckUtils]: 4: Hoare triple {765#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~scheme~0 := #t~nondet2;havoc #t~nondet2; {765#true} is VALID [2020-07-10 15:28:31,783 INFO L280 TraceCheckUtils]: 5: Hoare triple {765#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {765#true} is VALID [2020-07-10 15:28:31,784 INFO L280 TraceCheckUtils]: 6: Hoare triple {765#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {765#true} is VALID [2020-07-10 15:28:31,784 INFO L280 TraceCheckUtils]: 7: Hoare triple {765#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {765#true} is VALID [2020-07-10 15:28:31,784 INFO L280 TraceCheckUtils]: 8: Hoare triple {765#true} assume ~urilen~0 > 0; {765#true} is VALID [2020-07-10 15:28:31,784 INFO L280 TraceCheckUtils]: 9: Hoare triple {765#true} assume ~tokenlen~0 > 0; {765#true} is VALID [2020-07-10 15:28:31,785 INFO L280 TraceCheckUtils]: 10: Hoare triple {765#true} assume ~scheme~0 >= 0; {765#true} is VALID [2020-07-10 15:28:31,785 INFO L280 TraceCheckUtils]: 11: Hoare triple {765#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {765#true} is VALID [2020-07-10 15:28:31,785 INFO L263 TraceCheckUtils]: 12: Hoare triple {765#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {765#true} is VALID [2020-07-10 15:28:31,785 INFO L280 TraceCheckUtils]: 13: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-10 15:28:31,786 INFO L280 TraceCheckUtils]: 14: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-10 15:28:31,786 INFO L280 TraceCheckUtils]: 15: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-10 15:28:31,786 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {765#true} {765#true} #144#return; {765#true} is VALID [2020-07-10 15:28:31,787 INFO L263 TraceCheckUtils]: 17: Hoare triple {765#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {765#true} is VALID [2020-07-10 15:28:31,787 INFO L280 TraceCheckUtils]: 18: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-10 15:28:31,787 INFO L280 TraceCheckUtils]: 19: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-10 15:28:31,787 INFO L280 TraceCheckUtils]: 20: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-10 15:28:31,788 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {765#true} {765#true} #146#return; {765#true} is VALID [2020-07-10 15:28:31,788 INFO L280 TraceCheckUtils]: 22: Hoare triple {765#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {765#true} is VALID [2020-07-10 15:28:31,788 INFO L280 TraceCheckUtils]: 23: Hoare triple {765#true} assume 0 != #t~nondet3;havoc #t~nondet3; {765#true} is VALID [2020-07-10 15:28:31,788 INFO L263 TraceCheckUtils]: 24: Hoare triple {765#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {765#true} is VALID [2020-07-10 15:28:31,789 INFO L280 TraceCheckUtils]: 25: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-10 15:28:31,789 INFO L280 TraceCheckUtils]: 26: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-10 15:28:31,789 INFO L280 TraceCheckUtils]: 27: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-10 15:28:31,790 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {765#true} {765#true} #148#return; {765#true} is VALID [2020-07-10 15:28:31,790 INFO L263 TraceCheckUtils]: 29: Hoare triple {765#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {765#true} is VALID [2020-07-10 15:28:31,790 INFO L280 TraceCheckUtils]: 30: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-10 15:28:31,790 INFO L280 TraceCheckUtils]: 31: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-10 15:28:31,791 INFO L280 TraceCheckUtils]: 32: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-10 15:28:31,791 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {765#true} {765#true} #150#return; {765#true} is VALID [2020-07-10 15:28:31,792 INFO L280 TraceCheckUtils]: 34: Hoare triple {765#true} assume !(~cp~0 != ~urilen~0 - 1); {785#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-10 15:28:31,792 INFO L263 TraceCheckUtils]: 35: Hoare triple {785#(= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {765#true} is VALID [2020-07-10 15:28:31,792 INFO L280 TraceCheckUtils]: 36: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-10 15:28:31,793 INFO L280 TraceCheckUtils]: 37: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-10 15:28:31,793 INFO L280 TraceCheckUtils]: 38: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-10 15:28:31,794 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {765#true} {785#(= (+ main_~cp~0 1) main_~urilen~0)} #156#return; {785#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-10 15:28:31,794 INFO L263 TraceCheckUtils]: 40: Hoare triple {785#(= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {765#true} is VALID [2020-07-10 15:28:31,795 INFO L280 TraceCheckUtils]: 41: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-10 15:28:31,795 INFO L280 TraceCheckUtils]: 42: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-10 15:28:31,795 INFO L280 TraceCheckUtils]: 43: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-10 15:28:31,796 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {765#true} {785#(= (+ main_~cp~0 1) main_~urilen~0)} #158#return; {785#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-10 15:28:31,797 INFO L280 TraceCheckUtils]: 45: Hoare triple {785#(= (+ main_~cp~0 1) main_~urilen~0)} assume !(~cp~0 == ~urilen~0 - 1); {766#false} is VALID [2020-07-10 15:28:31,797 INFO L263 TraceCheckUtils]: 46: Hoare triple {766#false} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {766#false} is VALID [2020-07-10 15:28:31,797 INFO L280 TraceCheckUtils]: 47: Hoare triple {766#false} ~cond := #in~cond; {766#false} is VALID [2020-07-10 15:28:31,797 INFO L280 TraceCheckUtils]: 48: Hoare triple {766#false} assume 0 == ~cond; {766#false} is VALID [2020-07-10 15:28:31,798 INFO L280 TraceCheckUtils]: 49: Hoare triple {766#false} assume !false; {766#false} is VALID [2020-07-10 15:28:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-10 15:28:31,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786694802] [2020-07-10 15:28:31,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:31,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:28:31,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627712925] [2020-07-10 15:28:31,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-10 15:28:31,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:31,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:28:31,837 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 15:28:31,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:28:31,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:31,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:28:31,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:28:31,839 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand 3 states. [2020-07-10 15:28:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:32,063 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2020-07-10 15:28:32,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:28:32,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-10 15:28:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:28:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-10 15:28:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:28:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-10 15:28:32,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2020-07-10 15:28:32,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:32,217 INFO L225 Difference]: With dead ends: 89 [2020-07-10 15:28:32,218 INFO L226 Difference]: Without dead ends: 60 [2020-07-10 15:28:32,219 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 15:28:32,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-10 15:28:32,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-07-10 15:28:32,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:32,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2020-07-10 15:28:32,286 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2020-07-10 15:28:32,286 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2020-07-10 15:28:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:32,291 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2020-07-10 15:28:32,291 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2020-07-10 15:28:32,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:32,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:32,293 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2020-07-10 15:28:32,293 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2020-07-10 15:28:32,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:32,298 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2020-07-10 15:28:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2020-07-10 15:28:32,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:32,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:32,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:32,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-10 15:28:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2020-07-10 15:28:32,304 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 50 [2020-07-10 15:28:32,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:32,305 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2020-07-10 15:28:32,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:28:32,305 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2020-07-10 15:28:32,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-10 15:28:32,306 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:32,307 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] [2020-07-10 15:28:32,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:28:32,307 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:32,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:32,307 INFO L82 PathProgramCache]: Analyzing trace with hash 668905142, now seen corresponding path program 1 times [2020-07-10 15:28:32,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:32,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658388122] [2020-07-10 15:28:32,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,468 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-10 15:28:32,469 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1140#true} {1140#true} #140#return; {1140#true} is VALID [2020-07-10 15:28:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,479 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-10 15:28:32,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-10 15:28:32,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-10 15:28:32,481 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1140#true} {1144#(< main_~cp~0 main_~urilen~0)} #144#return; {1144#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 15:28:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,488 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-10 15:28:32,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-10 15:28:32,489 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-10 15:28:32,490 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1140#true} {1144#(< main_~cp~0 main_~urilen~0)} #146#return; {1144#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 15:28:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,496 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-10 15:28:32,497 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-10 15:28:32,497 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-10 15:28:32,498 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1140#true} {1144#(< main_~cp~0 main_~urilen~0)} #148#return; {1144#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 15:28:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-10 15:28:32,504 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-10 15:28:32,504 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-10 15:28:32,506 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1140#true} {1144#(< main_~cp~0 main_~urilen~0)} #150#return; {1144#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 15:28:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-10 15:28:32,513 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-10 15:28:32,513 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-10 15:28:32,514 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1140#true} {1161#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #156#return; {1161#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 15:28:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,521 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-10 15:28:32,522 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-10 15:28:32,522 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-10 15:28:32,523 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1140#true} {1161#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #158#return; {1161#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 15:28:32,523 INFO L263 TraceCheckUtils]: 0: Hoare triple {1140#true} call ULTIMATE.init(); {1140#true} is VALID [2020-07-10 15:28:32,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-10 15:28:32,524 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1140#true} {1140#true} #140#return; {1140#true} is VALID [2020-07-10 15:28:32,524 INFO L263 TraceCheckUtils]: 3: Hoare triple {1140#true} call #t~ret11 := main(); {1140#true} is VALID [2020-07-10 15:28:32,524 INFO L280 TraceCheckUtils]: 4: Hoare triple {1140#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~scheme~0 := #t~nondet2;havoc #t~nondet2; {1140#true} is VALID [2020-07-10 15:28:32,525 INFO L280 TraceCheckUtils]: 5: Hoare triple {1140#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1140#true} is VALID [2020-07-10 15:28:32,525 INFO L280 TraceCheckUtils]: 6: Hoare triple {1140#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1140#true} is VALID [2020-07-10 15:28:32,525 INFO L280 TraceCheckUtils]: 7: Hoare triple {1140#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1140#true} is VALID [2020-07-10 15:28:32,525 INFO L280 TraceCheckUtils]: 8: Hoare triple {1140#true} assume ~urilen~0 > 0; {1140#true} is VALID [2020-07-10 15:28:32,526 INFO L280 TraceCheckUtils]: 9: Hoare triple {1140#true} assume ~tokenlen~0 > 0; {1140#true} is VALID [2020-07-10 15:28:32,526 INFO L280 TraceCheckUtils]: 10: Hoare triple {1140#true} assume ~scheme~0 >= 0; {1140#true} is VALID [2020-07-10 15:28:32,527 INFO L280 TraceCheckUtils]: 11: Hoare triple {1140#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1144#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 15:28:32,527 INFO L263 TraceCheckUtils]: 12: Hoare triple {1144#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1140#true} is VALID [2020-07-10 15:28:32,528 INFO L280 TraceCheckUtils]: 13: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-10 15:28:32,528 INFO L280 TraceCheckUtils]: 14: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-10 15:28:32,528 INFO L280 TraceCheckUtils]: 15: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-10 15:28:32,529 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1140#true} {1144#(< main_~cp~0 main_~urilen~0)} #144#return; {1144#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 15:28:32,530 INFO L263 TraceCheckUtils]: 17: Hoare triple {1144#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1140#true} is VALID [2020-07-10 15:28:32,530 INFO L280 TraceCheckUtils]: 18: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-10 15:28:32,530 INFO L280 TraceCheckUtils]: 19: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-10 15:28:32,530 INFO L280 TraceCheckUtils]: 20: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-10 15:28:32,531 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1140#true} {1144#(< main_~cp~0 main_~urilen~0)} #146#return; {1144#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 15:28:32,532 INFO L280 TraceCheckUtils]: 22: Hoare triple {1144#(< main_~cp~0 main_~urilen~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1144#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 15:28:32,533 INFO L280 TraceCheckUtils]: 23: Hoare triple {1144#(< main_~cp~0 main_~urilen~0)} assume 0 != #t~nondet3;havoc #t~nondet3; {1144#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 15:28:32,533 INFO L263 TraceCheckUtils]: 24: Hoare triple {1144#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1140#true} is VALID [2020-07-10 15:28:32,533 INFO L280 TraceCheckUtils]: 25: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-10 15:28:32,534 INFO L280 TraceCheckUtils]: 26: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-10 15:28:32,534 INFO L280 TraceCheckUtils]: 27: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-10 15:28:32,535 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1140#true} {1144#(< main_~cp~0 main_~urilen~0)} #148#return; {1144#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 15:28:32,535 INFO L263 TraceCheckUtils]: 29: Hoare triple {1144#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1140#true} is VALID [2020-07-10 15:28:32,535 INFO L280 TraceCheckUtils]: 30: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-10 15:28:32,535 INFO L280 TraceCheckUtils]: 31: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-10 15:28:32,536 INFO L280 TraceCheckUtils]: 32: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-10 15:28:32,536 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1140#true} {1144#(< main_~cp~0 main_~urilen~0)} #150#return; {1144#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-10 15:28:32,537 INFO L280 TraceCheckUtils]: 34: Hoare triple {1144#(< main_~cp~0 main_~urilen~0)} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1161#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 15:28:32,538 INFO L280 TraceCheckUtils]: 35: Hoare triple {1161#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} assume 0 != #t~nondet4;havoc #t~nondet4; {1161#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 15:28:32,539 INFO L263 TraceCheckUtils]: 36: Hoare triple {1161#(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)); {1140#true} is VALID [2020-07-10 15:28:32,539 INFO L280 TraceCheckUtils]: 37: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-10 15:28:32,539 INFO L280 TraceCheckUtils]: 38: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-10 15:28:32,539 INFO L280 TraceCheckUtils]: 39: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-10 15:28:32,540 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1140#true} {1161#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #156#return; {1161#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 15:28:32,541 INFO L263 TraceCheckUtils]: 41: Hoare triple {1161#(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)); {1140#true} is VALID [2020-07-10 15:28:32,541 INFO L280 TraceCheckUtils]: 42: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-10 15:28:32,541 INFO L280 TraceCheckUtils]: 43: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-10 15:28:32,541 INFO L280 TraceCheckUtils]: 44: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-10 15:28:32,542 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1140#true} {1161#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #158#return; {1161#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 15:28:32,543 INFO L280 TraceCheckUtils]: 46: Hoare triple {1161#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} assume !(~cp~0 == ~urilen~0 - 1); {1161#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-10 15:28:32,544 INFO L263 TraceCheckUtils]: 47: Hoare triple {1161#(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)); {1170#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:32,545 INFO L280 TraceCheckUtils]: 48: Hoare triple {1170#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1171#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:32,546 INFO L280 TraceCheckUtils]: 49: Hoare triple {1171#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1141#false} is VALID [2020-07-10 15:28:32,558 INFO L280 TraceCheckUtils]: 50: Hoare triple {1141#false} assume !false; {1141#false} is VALID [2020-07-10 15:28:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-10 15:28:32,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658388122] [2020-07-10 15:28:32,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:32,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:32,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650713598] [2020-07-10 15:28:32,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2020-07-10 15:28:32,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:32,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:32,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:32,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:32,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:32,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:32,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:32,616 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 6 states. [2020-07-10 15:28:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:33,132 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2020-07-10 15:28:33,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:33,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2020-07-10 15:28:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-10 15:28:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-10 15:28:33,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2020-07-10 15:28:33,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:33,248 INFO L225 Difference]: With dead ends: 67 [2020-07-10 15:28:33,248 INFO L226 Difference]: Without dead ends: 65 [2020-07-10 15:28:33,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-10 15:28:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2020-07-10 15:28:33,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:33,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 64 states. [2020-07-10 15:28:33,307 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 64 states. [2020-07-10 15:28:33,308 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 64 states. [2020-07-10 15:28:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:33,312 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2020-07-10 15:28:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2020-07-10 15:28:33,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:33,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:33,314 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 65 states. [2020-07-10 15:28:33,314 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 65 states. [2020-07-10 15:28:33,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:33,318 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2020-07-10 15:28:33,318 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2020-07-10 15:28:33,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:33,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:33,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:33,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-10 15:28:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2020-07-10 15:28:33,324 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 51 [2020-07-10 15:28:33,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:33,324 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2020-07-10 15:28:33,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2020-07-10 15:28:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-10 15:28:33,327 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:33,327 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] [2020-07-10 15:28:33,328 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:28:33,328 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:33,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:33,328 INFO L82 PathProgramCache]: Analyzing trace with hash -702087769, now seen corresponding path program 1 times [2020-07-10 15:28:33,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:33,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752226362] [2020-07-10 15:28:33,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,448 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,449 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1500#true} {1500#true} #140#return; {1500#true} is VALID [2020-07-10 15:28:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,462 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,462 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,463 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,463 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #144#return; {1500#true} is VALID [2020-07-10 15:28:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,470 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,471 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #146#return; {1500#true} is VALID [2020-07-10 15:28:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,478 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,479 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #148#return; {1500#true} is VALID [2020-07-10 15:28:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,491 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,491 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #150#return; {1500#true} is VALID [2020-07-10 15:28:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,496 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #156#return; {1500#true} is VALID [2020-07-10 15:28:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,501 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,502 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #158#return; {1500#true} is VALID [2020-07-10 15:28:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,506 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,507 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,507 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #160#return; {1500#true} is VALID [2020-07-10 15:28:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,511 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,512 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,512 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #162#return; {1500#true} is VALID [2020-07-10 15:28:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,520 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,521 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1536#(= 0 main_~c~0)} #164#return; {1536#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,529 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,530 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,531 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1536#(= 0 main_~c~0)} #166#return; {1536#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,538 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,539 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,540 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #168#return; {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-10 15:28:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,547 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,548 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,549 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #170#return; {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-10 15:28:33,549 INFO L263 TraceCheckUtils]: 0: Hoare triple {1500#true} call ULTIMATE.init(); {1500#true} is VALID [2020-07-10 15:28:33,550 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,550 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1500#true} {1500#true} #140#return; {1500#true} is VALID [2020-07-10 15:28:33,550 INFO L263 TraceCheckUtils]: 3: Hoare triple {1500#true} call #t~ret11 := main(); {1500#true} is VALID [2020-07-10 15:28:33,550 INFO L280 TraceCheckUtils]: 4: Hoare triple {1500#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~scheme~0 := #t~nondet2;havoc #t~nondet2; {1500#true} is VALID [2020-07-10 15:28:33,551 INFO L280 TraceCheckUtils]: 5: Hoare triple {1500#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1500#true} is VALID [2020-07-10 15:28:33,551 INFO L280 TraceCheckUtils]: 6: Hoare triple {1500#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1500#true} is VALID [2020-07-10 15:28:33,551 INFO L280 TraceCheckUtils]: 7: Hoare triple {1500#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1500#true} is VALID [2020-07-10 15:28:33,552 INFO L280 TraceCheckUtils]: 8: Hoare triple {1500#true} assume ~urilen~0 > 0; {1500#true} is VALID [2020-07-10 15:28:33,552 INFO L280 TraceCheckUtils]: 9: Hoare triple {1500#true} assume ~tokenlen~0 > 0; {1500#true} is VALID [2020-07-10 15:28:33,552 INFO L280 TraceCheckUtils]: 10: Hoare triple {1500#true} assume ~scheme~0 >= 0; {1500#true} is VALID [2020-07-10 15:28:33,552 INFO L280 TraceCheckUtils]: 11: Hoare triple {1500#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1500#true} is VALID [2020-07-10 15:28:33,553 INFO L263 TraceCheckUtils]: 12: Hoare triple {1500#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1500#true} is VALID [2020-07-10 15:28:33,553 INFO L280 TraceCheckUtils]: 13: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,553 INFO L280 TraceCheckUtils]: 14: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,553 INFO L280 TraceCheckUtils]: 15: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,554 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1500#true} {1500#true} #144#return; {1500#true} is VALID [2020-07-10 15:28:33,554 INFO L263 TraceCheckUtils]: 17: Hoare triple {1500#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1500#true} is VALID [2020-07-10 15:28:33,554 INFO L280 TraceCheckUtils]: 18: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,555 INFO L280 TraceCheckUtils]: 19: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,555 INFO L280 TraceCheckUtils]: 20: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,555 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1500#true} {1500#true} #146#return; {1500#true} is VALID [2020-07-10 15:28:33,555 INFO L280 TraceCheckUtils]: 22: Hoare triple {1500#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1500#true} is VALID [2020-07-10 15:28:33,556 INFO L280 TraceCheckUtils]: 23: Hoare triple {1500#true} assume 0 != #t~nondet3;havoc #t~nondet3; {1500#true} is VALID [2020-07-10 15:28:33,556 INFO L263 TraceCheckUtils]: 24: Hoare triple {1500#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1500#true} is VALID [2020-07-10 15:28:33,556 INFO L280 TraceCheckUtils]: 25: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,557 INFO L280 TraceCheckUtils]: 26: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,557 INFO L280 TraceCheckUtils]: 27: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,557 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1500#true} {1500#true} #148#return; {1500#true} is VALID [2020-07-10 15:28:33,557 INFO L263 TraceCheckUtils]: 29: Hoare triple {1500#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1500#true} is VALID [2020-07-10 15:28:33,558 INFO L280 TraceCheckUtils]: 30: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,558 INFO L280 TraceCheckUtils]: 31: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,558 INFO L280 TraceCheckUtils]: 32: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,559 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1500#true} {1500#true} #150#return; {1500#true} is VALID [2020-07-10 15:28:33,559 INFO L280 TraceCheckUtils]: 34: Hoare triple {1500#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1500#true} is VALID [2020-07-10 15:28:33,559 INFO L280 TraceCheckUtils]: 35: Hoare triple {1500#true} assume 0 != #t~nondet4;havoc #t~nondet4; {1500#true} is VALID [2020-07-10 15:28:33,559 INFO L263 TraceCheckUtils]: 36: Hoare triple {1500#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1500#true} is VALID [2020-07-10 15:28:33,560 INFO L280 TraceCheckUtils]: 37: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,560 INFO L280 TraceCheckUtils]: 38: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,560 INFO L280 TraceCheckUtils]: 39: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,561 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1500#true} {1500#true} #156#return; {1500#true} is VALID [2020-07-10 15:28:33,561 INFO L263 TraceCheckUtils]: 41: Hoare triple {1500#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1500#true} is VALID [2020-07-10 15:28:33,561 INFO L280 TraceCheckUtils]: 42: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,562 INFO L280 TraceCheckUtils]: 43: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,562 INFO L280 TraceCheckUtils]: 44: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,562 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1500#true} {1500#true} #158#return; {1500#true} is VALID [2020-07-10 15:28:33,563 INFO L280 TraceCheckUtils]: 46: Hoare triple {1500#true} assume !(~cp~0 == ~urilen~0 - 1); {1500#true} is VALID [2020-07-10 15:28:33,563 INFO L263 TraceCheckUtils]: 47: Hoare triple {1500#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1500#true} is VALID [2020-07-10 15:28:33,563 INFO L280 TraceCheckUtils]: 48: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,563 INFO L280 TraceCheckUtils]: 49: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,564 INFO L280 TraceCheckUtils]: 50: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,564 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {1500#true} {1500#true} #160#return; {1500#true} is VALID [2020-07-10 15:28:33,564 INFO L263 TraceCheckUtils]: 52: Hoare triple {1500#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {1500#true} is VALID [2020-07-10 15:28:33,565 INFO L280 TraceCheckUtils]: 53: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,565 INFO L280 TraceCheckUtils]: 54: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,565 INFO L280 TraceCheckUtils]: 55: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,566 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {1500#true} {1500#true} #162#return; {1500#true} is VALID [2020-07-10 15:28:33,566 INFO L280 TraceCheckUtils]: 57: Hoare triple {1500#true} assume !(1 + ~cp~0 == ~urilen~0 - 1);#t~pre6 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre6;~scheme~0 := ~cp~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1500#true} is VALID [2020-07-10 15:28:33,567 INFO L280 TraceCheckUtils]: 58: Hoare triple {1500#true} assume 0 != #t~nondet7;havoc #t~nondet7;~c~0 := 0; {1536#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:33,567 INFO L263 TraceCheckUtils]: 59: Hoare triple {1536#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1500#true} is VALID [2020-07-10 15:28:33,567 INFO L280 TraceCheckUtils]: 60: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,578 INFO L280 TraceCheckUtils]: 61: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,579 INFO L280 TraceCheckUtils]: 62: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,583 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {1500#true} {1536#(= 0 main_~c~0)} #164#return; {1536#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:33,583 INFO L263 TraceCheckUtils]: 64: Hoare triple {1536#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1500#true} is VALID [2020-07-10 15:28:33,584 INFO L280 TraceCheckUtils]: 65: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,584 INFO L280 TraceCheckUtils]: 66: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,584 INFO L280 TraceCheckUtils]: 67: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,585 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {1500#true} {1536#(= 0 main_~c~0)} #166#return; {1536#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:33,586 INFO L280 TraceCheckUtils]: 69: Hoare triple {1536#(= 0 main_~c~0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-10 15:28:33,586 INFO L263 TraceCheckUtils]: 70: Hoare triple {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1500#true} is VALID [2020-07-10 15:28:33,587 INFO L280 TraceCheckUtils]: 71: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,587 INFO L280 TraceCheckUtils]: 72: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,587 INFO L280 TraceCheckUtils]: 73: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,588 INFO L275 TraceCheckUtils]: 74: Hoare quadruple {1500#true} {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #168#return; {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-10 15:28:33,589 INFO L263 TraceCheckUtils]: 75: Hoare triple {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1500#true} is VALID [2020-07-10 15:28:33,589 INFO L280 TraceCheckUtils]: 76: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-10 15:28:33,589 INFO L280 TraceCheckUtils]: 77: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-10 15:28:33,590 INFO L280 TraceCheckUtils]: 78: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-10 15:28:33,590 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {1500#true} {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #170#return; {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-10 15:28:33,591 INFO L280 TraceCheckUtils]: 80: Hoare triple {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-10 15:28:33,592 INFO L280 TraceCheckUtils]: 81: Hoare triple {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} assume 0 != #t~nondet8;havoc #t~nondet8;#t~pre9 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre9; {1554#(< main_~c~0 main_~tokenlen~0)} is VALID [2020-07-10 15:28:33,594 INFO L263 TraceCheckUtils]: 82: Hoare triple {1554#(< main_~c~0 main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {1555#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:33,595 INFO L280 TraceCheckUtils]: 83: Hoare triple {1555#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1556#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:33,595 INFO L280 TraceCheckUtils]: 84: Hoare triple {1556#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1501#false} is VALID [2020-07-10 15:28:33,596 INFO L280 TraceCheckUtils]: 85: Hoare triple {1501#false} assume !false; {1501#false} is VALID [2020-07-10 15:28:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2020-07-10 15:28:33,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752226362] [2020-07-10 15:28:33,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:33,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:28:33,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956237069] [2020-07-10 15:28:33,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2020-07-10 15:28:33,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:33,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:28:33,669 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 15:28:33,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:28:33,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:33,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:28:33,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:33,671 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 7 states. [2020-07-10 15:28:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:34,186 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2020-07-10 15:28:34,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:28:34,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2020-07-10 15:28:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2020-07-10 15:28:34,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:34,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2020-07-10 15:28:34,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2020-07-10 15:28:34,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:34,315 INFO L225 Difference]: With dead ends: 83 [2020-07-10 15:28:34,315 INFO L226 Difference]: Without dead ends: 81 [2020-07-10 15:28:34,316 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 15:28:34,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-10 15:28:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2020-07-10 15:28:34,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:34,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 75 states. [2020-07-10 15:28:34,404 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 75 states. [2020-07-10 15:28:34,404 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 75 states. [2020-07-10 15:28:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:34,410 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2020-07-10 15:28:34,410 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2020-07-10 15:28:34,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:34,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:34,411 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 81 states. [2020-07-10 15:28:34,411 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 81 states. [2020-07-10 15:28:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:34,417 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2020-07-10 15:28:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2020-07-10 15:28:34,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:34,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:34,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:34,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-10 15:28:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2020-07-10 15:28:34,423 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 86 [2020-07-10 15:28:34,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:34,424 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2020-07-10 15:28:34,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:28:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2020-07-10 15:28:34,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-10 15:28:34,427 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:34,427 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] [2020-07-10 15:28:34,428 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:28:34,428 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:34,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:34,428 INFO L82 PathProgramCache]: Analyzing trace with hash 58209754, now seen corresponding path program 1 times [2020-07-10 15:28:34,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:34,429 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393365545] [2020-07-10 15:28:34,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,528 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1958#true} {1958#true} #140#return; {1958#true} is VALID [2020-07-10 15:28:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,536 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,536 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #144#return; {1958#true} is VALID [2020-07-10 15:28:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,541 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,541 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,541 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,542 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #146#return; {1958#true} is VALID [2020-07-10 15:28:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,548 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,548 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,549 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #148#return; {1958#true} is VALID [2020-07-10 15:28:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,553 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,553 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #150#return; {1958#true} is VALID [2020-07-10 15:28:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,557 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,557 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,558 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #156#return; {1958#true} is VALID [2020-07-10 15:28:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,561 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,562 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,562 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #158#return; {1958#true} is VALID [2020-07-10 15:28:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,566 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,566 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,567 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #160#return; {1958#true} is VALID [2020-07-10 15:28:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,570 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,571 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,571 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #162#return; {1958#true} is VALID [2020-07-10 15:28:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,576 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,576 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,577 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #164#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,581 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,582 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,583 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #166#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,587 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,588 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,589 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #168#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,594 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,594 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,594 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,595 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #170#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,601 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,602 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {2011#(<= 1 main_~c~0)} #172#return; {2011#(<= 1 main_~c~0)} is VALID [2020-07-10 15:28:34,602 INFO L263 TraceCheckUtils]: 0: Hoare triple {1958#true} call ULTIMATE.init(); {1958#true} is VALID [2020-07-10 15:28:34,602 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,602 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1958#true} {1958#true} #140#return; {1958#true} is VALID [2020-07-10 15:28:34,603 INFO L263 TraceCheckUtils]: 3: Hoare triple {1958#true} call #t~ret11 := main(); {1958#true} is VALID [2020-07-10 15:28:34,603 INFO L280 TraceCheckUtils]: 4: Hoare triple {1958#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~scheme~0 := #t~nondet2;havoc #t~nondet2; {1958#true} is VALID [2020-07-10 15:28:34,603 INFO L280 TraceCheckUtils]: 5: Hoare triple {1958#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1958#true} is VALID [2020-07-10 15:28:34,603 INFO L280 TraceCheckUtils]: 6: Hoare triple {1958#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1958#true} is VALID [2020-07-10 15:28:34,604 INFO L280 TraceCheckUtils]: 7: Hoare triple {1958#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1958#true} is VALID [2020-07-10 15:28:34,604 INFO L280 TraceCheckUtils]: 8: Hoare triple {1958#true} assume ~urilen~0 > 0; {1958#true} is VALID [2020-07-10 15:28:34,604 INFO L280 TraceCheckUtils]: 9: Hoare triple {1958#true} assume ~tokenlen~0 > 0; {1958#true} is VALID [2020-07-10 15:28:34,604 INFO L280 TraceCheckUtils]: 10: Hoare triple {1958#true} assume ~scheme~0 >= 0; {1958#true} is VALID [2020-07-10 15:28:34,605 INFO L280 TraceCheckUtils]: 11: Hoare triple {1958#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1958#true} is VALID [2020-07-10 15:28:34,605 INFO L263 TraceCheckUtils]: 12: Hoare triple {1958#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1958#true} is VALID [2020-07-10 15:28:34,605 INFO L280 TraceCheckUtils]: 13: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,605 INFO L280 TraceCheckUtils]: 14: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,606 INFO L280 TraceCheckUtils]: 15: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,606 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1958#true} {1958#true} #144#return; {1958#true} is VALID [2020-07-10 15:28:34,606 INFO L263 TraceCheckUtils]: 17: Hoare triple {1958#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1958#true} is VALID [2020-07-10 15:28:34,606 INFO L280 TraceCheckUtils]: 18: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,607 INFO L280 TraceCheckUtils]: 19: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,607 INFO L280 TraceCheckUtils]: 20: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,607 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1958#true} {1958#true} #146#return; {1958#true} is VALID [2020-07-10 15:28:34,607 INFO L280 TraceCheckUtils]: 22: Hoare triple {1958#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1958#true} is VALID [2020-07-10 15:28:34,607 INFO L280 TraceCheckUtils]: 23: Hoare triple {1958#true} assume 0 != #t~nondet3;havoc #t~nondet3; {1958#true} is VALID [2020-07-10 15:28:34,608 INFO L263 TraceCheckUtils]: 24: Hoare triple {1958#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1958#true} is VALID [2020-07-10 15:28:34,608 INFO L280 TraceCheckUtils]: 25: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,608 INFO L280 TraceCheckUtils]: 26: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,608 INFO L280 TraceCheckUtils]: 27: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,609 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1958#true} {1958#true} #148#return; {1958#true} is VALID [2020-07-10 15:28:34,609 INFO L263 TraceCheckUtils]: 29: Hoare triple {1958#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1958#true} is VALID [2020-07-10 15:28:34,609 INFO L280 TraceCheckUtils]: 30: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,609 INFO L280 TraceCheckUtils]: 31: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,609 INFO L280 TraceCheckUtils]: 32: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,610 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1958#true} {1958#true} #150#return; {1958#true} is VALID [2020-07-10 15:28:34,610 INFO L280 TraceCheckUtils]: 34: Hoare triple {1958#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1958#true} is VALID [2020-07-10 15:28:34,610 INFO L280 TraceCheckUtils]: 35: Hoare triple {1958#true} assume 0 != #t~nondet4;havoc #t~nondet4; {1958#true} is VALID [2020-07-10 15:28:34,610 INFO L263 TraceCheckUtils]: 36: Hoare triple {1958#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1958#true} is VALID [2020-07-10 15:28:34,611 INFO L280 TraceCheckUtils]: 37: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,611 INFO L280 TraceCheckUtils]: 38: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,611 INFO L280 TraceCheckUtils]: 39: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,612 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1958#true} {1958#true} #156#return; {1958#true} is VALID [2020-07-10 15:28:34,612 INFO L263 TraceCheckUtils]: 41: Hoare triple {1958#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1958#true} is VALID [2020-07-10 15:28:34,612 INFO L280 TraceCheckUtils]: 42: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,612 INFO L280 TraceCheckUtils]: 43: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,612 INFO L280 TraceCheckUtils]: 44: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,613 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1958#true} {1958#true} #158#return; {1958#true} is VALID [2020-07-10 15:28:34,613 INFO L280 TraceCheckUtils]: 46: Hoare triple {1958#true} assume !(~cp~0 == ~urilen~0 - 1); {1958#true} is VALID [2020-07-10 15:28:34,613 INFO L263 TraceCheckUtils]: 47: Hoare triple {1958#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1958#true} is VALID [2020-07-10 15:28:34,614 INFO L280 TraceCheckUtils]: 48: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,614 INFO L280 TraceCheckUtils]: 49: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,614 INFO L280 TraceCheckUtils]: 50: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,615 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {1958#true} {1958#true} #160#return; {1958#true} is VALID [2020-07-10 15:28:34,615 INFO L263 TraceCheckUtils]: 52: Hoare triple {1958#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {1958#true} is VALID [2020-07-10 15:28:34,615 INFO L280 TraceCheckUtils]: 53: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,615 INFO L280 TraceCheckUtils]: 54: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,616 INFO L280 TraceCheckUtils]: 55: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,616 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {1958#true} {1958#true} #162#return; {1958#true} is VALID [2020-07-10 15:28:34,616 INFO L280 TraceCheckUtils]: 57: Hoare triple {1958#true} assume !(1 + ~cp~0 == ~urilen~0 - 1);#t~pre6 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre6;~scheme~0 := ~cp~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1958#true} is VALID [2020-07-10 15:28:34,617 INFO L280 TraceCheckUtils]: 58: Hoare triple {1958#true} assume 0 != #t~nondet7;havoc #t~nondet7;~c~0 := 0; {1994#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:34,617 INFO L263 TraceCheckUtils]: 59: Hoare triple {1994#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1958#true} is VALID [2020-07-10 15:28:34,617 INFO L280 TraceCheckUtils]: 60: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,618 INFO L280 TraceCheckUtils]: 61: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,618 INFO L280 TraceCheckUtils]: 62: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,619 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #164#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:34,619 INFO L263 TraceCheckUtils]: 64: Hoare triple {1994#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1958#true} is VALID [2020-07-10 15:28:34,619 INFO L280 TraceCheckUtils]: 65: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,619 INFO L280 TraceCheckUtils]: 66: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,620 INFO L280 TraceCheckUtils]: 67: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,620 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #166#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:34,621 INFO L280 TraceCheckUtils]: 69: Hoare triple {1994#(= 0 main_~c~0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {1994#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:34,621 INFO L263 TraceCheckUtils]: 70: Hoare triple {1994#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1958#true} is VALID [2020-07-10 15:28:34,622 INFO L280 TraceCheckUtils]: 71: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,622 INFO L280 TraceCheckUtils]: 72: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,622 INFO L280 TraceCheckUtils]: 73: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,623 INFO L275 TraceCheckUtils]: 74: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #168#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:34,623 INFO L263 TraceCheckUtils]: 75: Hoare triple {1994#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1958#true} is VALID [2020-07-10 15:28:34,624 INFO L280 TraceCheckUtils]: 76: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,624 INFO L280 TraceCheckUtils]: 77: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,624 INFO L280 TraceCheckUtils]: 78: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,625 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #170#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:34,626 INFO L280 TraceCheckUtils]: 80: Hoare triple {1994#(= 0 main_~c~0)} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1994#(= 0 main_~c~0)} is VALID [2020-07-10 15:28:34,626 INFO L280 TraceCheckUtils]: 81: Hoare triple {1994#(= 0 main_~c~0)} assume 0 != #t~nondet8;havoc #t~nondet8;#t~pre9 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre9; {2011#(<= 1 main_~c~0)} is VALID [2020-07-10 15:28:34,627 INFO L263 TraceCheckUtils]: 82: Hoare triple {2011#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {1958#true} is VALID [2020-07-10 15:28:34,627 INFO L280 TraceCheckUtils]: 83: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-10 15:28:34,627 INFO L280 TraceCheckUtils]: 84: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-10 15:28:34,627 INFO L280 TraceCheckUtils]: 85: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-10 15:28:34,628 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {1958#true} {2011#(<= 1 main_~c~0)} #172#return; {2011#(<= 1 main_~c~0)} is VALID [2020-07-10 15:28:34,629 INFO L263 TraceCheckUtils]: 87: Hoare triple {2011#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {2016#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:34,630 INFO L280 TraceCheckUtils]: 88: Hoare triple {2016#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2017#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:34,631 INFO L280 TraceCheckUtils]: 89: Hoare triple {2017#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1959#false} is VALID [2020-07-10 15:28:34,631 INFO L280 TraceCheckUtils]: 90: Hoare triple {1959#false} assume !false; {1959#false} is VALID [2020-07-10 15:28:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-07-10 15:28:34,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393365545] [2020-07-10 15:28:34,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:34,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:34,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747874371] [2020-07-10 15:28:34,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2020-07-10 15:28:34,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:34,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:34,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:34,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:34,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:34,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:34,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:34,703 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand 6 states. [2020-07-10 15:28:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:35,154 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2020-07-10 15:28:35,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:35,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2020-07-10 15:28:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2020-07-10 15:28:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2020-07-10 15:28:35,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 81 transitions. [2020-07-10 15:28:35,259 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 15:28:35,262 INFO L225 Difference]: With dead ends: 81 [2020-07-10 15:28:35,262 INFO L226 Difference]: Without dead ends: 79 [2020-07-10 15:28:35,262 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:35,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-10 15:28:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-07-10 15:28:35,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:35,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2020-07-10 15:28:35,343 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-10 15:28:35,344 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-10 15:28:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:35,349 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2020-07-10 15:28:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2020-07-10 15:28:35,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:35,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:35,350 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-10 15:28:35,350 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-10 15:28:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:35,354 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2020-07-10 15:28:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2020-07-10 15:28:35,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:35,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:35,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:35,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-10 15:28:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2020-07-10 15:28:35,360 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 91 [2020-07-10 15:28:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:35,360 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2020-07-10 15:28:35,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2020-07-10 15:28:35,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-07-10 15:28:35,362 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:35,362 INFO L422 BasicCegarLoop]: trace histogram [19, 18, 18, 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] [2020-07-10 15:28:35,362 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:28:35,363 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:35,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:35,363 INFO L82 PathProgramCache]: Analyzing trace with hash 299780712, now seen corresponding path program 1 times [2020-07-10 15:28:35,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:35,364 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605624685] [2020-07-10 15:28:35,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,483 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,483 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2414#true} {2414#true} #140#return; {2414#true} is VALID [2020-07-10 15:28:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,488 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #144#return; {2414#true} is VALID [2020-07-10 15:28:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,491 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,492 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,492 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #146#return; {2414#true} is VALID [2020-07-10 15:28:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,496 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,497 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #148#return; {2414#true} is VALID [2020-07-10 15:28:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,518 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,519 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,519 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #150#return; {2414#true} is VALID [2020-07-10 15:28:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,529 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,530 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,530 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #156#return; {2414#true} is VALID [2020-07-10 15:28:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,540 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,541 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,541 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,542 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #158#return; {2414#true} is VALID [2020-07-10 15:28:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,546 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,547 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,547 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,547 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #160#return; {2414#true} is VALID [2020-07-10 15:28:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,553 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,556 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #162#return; {2414#true} is VALID [2020-07-10 15:28:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,569 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,570 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,570 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #164#return; {2414#true} is VALID [2020-07-10 15:28:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,578 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,578 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #166#return; {2414#true} is VALID [2020-07-10 15:28:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,582 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,582 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #168#return; {2414#true} is VALID [2020-07-10 15:28:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,600 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,600 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #170#return; {2414#true} is VALID [2020-07-10 15:28:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,612 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,612 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #172#return; {2414#true} is VALID [2020-07-10 15:28:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,616 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,616 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,617 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,617 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #174#return; {2414#true} is VALID [2020-07-10 15:28:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,621 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,621 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,622 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,622 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #176#return; {2414#true} is VALID [2020-07-10 15:28:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,625 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,626 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #178#return; {2414#true} is VALID [2020-07-10 15:28:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,639 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,640 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,641 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2482#(<= (+ main_~c~0 2) main_~tokenlen~0)} #168#return; {2482#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-10 15:28:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,646 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,647 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2482#(<= (+ main_~c~0 2) main_~tokenlen~0)} #170#return; {2482#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-10 15:28:35,648 INFO L263 TraceCheckUtils]: 0: Hoare triple {2414#true} call ULTIMATE.init(); {2414#true} is VALID [2020-07-10 15:28:35,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,648 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2414#true} {2414#true} #140#return; {2414#true} is VALID [2020-07-10 15:28:35,648 INFO L263 TraceCheckUtils]: 3: Hoare triple {2414#true} call #t~ret11 := main(); {2414#true} is VALID [2020-07-10 15:28:35,649 INFO L280 TraceCheckUtils]: 4: Hoare triple {2414#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~scheme~0 := #t~nondet2;havoc #t~nondet2; {2414#true} is VALID [2020-07-10 15:28:35,649 INFO L280 TraceCheckUtils]: 5: Hoare triple {2414#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {2414#true} is VALID [2020-07-10 15:28:35,649 INFO L280 TraceCheckUtils]: 6: Hoare triple {2414#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {2414#true} is VALID [2020-07-10 15:28:35,649 INFO L280 TraceCheckUtils]: 7: Hoare triple {2414#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {2414#true} is VALID [2020-07-10 15:28:35,650 INFO L280 TraceCheckUtils]: 8: Hoare triple {2414#true} assume ~urilen~0 > 0; {2414#true} is VALID [2020-07-10 15:28:35,650 INFO L280 TraceCheckUtils]: 9: Hoare triple {2414#true} assume ~tokenlen~0 > 0; {2414#true} is VALID [2020-07-10 15:28:35,650 INFO L280 TraceCheckUtils]: 10: Hoare triple {2414#true} assume ~scheme~0 >= 0; {2414#true} is VALID [2020-07-10 15:28:35,650 INFO L280 TraceCheckUtils]: 11: Hoare triple {2414#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {2414#true} is VALID [2020-07-10 15:28:35,651 INFO L263 TraceCheckUtils]: 12: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,651 INFO L280 TraceCheckUtils]: 13: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,651 INFO L280 TraceCheckUtils]: 14: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,652 INFO L280 TraceCheckUtils]: 15: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,652 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2414#true} {2414#true} #144#return; {2414#true} is VALID [2020-07-10 15:28:35,652 INFO L263 TraceCheckUtils]: 17: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,652 INFO L280 TraceCheckUtils]: 18: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,652 INFO L280 TraceCheckUtils]: 19: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,653 INFO L280 TraceCheckUtils]: 20: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,653 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2414#true} {2414#true} #146#return; {2414#true} is VALID [2020-07-10 15:28:35,653 INFO L280 TraceCheckUtils]: 22: Hoare triple {2414#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2414#true} is VALID [2020-07-10 15:28:35,654 INFO L280 TraceCheckUtils]: 23: Hoare triple {2414#true} assume 0 != #t~nondet3;havoc #t~nondet3; {2414#true} is VALID [2020-07-10 15:28:35,654 INFO L263 TraceCheckUtils]: 24: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,654 INFO L280 TraceCheckUtils]: 25: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,654 INFO L280 TraceCheckUtils]: 26: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,655 INFO L280 TraceCheckUtils]: 27: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,655 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2414#true} {2414#true} #148#return; {2414#true} is VALID [2020-07-10 15:28:35,655 INFO L263 TraceCheckUtils]: 29: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,656 INFO L280 TraceCheckUtils]: 30: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,656 INFO L280 TraceCheckUtils]: 31: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,656 INFO L280 TraceCheckUtils]: 32: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,656 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2414#true} {2414#true} #150#return; {2414#true} is VALID [2020-07-10 15:28:35,657 INFO L280 TraceCheckUtils]: 34: Hoare triple {2414#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2414#true} is VALID [2020-07-10 15:28:35,657 INFO L280 TraceCheckUtils]: 35: Hoare triple {2414#true} assume 0 != #t~nondet4;havoc #t~nondet4; {2414#true} is VALID [2020-07-10 15:28:35,657 INFO L263 TraceCheckUtils]: 36: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,657 INFO L280 TraceCheckUtils]: 37: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,658 INFO L280 TraceCheckUtils]: 38: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,658 INFO L280 TraceCheckUtils]: 39: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,658 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2414#true} {2414#true} #156#return; {2414#true} is VALID [2020-07-10 15:28:35,659 INFO L263 TraceCheckUtils]: 41: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,659 INFO L280 TraceCheckUtils]: 42: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,659 INFO L280 TraceCheckUtils]: 43: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,659 INFO L280 TraceCheckUtils]: 44: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,660 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2414#true} {2414#true} #158#return; {2414#true} is VALID [2020-07-10 15:28:35,660 INFO L280 TraceCheckUtils]: 46: Hoare triple {2414#true} assume !(~cp~0 == ~urilen~0 - 1); {2414#true} is VALID [2020-07-10 15:28:35,660 INFO L263 TraceCheckUtils]: 47: Hoare triple {2414#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,660 INFO L280 TraceCheckUtils]: 48: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,661 INFO L280 TraceCheckUtils]: 49: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,661 INFO L280 TraceCheckUtils]: 50: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,661 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2414#true} {2414#true} #160#return; {2414#true} is VALID [2020-07-10 15:28:35,661 INFO L263 TraceCheckUtils]: 52: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,662 INFO L280 TraceCheckUtils]: 53: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,662 INFO L280 TraceCheckUtils]: 54: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,662 INFO L280 TraceCheckUtils]: 55: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,662 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2414#true} {2414#true} #162#return; {2414#true} is VALID [2020-07-10 15:28:35,663 INFO L280 TraceCheckUtils]: 57: Hoare triple {2414#true} assume !(1 + ~cp~0 == ~urilen~0 - 1);#t~pre6 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre6;~scheme~0 := ~cp~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2414#true} is VALID [2020-07-10 15:28:35,663 INFO L280 TraceCheckUtils]: 58: Hoare triple {2414#true} assume 0 != #t~nondet7;havoc #t~nondet7;~c~0 := 0; {2414#true} is VALID [2020-07-10 15:28:35,663 INFO L263 TraceCheckUtils]: 59: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,663 INFO L280 TraceCheckUtils]: 60: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,663 INFO L280 TraceCheckUtils]: 61: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,663 INFO L280 TraceCheckUtils]: 62: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,664 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {2414#true} {2414#true} #164#return; {2414#true} is VALID [2020-07-10 15:28:35,664 INFO L263 TraceCheckUtils]: 64: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,664 INFO L280 TraceCheckUtils]: 65: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,664 INFO L280 TraceCheckUtils]: 66: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,665 INFO L280 TraceCheckUtils]: 67: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,665 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {2414#true} {2414#true} #166#return; {2414#true} is VALID [2020-07-10 15:28:35,665 INFO L280 TraceCheckUtils]: 69: Hoare triple {2414#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {2414#true} is VALID [2020-07-10 15:28:35,665 INFO L263 TraceCheckUtils]: 70: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,666 INFO L280 TraceCheckUtils]: 71: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,666 INFO L280 TraceCheckUtils]: 72: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,666 INFO L280 TraceCheckUtils]: 73: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,667 INFO L275 TraceCheckUtils]: 74: Hoare quadruple {2414#true} {2414#true} #168#return; {2414#true} is VALID [2020-07-10 15:28:35,667 INFO L263 TraceCheckUtils]: 75: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,667 INFO L280 TraceCheckUtils]: 76: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,667 INFO L280 TraceCheckUtils]: 77: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,667 INFO L280 TraceCheckUtils]: 78: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,668 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {2414#true} {2414#true} #170#return; {2414#true} is VALID [2020-07-10 15:28:35,668 INFO L280 TraceCheckUtils]: 80: Hoare triple {2414#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2414#true} is VALID [2020-07-10 15:28:35,668 INFO L280 TraceCheckUtils]: 81: Hoare triple {2414#true} assume 0 != #t~nondet8;havoc #t~nondet8;#t~pre9 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre9; {2414#true} is VALID [2020-07-10 15:28:35,668 INFO L263 TraceCheckUtils]: 82: Hoare triple {2414#true} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,669 INFO L280 TraceCheckUtils]: 83: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,669 INFO L280 TraceCheckUtils]: 84: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,669 INFO L280 TraceCheckUtils]: 85: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,683 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {2414#true} {2414#true} #172#return; {2414#true} is VALID [2020-07-10 15:28:35,684 INFO L263 TraceCheckUtils]: 87: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,684 INFO L280 TraceCheckUtils]: 88: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,684 INFO L280 TraceCheckUtils]: 89: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,684 INFO L280 TraceCheckUtils]: 90: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,684 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {2414#true} {2414#true} #174#return; {2414#true} is VALID [2020-07-10 15:28:35,685 INFO L263 TraceCheckUtils]: 92: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,685 INFO L280 TraceCheckUtils]: 93: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,685 INFO L280 TraceCheckUtils]: 94: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,686 INFO L280 TraceCheckUtils]: 95: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,686 INFO L275 TraceCheckUtils]: 96: Hoare quadruple {2414#true} {2414#true} #176#return; {2414#true} is VALID [2020-07-10 15:28:35,689 INFO L263 TraceCheckUtils]: 97: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,690 INFO L280 TraceCheckUtils]: 98: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,690 INFO L280 TraceCheckUtils]: 99: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,690 INFO L280 TraceCheckUtils]: 100: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,690 INFO L275 TraceCheckUtils]: 101: Hoare quadruple {2414#true} {2414#true} #178#return; {2414#true} is VALID [2020-07-10 15:28:35,691 INFO L280 TraceCheckUtils]: 102: Hoare triple {2414#true} #t~pre10 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre10; {2414#true} is VALID [2020-07-10 15:28:35,699 INFO L280 TraceCheckUtils]: 103: Hoare triple {2414#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {2482#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-10 15:28:35,700 INFO L263 TraceCheckUtils]: 104: Hoare triple {2482#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,700 INFO L280 TraceCheckUtils]: 105: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,700 INFO L280 TraceCheckUtils]: 106: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,700 INFO L280 TraceCheckUtils]: 107: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,703 INFO L275 TraceCheckUtils]: 108: Hoare quadruple {2414#true} {2482#(<= (+ main_~c~0 2) main_~tokenlen~0)} #168#return; {2482#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-10 15:28:35,703 INFO L263 TraceCheckUtils]: 109: Hoare triple {2482#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-10 15:28:35,703 INFO L280 TraceCheckUtils]: 110: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-10 15:28:35,704 INFO L280 TraceCheckUtils]: 111: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-10 15:28:35,704 INFO L280 TraceCheckUtils]: 112: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:35,705 INFO L275 TraceCheckUtils]: 113: Hoare quadruple {2414#true} {2482#(<= (+ main_~c~0 2) main_~tokenlen~0)} #170#return; {2482#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-10 15:28:35,705 INFO L280 TraceCheckUtils]: 114: Hoare triple {2482#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2482#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-10 15:28:35,706 INFO L280 TraceCheckUtils]: 115: Hoare triple {2482#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume 0 != #t~nondet8;havoc #t~nondet8;#t~pre9 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre9; {2491#(< main_~c~0 main_~tokenlen~0)} is VALID [2020-07-10 15:28:35,707 INFO L263 TraceCheckUtils]: 116: Hoare triple {2491#(< main_~c~0 main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {2492#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:35,707 INFO L280 TraceCheckUtils]: 117: Hoare triple {2492#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2493#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:35,708 INFO L280 TraceCheckUtils]: 118: Hoare triple {2493#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2415#false} is VALID [2020-07-10 15:28:35,708 INFO L280 TraceCheckUtils]: 119: Hoare triple {2415#false} assume !false; {2415#false} is VALID [2020-07-10 15:28:35,717 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2020-07-10 15:28:35,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605624685] [2020-07-10 15:28:35,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:35,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:35,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213756666] [2020-07-10 15:28:35,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2020-07-10 15:28:35,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:35,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:35,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:35,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:35,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:35,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:35,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:35,795 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 6 states. [2020-07-10 15:28:36,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:36,196 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2020-07-10 15:28:36,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:36,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2020-07-10 15:28:36,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-10 15:28:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-10 15:28:36,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2020-07-10 15:28:36,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:36,275 INFO L225 Difference]: With dead ends: 82 [2020-07-10 15:28:36,275 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:28:36,277 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 15:28:36,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:28:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:28:36,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:36,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:36,278 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:36,278 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:36,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:36,279 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:36,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:36,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:36,279 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:36,279 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:36,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:36,279 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:36,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:36,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:36,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:36,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:36,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:28:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:28:36,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2020-07-10 15:28:36,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:36,280 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:28:36,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:36,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:36,281 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:28:36,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:28:36,867 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:28:36,868 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:36,868 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:36,868 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:28:36,868 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:28:36,868 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:28:36,868 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:28:36,869 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 15:28:36,869 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:28:36,869 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:28:36,869 INFO L264 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0) (< main_~c~0 main_~tokenlen~0)) [2020-07-10 15:28:36,870 INFO L264 CegarLoopResult]: At program point L60-1(line 60) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0) (< main_~c~0 main_~tokenlen~0)) [2020-07-10 15:28:36,870 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 72) no Hoare annotation was computed. [2020-07-10 15:28:36,870 INFO L264 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (= 0 main_~c~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 15:28:36,870 INFO L264 CegarLoopResult]: At program point L52-1(line 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (= 0 main_~c~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 15:28:36,870 INFO L264 CegarLoopResult]: At program point L36-1(lines 35 41) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 15:28:36,871 INFO L264 CegarLoopResult]: At program point L36-2(lines 36 41) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 15:28:36,871 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0) (< main_~c~0 main_~tokenlen~0)) [2020-07-10 15:28:36,871 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 15:28:36,871 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 15:28:36,871 INFO L271 CegarLoopResult]: At program point L70(lines 14 72) the Hoare annotation is: true [2020-07-10 15:28:36,871 INFO L268 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2020-07-10 15:28:36,872 INFO L264 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0) (< main_~c~0 main_~tokenlen~0)) [2020-07-10 15:28:36,872 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-10 15:28:36,872 INFO L264 CegarLoopResult]: At program point L54-1(lines 53 66) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 (< main_~c~0 main_~tokenlen~0)) (and .cse0 .cse1 (= 0 main_~c~0) .cse2))) [2020-07-10 15:28:36,872 INFO L268 CegarLoopResult]: For program point L46(lines 33 69) no Hoare annotation was computed. [2020-07-10 15:28:36,872 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 72) no Hoare annotation was computed. [2020-07-10 15:28:36,872 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 15:28:36,873 INFO L264 CegarLoopResult]: At program point L38-1(line 38) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-10 15:28:36,873 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 72) the Hoare annotation is: true [2020-07-10 15:28:36,873 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-10 15:28:36,873 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-07-10 15:28:36,873 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 15:28:36,873 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 15:28:36,874 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse2 (<= 1 main_~cp~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 main_~c~0) .cse4) (and .cse0 .cse1 (<= 1 main_~c~0) .cse2 .cse3 .cse4))) [2020-07-10 15:28:36,874 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-10 15:28:36,874 INFO L264 CegarLoopResult]: At program point L56-1(line 56) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse2 (<= 1 main_~cp~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 main_~c~0) .cse4) (and .cse0 .cse1 (<= 1 main_~c~0) .cse2 .cse3 .cse4))) [2020-07-10 15:28:36,874 INFO L268 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-07-10 15:28:36,874 INFO L268 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2020-07-10 15:28:36,874 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-10 15:28:36,874 INFO L268 CegarLoopResult]: For program point L24-1(lines 14 72) no Hoare annotation was computed. [2020-07-10 15:28:36,875 INFO L268 CegarLoopResult]: For program point L33(lines 33 69) no Hoare annotation was computed. [2020-07-10 15:28:36,875 INFO L268 CegarLoopResult]: For program point L58(lines 58 64) no Hoare annotation was computed. [2020-07-10 15:28:36,875 INFO L268 CegarLoopResult]: For program point L25(lines 14 72) no Hoare annotation was computed. [2020-07-10 15:28:36,875 INFO L268 CegarLoopResult]: For program point L58-1(lines 58 64) no Hoare annotation was computed. [2020-07-10 15:28:36,875 INFO L268 CegarLoopResult]: For program point L50(lines 50 68) no Hoare annotation was computed. [2020-07-10 15:28:36,875 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 15:28:36,875 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 15:28:36,875 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-10 15:28:36,876 INFO L268 CegarLoopResult]: For program point L26(lines 14 72) no Hoare annotation was computed. [2020-07-10 15:28:36,876 INFO L268 CegarLoopResult]: For program point L43(lines 33 69) no Hoare annotation was computed. [2020-07-10 15:28:36,876 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 15:28:36,876 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:28:36,876 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-10 15:28:36,876 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:28:36,876 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:28:36,876 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-10 15:28:36,880 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:28:36,881 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:28:36,881 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 15:28:36,881 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:28:36,881 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:28:36,881 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:36,881 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:36,881 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:36,881 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 15:28:36,881 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 15:28:36,881 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:28:36,881 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:28:36,881 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:36,882 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:28:36,882 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:28:36,882 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:28:36,882 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:28:36,882 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:28:36,882 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:28:36,882 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-10 15:28:36,882 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:28:36,882 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:28:36,882 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:28:36,882 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,882 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,882 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,883 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,883 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,883 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,883 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,883 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,883 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,883 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,883 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,883 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,883 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,884 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,884 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,884 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,884 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,884 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:36,884 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:28:36,884 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:28:36,884 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-10 15:28:36,885 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-10 15:28:36,893 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:28:36,893 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 15:28:36,893 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 15:28:36,893 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 15:28:36,894 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 15:28:36,894 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 15:28:36,894 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:28:36,894 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:28:36,894 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:28:36,895 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-10 15:28:36,896 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-10 15:28:36,896 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-10 15:28:36,896 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-10 15:28:36,896 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-10 15:28:36,896 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-10 15:28:36,896 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:28:36,896 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 15:28:36,896 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 15:28:36,896 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:28:36,897 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:28:36,897 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 15:28:36,897 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 15:28:36,897 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-10 15:28:36,897 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-10 15:28:36,897 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 15:28:36,897 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 15:28:36,897 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 15:28:36,898 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 15:28:36,898 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:28:36,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:28:36 BoogieIcfgContainer [2020-07-10 15:28:36,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:28:36,935 INFO L168 Benchmark]: Toolchain (without parser) took 9226.68 ms. Allocated memory was 138.4 MB in the beginning and 335.5 MB in the end (delta: 197.1 MB). Free memory was 102.8 MB in the beginning and 243.8 MB in the end (delta: -140.9 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:36,936 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:28:36,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.80 ms. Allocated memory is still 138.4 MB. Free memory was 102.6 MB in the beginning and 91.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:36,940 INFO L168 Benchmark]: Boogie Preprocessor took 135.39 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 91.5 MB in the beginning and 180.5 MB in the end (delta: -88.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:36,940 INFO L168 Benchmark]: RCFGBuilder took 642.72 ms. Allocated memory is still 202.4 MB. Free memory was 180.5 MB in the beginning and 144.3 MB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:36,941 INFO L168 Benchmark]: TraceAbstraction took 8128.53 ms. Allocated memory was 202.4 MB in the beginning and 335.5 MB in the end (delta: 133.2 MB). Free memory was 143.7 MB in the beginning and 243.8 MB in the end (delta: -100.1 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:36,946 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 303.80 ms. Allocated memory is still 138.4 MB. Free memory was 102.6 MB in the beginning and 91.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.39 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 91.5 MB in the beginning and 180.5 MB in the end (delta: -88.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 642.72 ms. Allocated memory is still 202.4 MB. Free memory was 180.5 MB in the beginning and 144.3 MB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8128.53 ms. Allocated memory was 202.4 MB in the beginning and 335.5 MB in the end (delta: 133.2 MB). Free memory was 143.7 MB in the beginning and 243.8 MB in the end (delta: -100.1 MB). Peak memory consumption was 33.0 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: (0 < scheme + 1 && 1 <= cp) && cp < urilen - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((0 < scheme + 1 && 1 <= c) && 1 <= cp) && cp < urilen) && c < tokenlen) || (((0 < scheme + 1 && 1 <= cp) && 0 == c) && cp < urilen) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.4s, OverallIterations: 7, TraceHistogramMax: 19, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 461 SDtfs, 104 SDslu, 1191 SDs, 0 SdLazy, 380 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred 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: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 77 PreInvPairs, 108 NumberOfFragments, 440 HoareAnnotationTreeSize, 77 FomulaSimplifications, 380 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 26 FomulaSimplificationsInter, 107 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 435 NumberOfCodeBlocks, 435 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 48206 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1426/1426 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...