/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-267fbe0 [2020-07-17 22:51:13,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:51:13,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:51:13,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:51:13,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:51:13,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:51:13,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:51:13,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:51:13,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:51:13,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:51:13,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:51:13,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:51:13,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:51:13,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:51:13,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:51:13,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:51:13,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:51:13,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:51:13,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:51:13,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:51:13,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:51:13,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:51:13,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:51:13,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:51:13,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:51:13,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:51:13,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:51:13,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:51:13,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:51:13,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:51:13,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:51:13,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:51:13,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:51:13,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:51:13,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:51:13,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:51:13,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:51:13,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:51:13,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:51:13,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:51:13,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:51:13,193 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-17 22:51:13,229 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:51:13,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:51:13,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:51:13,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:51:13,231 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:51:13,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:51:13,231 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:51:13,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:51:13,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:51:13,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:51:13,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:51:13,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:51:13,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:51:13,235 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:51:13,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:51:13,235 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:51:13,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:51:13,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:51:13,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:51:13,236 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:51:13,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:51:13,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:51:13,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:51:13,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:51:13,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:51:13,238 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:51:13,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:51:13,238 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:51:13,238 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:51:13,239 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:51:13,535 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:51:13,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:51:13,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:51:13,559 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:51:13,559 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:51:13,560 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-17 22:51:13,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b28bfb95/0fc98686a00d442a8857fa8c30aa5db5/FLAGe1deabfd0 [2020-07-17 22:51:14,072 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:51:14,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-07-17 22:51:14,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b28bfb95/0fc98686a00d442a8857fa8c30aa5db5/FLAGe1deabfd0 [2020-07-17 22:51:14,454 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b28bfb95/0fc98686a00d442a8857fa8c30aa5db5 [2020-07-17 22:51:14,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:51:14,464 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:51:14,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:14,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:51:14,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:51:14,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:14" (1/1) ... [2020-07-17 22:51:14,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@254bbcfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:14, skipping insertion in model container [2020-07-17 22:51:14,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:14" (1/1) ... [2020-07-17 22:51:14,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:51:14,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:51:14,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:14,677 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:51:14,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:14,720 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:51:14,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:14 WrapperNode [2020-07-17 22:51:14,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:14,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:51:14,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:51:14,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:51:14,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:14" (1/1) ... [2020-07-17 22:51:14,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:14" (1/1) ... [2020-07-17 22:51:14,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:14" (1/1) ... [2020-07-17 22:51:14,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:14" (1/1) ... [2020-07-17 22:51:14,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:14" (1/1) ... [2020-07-17 22:51:14,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:14" (1/1) ... [2020-07-17 22:51:14,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:14" (1/1) ... [2020-07-17 22:51:14,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:51:14,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:51:14,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:51:14,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:51:14,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:14" (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-17 22:51:14,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:51:14,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:51:14,915 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:51:14,915 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:51:14,915 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:51:14,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:51:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:51:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:51:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:51:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:51:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:51:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:51:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:51:15,473 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:51:15,473 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-17 22:51:15,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:15 BoogieIcfgContainer [2020-07-17 22:51:15,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:51:15,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:51:15,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:51:15,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:51:15,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:51:14" (1/3) ... [2020-07-17 22:51:15,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d08ff6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:15, skipping insertion in model container [2020-07-17 22:51:15,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:14" (2/3) ... [2020-07-17 22:51:15,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d08ff6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:15, skipping insertion in model container [2020-07-17 22:51:15,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:15" (3/3) ... [2020-07-17 22:51:15,486 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2020-07-17 22:51:15,496 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:51:15,503 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:51:15,517 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:51:15,539 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:51:15,539 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:51:15,539 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:51:15,539 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:51:15,540 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:51:15,540 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:51:15,540 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:51:15,540 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:51:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2020-07-17 22:51:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:51:15,566 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:15,567 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:15,568 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:15,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:15,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1626077920, now seen corresponding path program 1 times [2020-07-17 22:51:15,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:15,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364446289] [2020-07-17 22:51:15,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:15,818 INFO L280 TraceCheckUtils]: 0: Hoare triple {56#true} assume true; {56#true} is VALID [2020-07-17 22:51:15,819 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {56#true} {56#true} #140#return; {56#true} is VALID [2020-07-17 22:51:15,821 INFO L263 TraceCheckUtils]: 0: Hoare triple {56#true} call ULTIMATE.init(); {56#true} is VALID [2020-07-17 22:51:15,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {56#true} assume true; {56#true} is VALID [2020-07-17 22:51:15,822 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {56#true} {56#true} #140#return; {56#true} is VALID [2020-07-17 22:51:15,823 INFO L263 TraceCheckUtils]: 3: Hoare triple {56#true} call #t~ret11 := main(); {56#true} is VALID [2020-07-17 22:51:15,823 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-17 22:51:15,824 INFO L280 TraceCheckUtils]: 5: Hoare triple {56#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {56#true} is VALID [2020-07-17 22:51:15,824 INFO L280 TraceCheckUtils]: 6: Hoare triple {56#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {56#true} is VALID [2020-07-17 22:51:15,825 INFO L280 TraceCheckUtils]: 7: Hoare triple {56#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {56#true} is VALID [2020-07-17 22:51:15,825 INFO L280 TraceCheckUtils]: 8: Hoare triple {56#true} assume ~urilen~0 > 0; {56#true} is VALID [2020-07-17 22:51:15,826 INFO L280 TraceCheckUtils]: 9: Hoare triple {56#true} assume ~tokenlen~0 > 0; {56#true} is VALID [2020-07-17 22:51:15,826 INFO L280 TraceCheckUtils]: 10: Hoare triple {56#true} assume ~scheme~0 >= 0; {56#true} is VALID [2020-07-17 22:51:15,828 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-17 22:51:15,830 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-17 22:51:15,831 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-17 22:51:15,832 INFO L280 TraceCheckUtils]: 14: Hoare triple {62#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {57#false} is VALID [2020-07-17 22:51:15,833 INFO L280 TraceCheckUtils]: 15: Hoare triple {57#false} assume !false; {57#false} is VALID [2020-07-17 22:51:15,835 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-17 22:51:15,836 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364446289] [2020-07-17 22:51:15,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:15,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:15,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089330595] [2020-07-17 22:51:15,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-17 22:51:15,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:15,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:15,894 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-17 22:51:15,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:15,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:15,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:15,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:15,907 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 5 states. [2020-07-17 22:51:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,548 INFO L93 Difference]: Finished difference Result 111 states and 206 transitions. [2020-07-17 22:51:16,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:16,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-17 22:51:16,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:16,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2020-07-17 22:51:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2020-07-17 22:51:16,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 206 transitions. [2020-07-17 22:51:16,892 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-17 22:51:16,910 INFO L225 Difference]: With dead ends: 111 [2020-07-17 22:51:16,911 INFO L226 Difference]: Without dead ends: 63 [2020-07-17 22:51:16,923 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-17 22:51:16,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-17 22:51:17,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2020-07-17 22:51:17,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:17,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 56 states. [2020-07-17 22:51:17,003 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 56 states. [2020-07-17 22:51:17,003 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 56 states. [2020-07-17 22:51:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:17,013 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2020-07-17 22:51:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2020-07-17 22:51:17,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:17,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:17,016 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 63 states. [2020-07-17 22:51:17,016 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 63 states. [2020-07-17 22:51:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:17,024 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2020-07-17 22:51:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2020-07-17 22:51:17,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:17,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:17,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:17,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-17 22:51:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2020-07-17 22:51:17,035 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 16 [2020-07-17 22:51:17,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:17,036 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2020-07-17 22:51:17,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:17,036 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2020-07-17 22:51:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:51:17,037 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:17,038 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-17 22:51:17,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:51:17,038 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:17,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:17,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1393145919, now seen corresponding path program 1 times [2020-07-17 22:51:17,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:17,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703246603] [2020-07-17 22:51:17,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:17,141 INFO L280 TraceCheckUtils]: 0: Hoare triple {445#true} assume true; {445#true} is VALID [2020-07-17 22:51:17,142 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {445#true} {445#true} #140#return; {445#true} is VALID [2020-07-17 22:51:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:17,151 INFO L280 TraceCheckUtils]: 0: Hoare triple {445#true} ~cond := #in~cond; {445#true} is VALID [2020-07-17 22:51:17,152 INFO L280 TraceCheckUtils]: 1: Hoare triple {445#true} assume !(0 == ~cond); {445#true} is VALID [2020-07-17 22:51:17,152 INFO L280 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2020-07-17 22:51:17,154 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {445#true} {450#(<= 1 main_~cp~0)} #144#return; {450#(<= 1 main_~cp~0)} is VALID [2020-07-17 22:51:17,154 INFO L263 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2020-07-17 22:51:17,154 INFO L280 TraceCheckUtils]: 1: Hoare triple {445#true} assume true; {445#true} is VALID [2020-07-17 22:51:17,155 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {445#true} {445#true} #140#return; {445#true} is VALID [2020-07-17 22:51:17,155 INFO L263 TraceCheckUtils]: 3: Hoare triple {445#true} call #t~ret11 := main(); {445#true} is VALID [2020-07-17 22:51:17,155 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-17 22:51:17,156 INFO L280 TraceCheckUtils]: 5: Hoare triple {445#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {445#true} is VALID [2020-07-17 22:51:17,156 INFO L280 TraceCheckUtils]: 6: Hoare triple {445#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {445#true} is VALID [2020-07-17 22:51:17,157 INFO L280 TraceCheckUtils]: 7: Hoare triple {445#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {445#true} is VALID [2020-07-17 22:51:17,157 INFO L280 TraceCheckUtils]: 8: Hoare triple {445#true} assume ~urilen~0 > 0; {445#true} is VALID [2020-07-17 22:51:17,157 INFO L280 TraceCheckUtils]: 9: Hoare triple {445#true} assume ~tokenlen~0 > 0; {445#true} is VALID [2020-07-17 22:51:17,166 INFO L280 TraceCheckUtils]: 10: Hoare triple {445#true} assume ~scheme~0 >= 0; {449#(< 0 (+ main_~scheme~0 1))} is VALID [2020-07-17 22:51:17,169 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-17 22:51:17,169 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-17 22:51:17,169 INFO L280 TraceCheckUtils]: 13: Hoare triple {445#true} ~cond := #in~cond; {445#true} is VALID [2020-07-17 22:51:17,170 INFO L280 TraceCheckUtils]: 14: Hoare triple {445#true} assume !(0 == ~cond); {445#true} is VALID [2020-07-17 22:51:17,170 INFO L280 TraceCheckUtils]: 15: Hoare triple {445#true} assume true; {445#true} is VALID [2020-07-17 22:51:17,171 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {445#true} {450#(<= 1 main_~cp~0)} #144#return; {450#(<= 1 main_~cp~0)} is VALID [2020-07-17 22:51:17,174 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-17 22:51:17,175 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-17 22:51:17,179 INFO L280 TraceCheckUtils]: 19: Hoare triple {456#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {446#false} is VALID [2020-07-17 22:51:17,179 INFO L280 TraceCheckUtils]: 20: Hoare triple {446#false} assume !false; {446#false} is VALID [2020-07-17 22:51:17,181 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-17 22:51:17,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703246603] [2020-07-17 22:51:17,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:17,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:51:17,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806491506] [2020-07-17 22:51:17,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-17 22:51:17,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:17,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:17,209 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-17 22:51:17,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:17,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:17,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:17,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:17,210 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 6 states. [2020-07-17 22:51:17,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:17,785 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2020-07-17 22:51:17,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:51:17,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-17 22:51:17,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-17 22:51:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-17 22:51:17,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2020-07-17 22:51:17,882 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-17 22:51:17,887 INFO L225 Difference]: With dead ends: 62 [2020-07-17 22:51:17,887 INFO L226 Difference]: Without dead ends: 60 [2020-07-17 22:51:17,888 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-17 22:51:17,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-17 22:51:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-07-17 22:51:17,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:17,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2020-07-17 22:51:17,960 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2020-07-17 22:51:17,960 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2020-07-17 22:51:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:17,965 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2020-07-17 22:51:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2020-07-17 22:51:17,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:17,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:17,968 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2020-07-17 22:51:17,968 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2020-07-17 22:51:17,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:17,972 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2020-07-17 22:51:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2020-07-17 22:51:17,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:17,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:17,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:17,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-17 22:51:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2020-07-17 22:51:17,978 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 21 [2020-07-17 22:51:17,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:17,978 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2020-07-17 22:51:17,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2020-07-17 22:51:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-17 22:51:17,980 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:17,980 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-17 22:51:17,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:51:17,981 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:17,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:17,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1101915893, now seen corresponding path program 1 times [2020-07-17 22:51:17,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:17,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433241134] [2020-07-17 22:51:17,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,040 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-17 22:51:18,041 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {765#true} {765#true} #140#return; {765#true} is VALID [2020-07-17 22:51:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,045 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-17 22:51:18,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-17 22:51:18,046 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-17 22:51:18,046 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #144#return; {765#true} is VALID [2020-07-17 22:51:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,064 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-17 22:51:18,064 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-17 22:51:18,065 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-17 22:51:18,065 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #146#return; {765#true} is VALID [2020-07-17 22:51:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,084 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-17 22:51:18,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-17 22:51:18,084 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-17 22:51:18,085 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #148#return; {765#true} is VALID [2020-07-17 22:51:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-17 22:51:18,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-17 22:51:18,104 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-17 22:51:18,104 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #150#return; {765#true} is VALID [2020-07-17 22:51:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,117 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-17 22:51:18,118 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-17 22:51:18,118 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-17 22:51:18,119 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-17 22:51:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,126 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-17 22:51:18,126 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-17 22:51:18,126 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-17 22:51:18,127 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-17 22:51:18,128 INFO L263 TraceCheckUtils]: 0: Hoare triple {765#true} call ULTIMATE.init(); {765#true} is VALID [2020-07-17 22:51:18,128 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-17 22:51:18,128 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {765#true} {765#true} #140#return; {765#true} is VALID [2020-07-17 22:51:18,129 INFO L263 TraceCheckUtils]: 3: Hoare triple {765#true} call #t~ret11 := main(); {765#true} is VALID [2020-07-17 22:51:18,129 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-17 22:51:18,129 INFO L280 TraceCheckUtils]: 5: Hoare triple {765#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {765#true} is VALID [2020-07-17 22:51:18,129 INFO L280 TraceCheckUtils]: 6: Hoare triple {765#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {765#true} is VALID [2020-07-17 22:51:18,130 INFO L280 TraceCheckUtils]: 7: Hoare triple {765#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {765#true} is VALID [2020-07-17 22:51:18,130 INFO L280 TraceCheckUtils]: 8: Hoare triple {765#true} assume ~urilen~0 > 0; {765#true} is VALID [2020-07-17 22:51:18,130 INFO L280 TraceCheckUtils]: 9: Hoare triple {765#true} assume ~tokenlen~0 > 0; {765#true} is VALID [2020-07-17 22:51:18,131 INFO L280 TraceCheckUtils]: 10: Hoare triple {765#true} assume ~scheme~0 >= 0; {765#true} is VALID [2020-07-17 22:51:18,131 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-17 22:51:18,131 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-17 22:51:18,131 INFO L280 TraceCheckUtils]: 13: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-17 22:51:18,132 INFO L280 TraceCheckUtils]: 14: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-17 22:51:18,132 INFO L280 TraceCheckUtils]: 15: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-17 22:51:18,132 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {765#true} {765#true} #144#return; {765#true} is VALID [2020-07-17 22:51:18,133 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-17 22:51:18,133 INFO L280 TraceCheckUtils]: 18: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-17 22:51:18,133 INFO L280 TraceCheckUtils]: 19: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-17 22:51:18,133 INFO L280 TraceCheckUtils]: 20: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-17 22:51:18,134 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {765#true} {765#true} #146#return; {765#true} is VALID [2020-07-17 22:51:18,134 INFO L280 TraceCheckUtils]: 22: Hoare triple {765#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {765#true} is VALID [2020-07-17 22:51:18,134 INFO L280 TraceCheckUtils]: 23: Hoare triple {765#true} assume 0 != #t~nondet3;havoc #t~nondet3; {765#true} is VALID [2020-07-17 22:51:18,135 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-17 22:51:18,135 INFO L280 TraceCheckUtils]: 25: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-17 22:51:18,135 INFO L280 TraceCheckUtils]: 26: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-17 22:51:18,135 INFO L280 TraceCheckUtils]: 27: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-17 22:51:18,136 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {765#true} {765#true} #148#return; {765#true} is VALID [2020-07-17 22:51:18,136 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-17 22:51:18,136 INFO L280 TraceCheckUtils]: 30: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-17 22:51:18,136 INFO L280 TraceCheckUtils]: 31: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-17 22:51:18,137 INFO L280 TraceCheckUtils]: 32: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-17 22:51:18,137 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {765#true} {765#true} #150#return; {765#true} is VALID [2020-07-17 22:51:18,138 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-17 22:51:18,138 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-17 22:51:18,138 INFO L280 TraceCheckUtils]: 36: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-17 22:51:18,139 INFO L280 TraceCheckUtils]: 37: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-17 22:51:18,139 INFO L280 TraceCheckUtils]: 38: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-17 22:51:18,140 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-17 22:51:18,140 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-17 22:51:18,140 INFO L280 TraceCheckUtils]: 41: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-17 22:51:18,141 INFO L280 TraceCheckUtils]: 42: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-17 22:51:18,141 INFO L280 TraceCheckUtils]: 43: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-17 22:51:18,142 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-17 22:51:18,143 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-17 22:51:18,143 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-17 22:51:18,143 INFO L280 TraceCheckUtils]: 47: Hoare triple {766#false} ~cond := #in~cond; {766#false} is VALID [2020-07-17 22:51:18,143 INFO L280 TraceCheckUtils]: 48: Hoare triple {766#false} assume 0 == ~cond; {766#false} is VALID [2020-07-17 22:51:18,144 INFO L280 TraceCheckUtils]: 49: Hoare triple {766#false} assume !false; {766#false} is VALID [2020-07-17 22:51:18,147 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-17 22:51:18,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433241134] [2020-07-17 22:51:18,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:18,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:51:18,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419609753] [2020-07-17 22:51:18,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-17 22:51:18,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:18,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:51:18,187 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-17 22:51:18,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:51:18,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:18,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:51:18,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:51:18,189 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand 3 states. [2020-07-17 22:51:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:18,441 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2020-07-17 22:51:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:51:18,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-17 22:51:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:51:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-17 22:51:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:51:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-17 22:51:18,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2020-07-17 22:51:18,568 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-17 22:51:18,572 INFO L225 Difference]: With dead ends: 89 [2020-07-17 22:51:18,572 INFO L226 Difference]: Without dead ends: 60 [2020-07-17 22:51:18,573 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-17 22:51:18,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-17 22:51:18,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-07-17 22:51:18,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:18,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2020-07-17 22:51:18,620 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2020-07-17 22:51:18,620 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2020-07-17 22:51:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:18,625 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2020-07-17 22:51:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2020-07-17 22:51:18,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:18,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:18,626 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2020-07-17 22:51:18,626 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2020-07-17 22:51:18,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:18,630 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2020-07-17 22:51:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2020-07-17 22:51:18,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:18,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:18,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:18,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-17 22:51:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2020-07-17 22:51:18,635 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 50 [2020-07-17 22:51:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:18,636 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2020-07-17 22:51:18,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:51:18,636 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2020-07-17 22:51:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-17 22:51:18,637 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:18,638 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-17 22:51:18,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:51:18,638 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:18,638 INFO L82 PathProgramCache]: Analyzing trace with hash 668905142, now seen corresponding path program 1 times [2020-07-17 22:51:18,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:18,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163258748] [2020-07-17 22:51:18,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,776 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-17 22:51:18,776 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1140#true} {1140#true} #140#return; {1140#true} is VALID [2020-07-17 22:51:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,784 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-17 22:51:18,784 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-17 22:51:18,784 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-17 22:51:18,785 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-17 22:51:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-17 22:51:18,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-17 22:51:18,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-17 22:51:18,792 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-17 22:51:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-17 22:51:18,798 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-17 22:51:18,799 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-17 22:51:18,800 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-17 22:51:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-17 22:51:18,805 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-17 22:51:18,806 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-17 22:51:18,807 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-17 22:51:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,813 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-17 22:51:18,813 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-17 22:51:18,813 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-17 22:51:18,814 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-17 22:51:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,823 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-17 22:51:18,823 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-17 22:51:18,824 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-17 22:51:18,824 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-17 22:51:18,825 INFO L263 TraceCheckUtils]: 0: Hoare triple {1140#true} call ULTIMATE.init(); {1140#true} is VALID [2020-07-17 22:51:18,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-17 22:51:18,825 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1140#true} {1140#true} #140#return; {1140#true} is VALID [2020-07-17 22:51:18,826 INFO L263 TraceCheckUtils]: 3: Hoare triple {1140#true} call #t~ret11 := main(); {1140#true} is VALID [2020-07-17 22:51:18,826 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-17 22:51:18,836 INFO L280 TraceCheckUtils]: 5: Hoare triple {1140#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1140#true} is VALID [2020-07-17 22:51:18,836 INFO L280 TraceCheckUtils]: 6: Hoare triple {1140#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1140#true} is VALID [2020-07-17 22:51:18,836 INFO L280 TraceCheckUtils]: 7: Hoare triple {1140#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1140#true} is VALID [2020-07-17 22:51:18,836 INFO L280 TraceCheckUtils]: 8: Hoare triple {1140#true} assume ~urilen~0 > 0; {1140#true} is VALID [2020-07-17 22:51:18,837 INFO L280 TraceCheckUtils]: 9: Hoare triple {1140#true} assume ~tokenlen~0 > 0; {1140#true} is VALID [2020-07-17 22:51:18,837 INFO L280 TraceCheckUtils]: 10: Hoare triple {1140#true} assume ~scheme~0 >= 0; {1140#true} is VALID [2020-07-17 22:51:18,842 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-17 22:51:18,842 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-17 22:51:18,842 INFO L280 TraceCheckUtils]: 13: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-17 22:51:18,842 INFO L280 TraceCheckUtils]: 14: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-17 22:51:18,843 INFO L280 TraceCheckUtils]: 15: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-17 22:51:18,844 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-17 22:51:18,844 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-17 22:51:18,844 INFO L280 TraceCheckUtils]: 18: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-17 22:51:18,844 INFO L280 TraceCheckUtils]: 19: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-17 22:51:18,845 INFO L280 TraceCheckUtils]: 20: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-17 22:51:18,851 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-17 22:51:18,852 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-17 22:51:18,853 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-17 22:51:18,853 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-17 22:51:18,853 INFO L280 TraceCheckUtils]: 25: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-17 22:51:18,853 INFO L280 TraceCheckUtils]: 26: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-17 22:51:18,854 INFO L280 TraceCheckUtils]: 27: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-17 22:51:18,854 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-17 22:51:18,855 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-17 22:51:18,855 INFO L280 TraceCheckUtils]: 30: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-17 22:51:18,855 INFO L280 TraceCheckUtils]: 31: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-17 22:51:18,855 INFO L280 TraceCheckUtils]: 32: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-17 22:51:18,856 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-17 22:51:18,857 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-17 22:51:18,858 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-17 22:51:18,858 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-17 22:51:18,858 INFO L280 TraceCheckUtils]: 37: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-17 22:51:18,859 INFO L280 TraceCheckUtils]: 38: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-17 22:51:18,859 INFO L280 TraceCheckUtils]: 39: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-17 22:51:18,860 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-17 22:51:18,860 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-17 22:51:18,861 INFO L280 TraceCheckUtils]: 42: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-17 22:51:18,861 INFO L280 TraceCheckUtils]: 43: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-17 22:51:18,861 INFO L280 TraceCheckUtils]: 44: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-17 22:51:18,867 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-17 22:51:18,868 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-17 22:51:18,869 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-17 22:51:18,870 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-17 22:51:18,870 INFO L280 TraceCheckUtils]: 49: Hoare triple {1171#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1141#false} is VALID [2020-07-17 22:51:18,871 INFO L280 TraceCheckUtils]: 50: Hoare triple {1141#false} assume !false; {1141#false} is VALID [2020-07-17 22:51:18,877 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-17 22:51:18,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163258748] [2020-07-17 22:51:18,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:18,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:51:18,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246158271] [2020-07-17 22:51:18,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2020-07-17 22:51:18,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:18,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:18,926 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-17 22:51:18,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:18,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:18,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:18,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:18,927 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 6 states. [2020-07-17 22:51:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:19,442 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2020-07-17 22:51:19,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:51:19,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2020-07-17 22:51:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-17 22:51:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-17 22:51:19,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2020-07-17 22:51:19,557 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-17 22:51:19,559 INFO L225 Difference]: With dead ends: 67 [2020-07-17 22:51:19,559 INFO L226 Difference]: Without dead ends: 65 [2020-07-17 22:51:19,562 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-17 22:51:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-17 22:51:19,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2020-07-17 22:51:19,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:19,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 64 states. [2020-07-17 22:51:19,632 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 64 states. [2020-07-17 22:51:19,632 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 64 states. [2020-07-17 22:51:19,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:19,637 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2020-07-17 22:51:19,637 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2020-07-17 22:51:19,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:19,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:19,638 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 65 states. [2020-07-17 22:51:19,638 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 65 states. [2020-07-17 22:51:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:19,642 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2020-07-17 22:51:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2020-07-17 22:51:19,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:19,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:19,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:19,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-17 22:51:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2020-07-17 22:51:19,647 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 51 [2020-07-17 22:51:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:19,648 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2020-07-17 22:51:19,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2020-07-17 22:51:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-17 22:51:19,649 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:19,649 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-17 22:51:19,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:51:19,650 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:19,650 INFO L82 PathProgramCache]: Analyzing trace with hash -702087769, now seen corresponding path program 1 times [2020-07-17 22:51:19,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:19,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818602281] [2020-07-17 22:51:19,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,799 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1500#true} {1500#true} #140#return; {1500#true} is VALID [2020-07-17 22:51:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,804 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,804 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,804 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #144#return; {1500#true} is VALID [2020-07-17 22:51:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,812 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,813 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,813 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,813 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #146#return; {1500#true} is VALID [2020-07-17 22:51:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,822 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,823 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #148#return; {1500#true} is VALID [2020-07-17 22:51:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,831 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,832 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,832 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #150#return; {1500#true} is VALID [2020-07-17 22:51:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,838 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,838 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,839 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #156#return; {1500#true} is VALID [2020-07-17 22:51:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,846 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,846 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,846 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,847 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #158#return; {1500#true} is VALID [2020-07-17 22:51:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,868 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,868 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,869 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,869 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #160#return; {1500#true} is VALID [2020-07-17 22:51:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,880 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,881 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,881 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #162#return; {1500#true} is VALID [2020-07-17 22:51:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,890 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,890 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,890 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,891 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1536#(= 0 main_~c~0)} #164#return; {1536#(= 0 main_~c~0)} is VALID [2020-07-17 22:51:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,895 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,896 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,896 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,897 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1536#(= 0 main_~c~0)} #166#return; {1536#(= 0 main_~c~0)} is VALID [2020-07-17 22:51:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,902 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,903 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,903 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,904 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-17 22:51:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,910 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,910 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,911 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,911 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-17 22:51:19,912 INFO L263 TraceCheckUtils]: 0: Hoare triple {1500#true} call ULTIMATE.init(); {1500#true} is VALID [2020-07-17 22:51:19,912 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,912 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1500#true} {1500#true} #140#return; {1500#true} is VALID [2020-07-17 22:51:19,912 INFO L263 TraceCheckUtils]: 3: Hoare triple {1500#true} call #t~ret11 := main(); {1500#true} is VALID [2020-07-17 22:51:19,913 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-17 22:51:19,913 INFO L280 TraceCheckUtils]: 5: Hoare triple {1500#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1500#true} is VALID [2020-07-17 22:51:19,913 INFO L280 TraceCheckUtils]: 6: Hoare triple {1500#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1500#true} is VALID [2020-07-17 22:51:19,913 INFO L280 TraceCheckUtils]: 7: Hoare triple {1500#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1500#true} is VALID [2020-07-17 22:51:19,914 INFO L280 TraceCheckUtils]: 8: Hoare triple {1500#true} assume ~urilen~0 > 0; {1500#true} is VALID [2020-07-17 22:51:19,914 INFO L280 TraceCheckUtils]: 9: Hoare triple {1500#true} assume ~tokenlen~0 > 0; {1500#true} is VALID [2020-07-17 22:51:19,914 INFO L280 TraceCheckUtils]: 10: Hoare triple {1500#true} assume ~scheme~0 >= 0; {1500#true} is VALID [2020-07-17 22:51:19,914 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-17 22:51:19,915 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-17 22:51:19,915 INFO L280 TraceCheckUtils]: 13: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,915 INFO L280 TraceCheckUtils]: 14: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,915 INFO L280 TraceCheckUtils]: 15: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,916 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1500#true} {1500#true} #144#return; {1500#true} is VALID [2020-07-17 22:51:19,916 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-17 22:51:19,916 INFO L280 TraceCheckUtils]: 18: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,916 INFO L280 TraceCheckUtils]: 19: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,917 INFO L280 TraceCheckUtils]: 20: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,917 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1500#true} {1500#true} #146#return; {1500#true} is VALID [2020-07-17 22:51:19,917 INFO L280 TraceCheckUtils]: 22: Hoare triple {1500#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1500#true} is VALID [2020-07-17 22:51:19,917 INFO L280 TraceCheckUtils]: 23: Hoare triple {1500#true} assume 0 != #t~nondet3;havoc #t~nondet3; {1500#true} is VALID [2020-07-17 22:51:19,918 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-17 22:51:19,918 INFO L280 TraceCheckUtils]: 25: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,918 INFO L280 TraceCheckUtils]: 26: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,918 INFO L280 TraceCheckUtils]: 27: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,918 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1500#true} {1500#true} #148#return; {1500#true} is VALID [2020-07-17 22:51:19,919 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-17 22:51:19,919 INFO L280 TraceCheckUtils]: 30: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,919 INFO L280 TraceCheckUtils]: 31: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,919 INFO L280 TraceCheckUtils]: 32: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,920 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1500#true} {1500#true} #150#return; {1500#true} is VALID [2020-07-17 22:51:19,920 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-17 22:51:19,920 INFO L280 TraceCheckUtils]: 35: Hoare triple {1500#true} assume 0 != #t~nondet4;havoc #t~nondet4; {1500#true} is VALID [2020-07-17 22:51:19,920 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-17 22:51:19,921 INFO L280 TraceCheckUtils]: 37: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,921 INFO L280 TraceCheckUtils]: 38: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,921 INFO L280 TraceCheckUtils]: 39: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,921 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1500#true} {1500#true} #156#return; {1500#true} is VALID [2020-07-17 22:51:19,921 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-17 22:51:19,922 INFO L280 TraceCheckUtils]: 42: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,922 INFO L280 TraceCheckUtils]: 43: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,922 INFO L280 TraceCheckUtils]: 44: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,922 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1500#true} {1500#true} #158#return; {1500#true} is VALID [2020-07-17 22:51:19,923 INFO L280 TraceCheckUtils]: 46: Hoare triple {1500#true} assume !(~cp~0 == ~urilen~0 - 1); {1500#true} is VALID [2020-07-17 22:51:19,923 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-17 22:51:19,923 INFO L280 TraceCheckUtils]: 48: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,923 INFO L280 TraceCheckUtils]: 49: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,924 INFO L280 TraceCheckUtils]: 50: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,924 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {1500#true} {1500#true} #160#return; {1500#true} is VALID [2020-07-17 22:51:19,924 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-17 22:51:19,924 INFO L280 TraceCheckUtils]: 53: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,924 INFO L280 TraceCheckUtils]: 54: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,925 INFO L280 TraceCheckUtils]: 55: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,925 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {1500#true} {1500#true} #162#return; {1500#true} is VALID [2020-07-17 22:51:19,925 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-17 22:51:19,926 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-17 22:51:19,927 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-17 22:51:19,927 INFO L280 TraceCheckUtils]: 60: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,927 INFO L280 TraceCheckUtils]: 61: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,927 INFO L280 TraceCheckUtils]: 62: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,928 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {1500#true} {1536#(= 0 main_~c~0)} #164#return; {1536#(= 0 main_~c~0)} is VALID [2020-07-17 22:51:19,928 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-17 22:51:19,929 INFO L280 TraceCheckUtils]: 65: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,929 INFO L280 TraceCheckUtils]: 66: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,929 INFO L280 TraceCheckUtils]: 67: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,930 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {1500#true} {1536#(= 0 main_~c~0)} #166#return; {1536#(= 0 main_~c~0)} is VALID [2020-07-17 22:51:19,931 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-17 22:51:19,931 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-17 22:51:19,931 INFO L280 TraceCheckUtils]: 71: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,932 INFO L280 TraceCheckUtils]: 72: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,932 INFO L280 TraceCheckUtils]: 73: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,933 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-17 22:51:19,933 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-17 22:51:19,933 INFO L280 TraceCheckUtils]: 76: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-17 22:51:19,934 INFO L280 TraceCheckUtils]: 77: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-17 22:51:19,934 INFO L280 TraceCheckUtils]: 78: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-17 22:51:19,935 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-17 22:51:19,936 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-17 22:51:19,937 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-17 22:51:19,938 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-17 22:51:19,938 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-17 22:51:19,939 INFO L280 TraceCheckUtils]: 84: Hoare triple {1556#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1501#false} is VALID [2020-07-17 22:51:19,939 INFO L280 TraceCheckUtils]: 85: Hoare triple {1501#false} assume !false; {1501#false} is VALID [2020-07-17 22:51:19,946 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-17 22:51:19,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818602281] [2020-07-17 22:51:19,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:19,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:51:19,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494149219] [2020-07-17 22:51:19,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2020-07-17 22:51:19,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:19,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:51:20,002 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-17 22:51:20,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:51:20,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:20,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:51:20,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:51:20,003 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 7 states. [2020-07-17 22:51:20,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:20,506 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2020-07-17 22:51:20,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:51:20,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2020-07-17 22:51:20,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:51:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2020-07-17 22:51:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:51:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2020-07-17 22:51:20,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2020-07-17 22:51:20,614 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-17 22:51:20,618 INFO L225 Difference]: With dead ends: 83 [2020-07-17 22:51:20,618 INFO L226 Difference]: Without dead ends: 81 [2020-07-17 22:51:20,619 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-17 22:51:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-17 22:51:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2020-07-17 22:51:20,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:20,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 75 states. [2020-07-17 22:51:20,707 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 75 states. [2020-07-17 22:51:20,707 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 75 states. [2020-07-17 22:51:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:20,716 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2020-07-17 22:51:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2020-07-17 22:51:20,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:20,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:20,717 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 81 states. [2020-07-17 22:51:20,718 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 81 states. [2020-07-17 22:51:20,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:20,724 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2020-07-17 22:51:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2020-07-17 22:51:20,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:20,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:20,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:20,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-17 22:51:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2020-07-17 22:51:20,731 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 86 [2020-07-17 22:51:20,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:20,733 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2020-07-17 22:51:20,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:51:20,733 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2020-07-17 22:51:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-17 22:51:20,736 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:20,737 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-17 22:51:20,737 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:51:20,737 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:20,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:20,738 INFO L82 PathProgramCache]: Analyzing trace with hash 58209754, now seen corresponding path program 1 times [2020-07-17 22:51:20,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:20,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375228379] [2020-07-17 22:51:20,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,870 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,870 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1958#true} {1958#true} #140#return; {1958#true} is VALID [2020-07-17 22:51:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,875 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,875 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,876 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,876 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #144#return; {1958#true} is VALID [2020-07-17 22:51:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,880 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #146#return; {1958#true} is VALID [2020-07-17 22:51:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,883 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,884 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,884 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #148#return; {1958#true} is VALID [2020-07-17 22:51:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,889 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,889 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #150#return; {1958#true} is VALID [2020-07-17 22:51:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,893 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,893 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,894 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,894 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #156#return; {1958#true} is VALID [2020-07-17 22:51:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,898 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,898 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,899 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #158#return; {1958#true} is VALID [2020-07-17 22:51:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,902 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,903 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,903 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #160#return; {1958#true} is VALID [2020-07-17 22:51:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,907 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,907 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,908 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #162#return; {1958#true} is VALID [2020-07-17 22:51:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,912 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,913 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,913 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,914 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #164#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-17 22:51:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,920 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,921 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #166#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-17 22:51:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,927 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,927 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #168#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-17 22:51:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,932 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,932 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,933 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,933 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #170#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-17 22:51:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,938 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,938 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,939 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {2011#(<= 1 main_~c~0)} #172#return; {2011#(<= 1 main_~c~0)} is VALID [2020-07-17 22:51:20,939 INFO L263 TraceCheckUtils]: 0: Hoare triple {1958#true} call ULTIMATE.init(); {1958#true} is VALID [2020-07-17 22:51:20,940 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,940 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1958#true} {1958#true} #140#return; {1958#true} is VALID [2020-07-17 22:51:20,940 INFO L263 TraceCheckUtils]: 3: Hoare triple {1958#true} call #t~ret11 := main(); {1958#true} is VALID [2020-07-17 22:51:20,941 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-17 22:51:20,941 INFO L280 TraceCheckUtils]: 5: Hoare triple {1958#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1958#true} is VALID [2020-07-17 22:51:20,941 INFO L280 TraceCheckUtils]: 6: Hoare triple {1958#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1958#true} is VALID [2020-07-17 22:51:20,941 INFO L280 TraceCheckUtils]: 7: Hoare triple {1958#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1958#true} is VALID [2020-07-17 22:51:20,942 INFO L280 TraceCheckUtils]: 8: Hoare triple {1958#true} assume ~urilen~0 > 0; {1958#true} is VALID [2020-07-17 22:51:20,942 INFO L280 TraceCheckUtils]: 9: Hoare triple {1958#true} assume ~tokenlen~0 > 0; {1958#true} is VALID [2020-07-17 22:51:20,942 INFO L280 TraceCheckUtils]: 10: Hoare triple {1958#true} assume ~scheme~0 >= 0; {1958#true} is VALID [2020-07-17 22:51:20,943 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-17 22:51:20,943 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-17 22:51:20,943 INFO L280 TraceCheckUtils]: 13: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,943 INFO L280 TraceCheckUtils]: 14: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,944 INFO L280 TraceCheckUtils]: 15: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,944 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1958#true} {1958#true} #144#return; {1958#true} is VALID [2020-07-17 22:51:20,944 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-17 22:51:20,945 INFO L280 TraceCheckUtils]: 18: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,945 INFO L280 TraceCheckUtils]: 19: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,945 INFO L280 TraceCheckUtils]: 20: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,946 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1958#true} {1958#true} #146#return; {1958#true} is VALID [2020-07-17 22:51:20,946 INFO L280 TraceCheckUtils]: 22: Hoare triple {1958#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1958#true} is VALID [2020-07-17 22:51:20,946 INFO L280 TraceCheckUtils]: 23: Hoare triple {1958#true} assume 0 != #t~nondet3;havoc #t~nondet3; {1958#true} is VALID [2020-07-17 22:51:20,947 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-17 22:51:20,947 INFO L280 TraceCheckUtils]: 25: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,947 INFO L280 TraceCheckUtils]: 26: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,947 INFO L280 TraceCheckUtils]: 27: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,948 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1958#true} {1958#true} #148#return; {1958#true} is VALID [2020-07-17 22:51:20,948 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-17 22:51:20,948 INFO L280 TraceCheckUtils]: 30: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,948 INFO L280 TraceCheckUtils]: 31: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,948 INFO L280 TraceCheckUtils]: 32: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,949 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1958#true} {1958#true} #150#return; {1958#true} is VALID [2020-07-17 22:51:20,949 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-17 22:51:20,949 INFO L280 TraceCheckUtils]: 35: Hoare triple {1958#true} assume 0 != #t~nondet4;havoc #t~nondet4; {1958#true} is VALID [2020-07-17 22:51:20,949 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-17 22:51:20,950 INFO L280 TraceCheckUtils]: 37: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,950 INFO L280 TraceCheckUtils]: 38: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,950 INFO L280 TraceCheckUtils]: 39: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,950 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1958#true} {1958#true} #156#return; {1958#true} is VALID [2020-07-17 22:51:20,950 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-17 22:51:20,951 INFO L280 TraceCheckUtils]: 42: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,951 INFO L280 TraceCheckUtils]: 43: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,951 INFO L280 TraceCheckUtils]: 44: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,951 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1958#true} {1958#true} #158#return; {1958#true} is VALID [2020-07-17 22:51:20,952 INFO L280 TraceCheckUtils]: 46: Hoare triple {1958#true} assume !(~cp~0 == ~urilen~0 - 1); {1958#true} is VALID [2020-07-17 22:51:20,952 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-17 22:51:20,952 INFO L280 TraceCheckUtils]: 48: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,952 INFO L280 TraceCheckUtils]: 49: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,952 INFO L280 TraceCheckUtils]: 50: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,953 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {1958#true} {1958#true} #160#return; {1958#true} is VALID [2020-07-17 22:51:20,953 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-17 22:51:20,953 INFO L280 TraceCheckUtils]: 53: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,953 INFO L280 TraceCheckUtils]: 54: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,954 INFO L280 TraceCheckUtils]: 55: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,954 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {1958#true} {1958#true} #162#return; {1958#true} is VALID [2020-07-17 22:51:20,954 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-17 22:51:20,955 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-17 22:51:20,955 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-17 22:51:20,955 INFO L280 TraceCheckUtils]: 60: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,956 INFO L280 TraceCheckUtils]: 61: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,956 INFO L280 TraceCheckUtils]: 62: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,957 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #164#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-17 22:51:20,957 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-17 22:51:20,957 INFO L280 TraceCheckUtils]: 65: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,957 INFO L280 TraceCheckUtils]: 66: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,957 INFO L280 TraceCheckUtils]: 67: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,958 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #166#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-17 22:51:20,959 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-17 22:51:20,959 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-17 22:51:20,959 INFO L280 TraceCheckUtils]: 71: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,959 INFO L280 TraceCheckUtils]: 72: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,960 INFO L280 TraceCheckUtils]: 73: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,960 INFO L275 TraceCheckUtils]: 74: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #168#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-17 22:51:20,961 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-17 22:51:20,961 INFO L280 TraceCheckUtils]: 76: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,961 INFO L280 TraceCheckUtils]: 77: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,961 INFO L280 TraceCheckUtils]: 78: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,962 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #170#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-17 22:51:20,963 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-17 22:51:20,963 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-17 22:51:20,963 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-17 22:51:20,964 INFO L280 TraceCheckUtils]: 83: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-17 22:51:20,964 INFO L280 TraceCheckUtils]: 84: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-17 22:51:20,964 INFO L280 TraceCheckUtils]: 85: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-17 22:51:20,965 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {1958#true} {2011#(<= 1 main_~c~0)} #172#return; {2011#(<= 1 main_~c~0)} is VALID [2020-07-17 22:51:20,966 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-17 22:51:20,967 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-17 22:51:20,968 INFO L280 TraceCheckUtils]: 89: Hoare triple {2017#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1959#false} is VALID [2020-07-17 22:51:20,968 INFO L280 TraceCheckUtils]: 90: Hoare triple {1959#false} assume !false; {1959#false} is VALID [2020-07-17 22:51:20,975 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-17 22:51:20,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375228379] [2020-07-17 22:51:20,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:20,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:51:20,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625022630] [2020-07-17 22:51:20,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2020-07-17 22:51:20,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:20,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:21,039 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-17 22:51:21,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:21,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:21,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:21,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:21,040 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand 6 states. [2020-07-17 22:51:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:21,471 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2020-07-17 22:51:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:51:21,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2020-07-17 22:51:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2020-07-17 22:51:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2020-07-17 22:51:21,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 81 transitions. [2020-07-17 22:51:21,567 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-17 22:51:21,570 INFO L225 Difference]: With dead ends: 81 [2020-07-17 22:51:21,570 INFO L226 Difference]: Without dead ends: 79 [2020-07-17 22:51:21,571 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-17 22:51:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-17 22:51:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-07-17 22:51:21,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:21,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2020-07-17 22:51:21,669 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-17 22:51:21,669 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-17 22:51:21,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:21,673 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2020-07-17 22:51:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2020-07-17 22:51:21,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:21,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:21,674 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-17 22:51:21,674 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-17 22:51:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:21,678 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2020-07-17 22:51:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2020-07-17 22:51:21,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:21,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:21,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:21,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-17 22:51:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2020-07-17 22:51:21,683 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 91 [2020-07-17 22:51:21,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:21,684 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2020-07-17 22:51:21,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2020-07-17 22:51:21,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-07-17 22:51:21,685 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:21,686 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-17 22:51:21,686 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:51:21,686 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:21,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:21,687 INFO L82 PathProgramCache]: Analyzing trace with hash 299780712, now seen corresponding path program 1 times [2020-07-17 22:51:21,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:21,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770970499] [2020-07-17 22:51:21,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,874 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,875 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2414#true} {2414#true} #140#return; {2414#true} is VALID [2020-07-17 22:51:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,880 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #144#return; {2414#true} is VALID [2020-07-17 22:51:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,884 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,885 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,885 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #146#return; {2414#true} is VALID [2020-07-17 22:51:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,891 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,891 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,892 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #148#return; {2414#true} is VALID [2020-07-17 22:51:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,897 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,898 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,898 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,898 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #150#return; {2414#true} is VALID [2020-07-17 22:51:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,902 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,902 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,902 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #156#return; {2414#true} is VALID [2020-07-17 22:51:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,906 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,907 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,907 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #158#return; {2414#true} is VALID [2020-07-17 22:51:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,921 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,922 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #160#return; {2414#true} is VALID [2020-07-17 22:51:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,926 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,926 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #162#return; {2414#true} is VALID [2020-07-17 22:51:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,934 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,934 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,934 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,934 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #164#return; {2414#true} is VALID [2020-07-17 22:51:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,943 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,944 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,944 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,944 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #166#return; {2414#true} is VALID [2020-07-17 22:51:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,948 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,948 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,948 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #168#return; {2414#true} is VALID [2020-07-17 22:51:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,952 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,952 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,953 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,953 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #170#return; {2414#true} is VALID [2020-07-17 22:51:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,957 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,957 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,958 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,958 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #172#return; {2414#true} is VALID [2020-07-17 22:51:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,961 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,961 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,962 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,962 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #174#return; {2414#true} is VALID [2020-07-17 22:51:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,966 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,966 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,966 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,967 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #176#return; {2414#true} is VALID [2020-07-17 22:51:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,970 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,970 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,971 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #178#return; {2414#true} is VALID [2020-07-17 22:51:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,980 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,981 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,981 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,982 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-17 22:51:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,986 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,987 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,987 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-17 22:51:21,988 INFO L263 TraceCheckUtils]: 0: Hoare triple {2414#true} call ULTIMATE.init(); {2414#true} is VALID [2020-07-17 22:51:21,988 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,988 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2414#true} {2414#true} #140#return; {2414#true} is VALID [2020-07-17 22:51:21,988 INFO L263 TraceCheckUtils]: 3: Hoare triple {2414#true} call #t~ret11 := main(); {2414#true} is VALID [2020-07-17 22:51:21,989 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-17 22:51:21,989 INFO L280 TraceCheckUtils]: 5: Hoare triple {2414#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {2414#true} is VALID [2020-07-17 22:51:21,989 INFO L280 TraceCheckUtils]: 6: Hoare triple {2414#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {2414#true} is VALID [2020-07-17 22:51:21,989 INFO L280 TraceCheckUtils]: 7: Hoare triple {2414#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {2414#true} is VALID [2020-07-17 22:51:21,990 INFO L280 TraceCheckUtils]: 8: Hoare triple {2414#true} assume ~urilen~0 > 0; {2414#true} is VALID [2020-07-17 22:51:21,990 INFO L280 TraceCheckUtils]: 9: Hoare triple {2414#true} assume ~tokenlen~0 > 0; {2414#true} is VALID [2020-07-17 22:51:21,990 INFO L280 TraceCheckUtils]: 10: Hoare triple {2414#true} assume ~scheme~0 >= 0; {2414#true} is VALID [2020-07-17 22:51:21,990 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-17 22:51:21,990 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-17 22:51:21,991 INFO L280 TraceCheckUtils]: 13: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,991 INFO L280 TraceCheckUtils]: 14: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,991 INFO L280 TraceCheckUtils]: 15: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,991 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2414#true} {2414#true} #144#return; {2414#true} is VALID [2020-07-17 22:51:21,992 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-17 22:51:21,992 INFO L280 TraceCheckUtils]: 18: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,992 INFO L280 TraceCheckUtils]: 19: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,992 INFO L280 TraceCheckUtils]: 20: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,993 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2414#true} {2414#true} #146#return; {2414#true} is VALID [2020-07-17 22:51:21,993 INFO L280 TraceCheckUtils]: 22: Hoare triple {2414#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2414#true} is VALID [2020-07-17 22:51:21,993 INFO L280 TraceCheckUtils]: 23: Hoare triple {2414#true} assume 0 != #t~nondet3;havoc #t~nondet3; {2414#true} is VALID [2020-07-17 22:51:21,993 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-17 22:51:21,993 INFO L280 TraceCheckUtils]: 25: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,994 INFO L280 TraceCheckUtils]: 26: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,994 INFO L280 TraceCheckUtils]: 27: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,994 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2414#true} {2414#true} #148#return; {2414#true} is VALID [2020-07-17 22:51:21,994 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-17 22:51:21,995 INFO L280 TraceCheckUtils]: 30: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,995 INFO L280 TraceCheckUtils]: 31: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,995 INFO L280 TraceCheckUtils]: 32: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,995 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2414#true} {2414#true} #150#return; {2414#true} is VALID [2020-07-17 22:51:21,996 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-17 22:51:21,996 INFO L280 TraceCheckUtils]: 35: Hoare triple {2414#true} assume 0 != #t~nondet4;havoc #t~nondet4; {2414#true} is VALID [2020-07-17 22:51:21,996 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-17 22:51:21,996 INFO L280 TraceCheckUtils]: 37: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,996 INFO L280 TraceCheckUtils]: 38: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,997 INFO L280 TraceCheckUtils]: 39: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,997 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2414#true} {2414#true} #156#return; {2414#true} is VALID [2020-07-17 22:51:21,997 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-17 22:51:21,997 INFO L280 TraceCheckUtils]: 42: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,998 INFO L280 TraceCheckUtils]: 43: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,998 INFO L280 TraceCheckUtils]: 44: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,998 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2414#true} {2414#true} #158#return; {2414#true} is VALID [2020-07-17 22:51:21,998 INFO L280 TraceCheckUtils]: 46: Hoare triple {2414#true} assume !(~cp~0 == ~urilen~0 - 1); {2414#true} is VALID [2020-07-17 22:51:21,998 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-17 22:51:21,999 INFO L280 TraceCheckUtils]: 48: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:21,999 INFO L280 TraceCheckUtils]: 49: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:21,999 INFO L280 TraceCheckUtils]: 50: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:21,999 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2414#true} {2414#true} #160#return; {2414#true} is VALID [2020-07-17 22:51:22,000 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-17 22:51:22,000 INFO L280 TraceCheckUtils]: 53: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:22,000 INFO L280 TraceCheckUtils]: 54: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:22,000 INFO L280 TraceCheckUtils]: 55: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:22,001 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2414#true} {2414#true} #162#return; {2414#true} is VALID [2020-07-17 22:51:22,001 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-17 22:51:22,001 INFO L280 TraceCheckUtils]: 58: Hoare triple {2414#true} assume 0 != #t~nondet7;havoc #t~nondet7;~c~0 := 0; {2414#true} is VALID [2020-07-17 22:51:22,001 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-17 22:51:22,002 INFO L280 TraceCheckUtils]: 60: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:22,002 INFO L280 TraceCheckUtils]: 61: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:22,002 INFO L280 TraceCheckUtils]: 62: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:22,002 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {2414#true} {2414#true} #164#return; {2414#true} is VALID [2020-07-17 22:51:22,002 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-17 22:51:22,003 INFO L280 TraceCheckUtils]: 65: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:22,003 INFO L280 TraceCheckUtils]: 66: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:22,003 INFO L280 TraceCheckUtils]: 67: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:22,003 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {2414#true} {2414#true} #166#return; {2414#true} is VALID [2020-07-17 22:51:22,004 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-17 22:51:22,004 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-17 22:51:22,004 INFO L280 TraceCheckUtils]: 71: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:22,004 INFO L280 TraceCheckUtils]: 72: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:22,004 INFO L280 TraceCheckUtils]: 73: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:22,005 INFO L275 TraceCheckUtils]: 74: Hoare quadruple {2414#true} {2414#true} #168#return; {2414#true} is VALID [2020-07-17 22:51:22,005 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-17 22:51:22,005 INFO L280 TraceCheckUtils]: 76: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:22,005 INFO L280 TraceCheckUtils]: 77: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:22,006 INFO L280 TraceCheckUtils]: 78: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:22,006 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {2414#true} {2414#true} #170#return; {2414#true} is VALID [2020-07-17 22:51:22,006 INFO L280 TraceCheckUtils]: 80: Hoare triple {2414#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2414#true} is VALID [2020-07-17 22:51:22,006 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-17 22:51:22,007 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-17 22:51:22,007 INFO L280 TraceCheckUtils]: 83: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:22,007 INFO L280 TraceCheckUtils]: 84: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:22,007 INFO L280 TraceCheckUtils]: 85: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:22,009 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {2414#true} {2414#true} #172#return; {2414#true} is VALID [2020-07-17 22:51:22,022 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-17 22:51:22,023 INFO L280 TraceCheckUtils]: 88: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:22,023 INFO L280 TraceCheckUtils]: 89: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:22,023 INFO L280 TraceCheckUtils]: 90: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:22,023 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {2414#true} {2414#true} #174#return; {2414#true} is VALID [2020-07-17 22:51:22,024 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-17 22:51:22,024 INFO L280 TraceCheckUtils]: 93: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:22,024 INFO L280 TraceCheckUtils]: 94: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:22,025 INFO L280 TraceCheckUtils]: 95: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:22,025 INFO L275 TraceCheckUtils]: 96: Hoare quadruple {2414#true} {2414#true} #176#return; {2414#true} is VALID [2020-07-17 22:51:22,025 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-17 22:51:22,025 INFO L280 TraceCheckUtils]: 98: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:22,025 INFO L280 TraceCheckUtils]: 99: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:22,026 INFO L280 TraceCheckUtils]: 100: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:22,026 INFO L275 TraceCheckUtils]: 101: Hoare quadruple {2414#true} {2414#true} #178#return; {2414#true} is VALID [2020-07-17 22:51:22,026 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-17 22:51:22,030 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-17 22:51:22,030 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-17 22:51:22,030 INFO L280 TraceCheckUtils]: 105: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:22,031 INFO L280 TraceCheckUtils]: 106: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:22,031 INFO L280 TraceCheckUtils]: 107: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:22,032 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-17 22:51:22,032 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-17 22:51:22,032 INFO L280 TraceCheckUtils]: 110: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-17 22:51:22,032 INFO L280 TraceCheckUtils]: 111: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-17 22:51:22,032 INFO L280 TraceCheckUtils]: 112: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:51:22,033 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-17 22:51:22,034 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-17 22:51:22,035 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-17 22:51:22,036 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-17 22:51:22,036 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-17 22:51:22,037 INFO L280 TraceCheckUtils]: 118: Hoare triple {2493#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2415#false} is VALID [2020-07-17 22:51:22,037 INFO L280 TraceCheckUtils]: 119: Hoare triple {2415#false} assume !false; {2415#false} is VALID [2020-07-17 22:51:22,045 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-17 22:51:22,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770970499] [2020-07-17 22:51:22,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:22,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:51:22,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987954732] [2020-07-17 22:51:22,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2020-07-17 22:51:22,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:22,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:22,140 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-17 22:51:22,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:22,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:22,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:22,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:22,141 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 6 states. [2020-07-17 22:51:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:22,628 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2020-07-17 22:51:22,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:51:22,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2020-07-17 22:51:22,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-17 22:51:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-17 22:51:22,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2020-07-17 22:51:22,725 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-17 22:51:22,725 INFO L225 Difference]: With dead ends: 82 [2020-07-17 22:51:22,725 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:51:22,726 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-17 22:51:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:51:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:51:22,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:22,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:22,727 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:22,728 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:22,728 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:22,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:22,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:22,733 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:22,733 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:22,733 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:22,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:22,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:22,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:22,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:51:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:51:22,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2020-07-17 22:51:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:22,744 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:51:22,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:22,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:22,744 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:51:22,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:51:23,288 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:51:23,288 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:23,289 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:23,289 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:51:23,289 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:51:23,289 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:51:23,289 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:23,289 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-17 22:51:23,289 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:23,289 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:23,290 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-17 22:51:23,290 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-17 22:51:23,290 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 72) no Hoare annotation was computed. [2020-07-17 22:51:23,294 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-17 22:51:23,295 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-17 22:51:23,295 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-17 22:51:23,295 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-17 22:51:23,295 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-17 22:51:23,295 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-17 22:51:23,296 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-17 22:51:23,296 INFO L271 CegarLoopResult]: At program point L70(lines 14 72) the Hoare annotation is: true [2020-07-17 22:51:23,296 INFO L268 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2020-07-17 22:51:23,296 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-17 22:51:23,299 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-17 22:51:23,299 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-17 22:51:23,300 INFO L268 CegarLoopResult]: For program point L46(lines 33 69) no Hoare annotation was computed. [2020-07-17 22:51:23,300 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 72) no Hoare annotation was computed. [2020-07-17 22:51:23,300 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-17 22:51:23,300 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-17 22:51:23,300 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 72) the Hoare annotation is: true [2020-07-17 22:51:23,300 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-17 22:51:23,300 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-07-17 22:51:23,301 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-17 22:51:23,301 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-17 22:51:23,301 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-17 22:51:23,301 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-17 22:51:23,301 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-17 22:51:23,301 INFO L268 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-07-17 22:51:23,301 INFO L268 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2020-07-17 22:51:23,302 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-17 22:51:23,302 INFO L268 CegarLoopResult]: For program point L24-1(lines 14 72) no Hoare annotation was computed. [2020-07-17 22:51:23,302 INFO L268 CegarLoopResult]: For program point L33(lines 33 69) no Hoare annotation was computed. [2020-07-17 22:51:23,302 INFO L268 CegarLoopResult]: For program point L58(lines 58 64) no Hoare annotation was computed. [2020-07-17 22:51:23,302 INFO L268 CegarLoopResult]: For program point L25(lines 14 72) no Hoare annotation was computed. [2020-07-17 22:51:23,302 INFO L268 CegarLoopResult]: For program point L58-1(lines 58 64) no Hoare annotation was computed. [2020-07-17 22:51:23,302 INFO L268 CegarLoopResult]: For program point L50(lines 50 68) no Hoare annotation was computed. [2020-07-17 22:51:23,302 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-17 22:51:23,303 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-17 22:51:23,303 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-17 22:51:23,303 INFO L268 CegarLoopResult]: For program point L26(lines 14 72) no Hoare annotation was computed. [2020-07-17 22:51:23,303 INFO L268 CegarLoopResult]: For program point L43(lines 33 69) no Hoare annotation was computed. [2020-07-17 22:51:23,303 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-17 22:51:23,303 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:23,303 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-17 22:51:23,303 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-17 22:51:23,303 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:23,304 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-17 22:51:23,309 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:23,309 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:51:23,309 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-17 22:51:23,310 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:23,310 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:23,310 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:23,310 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:23,310 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:23,310 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-17 22:51:23,310 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-17 22:51:23,311 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:23,311 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:23,311 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:23,311 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:51:23,311 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:23,311 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:51:23,311 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:51:23,312 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:23,312 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:23,312 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-17 22:51:23,312 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:51:23,312 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:51:23,312 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:51:23,312 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,313 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,313 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,313 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,313 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,313 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,313 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,313 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,313 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,313 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,314 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,315 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,315 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,315 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,315 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,315 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,315 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,316 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:23,316 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:51:23,316 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:51:23,316 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-17 22:51:23,316 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-17 22:51:23,318 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:51:23,318 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-17 22:51:23,318 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-17 22:51:23,318 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-17 22:51:23,318 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-17 22:51:23,319 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-17 22:51:23,319 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-17 22:51:23,319 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-17 22:51:23,319 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-17 22:51:23,320 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-17 22:51:23,320 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-17 22:51:23,321 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-17 22:51:23,321 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-17 22:51:23,321 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-17 22:51:23,321 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-17 22:51:23,321 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:23,321 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:51:23,321 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:51:23,322 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:51:23,322 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:51:23,322 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:51:23,322 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:51:23,322 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-17 22:51:23,322 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-17 22:51:23,322 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-17 22:51:23,322 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-17 22:51:23,323 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:51:23,323 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:51:23,323 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-17 22:51:23,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:51:23 BoogieIcfgContainer [2020-07-17 22:51:23,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:51:23,358 INFO L168 Benchmark]: Toolchain (without parser) took 8892.59 ms. Allocated memory was 145.8 MB in the beginning and 321.4 MB in the end (delta: 175.6 MB). Free memory was 103.7 MB in the beginning and 193.0 MB in the end (delta: -89.4 MB). Peak memory consumption was 86.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:23,359 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-17 22:51:23,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.40 ms. Allocated memory is still 145.8 MB. Free memory was 103.3 MB in the beginning and 92.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:23,361 INFO L168 Benchmark]: Boogie Preprocessor took 135.77 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 92.3 MB in the beginning and 181.5 MB in the end (delta: -89.2 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:23,362 INFO L168 Benchmark]: RCFGBuilder took 620.80 ms. Allocated memory is still 202.9 MB. Free memory was 181.5 MB in the beginning and 144.8 MB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:23,363 INFO L168 Benchmark]: TraceAbstraction took 7870.45 ms. Allocated memory was 202.9 MB in the beginning and 321.4 MB in the end (delta: 118.5 MB). Free memory was 144.8 MB in the beginning and 193.0 MB in the end (delta: -48.2 MB). Peak memory consumption was 70.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:23,369 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 1.44 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 256.40 ms. Allocated memory is still 145.8 MB. Free memory was 103.3 MB in the beginning and 92.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.77 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 92.3 MB in the beginning and 181.5 MB in the end (delta: -89.2 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 620.80 ms. Allocated memory is still 202.9 MB. Free memory was 181.5 MB in the beginning and 144.8 MB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7870.45 ms. Allocated memory was 202.9 MB in the beginning and 321.4 MB in the end (delta: 118.5 MB). Free memory was 144.8 MB in the beginning and 193.0 MB in the end (delta: -48.2 MB). Peak memory consumption was 70.3 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.2s, OverallIterations: 7, TraceHistogramMax: 19, AutomataDifference: 4.4s, 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.3s 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...