java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:09:43,125 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:09:43,127 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:09:43,138 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:09:43,139 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:09:43,140 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:09:43,141 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:09:43,143 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:09:43,145 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:09:43,146 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:09:43,147 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:09:43,147 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:09:43,148 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:09:43,149 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:09:43,150 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:09:43,151 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:09:43,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:09:43,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:09:43,157 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:09:43,158 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:09:43,160 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:09:43,161 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:09:43,164 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:09:43,164 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:09:43,165 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:09:43,166 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:09:43,167 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:09:43,168 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:09:43,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:09:43,170 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:09:43,170 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:09:43,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:09:43,171 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:09:43,171 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:09:43,172 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:09:43,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:09:43,174 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:09:43,189 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:09:43,190 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:09:43,190 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:09:43,191 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:09:43,191 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:09:43,192 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:09:43,192 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:09:43,192 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:09:43,193 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:09:43,193 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:09:43,193 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:09:43,193 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:09:43,194 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:09:43,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:09:43,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:09:43,195 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:09:43,195 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:09:43,195 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:09:43,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:09:43,196 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:09:43,196 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:09:43,196 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:09:43,196 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:09:43,199 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:09:43,199 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:09:43,199 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:09:43,200 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:09:43,200 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:09:43,200 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:09:43,200 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:09:43,203 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:09:43,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:09:43,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:09:43,288 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:09:43,289 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:09:43,290 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:09:43,290 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i [2018-11-23 13:09:43,353 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/147dcabfb/e21fac40eccb40148516c4c70d47f4cf/FLAG56f24a5ba [2018-11-23 13:09:43,790 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:09:43,791 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i [2018-11-23 13:09:43,798 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/147dcabfb/e21fac40eccb40148516c4c70d47f4cf/FLAG56f24a5ba [2018-11-23 13:09:44,177 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/147dcabfb/e21fac40eccb40148516c4c70d47f4cf [2018-11-23 13:09:44,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:09:44,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:09:44,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:09:44,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:09:44,192 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:09:44,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:44" (1/1) ... [2018-11-23 13:09:44,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d9d738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:44, skipping insertion in model container [2018-11-23 13:09:44,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:44" (1/1) ... [2018-11-23 13:09:44,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:09:44,241 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:09:44,493 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:09:44,498 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:09:44,535 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:09:44,550 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:09:44,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:44 WrapperNode [2018-11-23 13:09:44,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:09:44,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:09:44,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:09:44,552 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:09:44,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:44" (1/1) ... [2018-11-23 13:09:44,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:44" (1/1) ... [2018-11-23 13:09:44,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:09:44,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:09:44,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:09:44,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:09:44,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:44" (1/1) ... [2018-11-23 13:09:44,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:44" (1/1) ... [2018-11-23 13:09:44,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:44" (1/1) ... [2018-11-23 13:09:44,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:44" (1/1) ... [2018-11-23 13:09:44,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:44" (1/1) ... [2018-11-23 13:09:44,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:44" (1/1) ... [2018-11-23 13:09:44,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:44" (1/1) ... [2018-11-23 13:09:44,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:09:44,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:09:44,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:09:44,609 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:09:44,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:44" (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 [2018-11-23 13:09:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:09:44,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:09:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:09:44,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:09:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:09:44,732 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:09:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:09:44,732 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:09:45,743 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:09:45,744 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:09:45,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:45 BoogieIcfgContainer [2018-11-23 13:09:45,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:09:45,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:09:45,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:09:45,749 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:09:45,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:09:44" (1/3) ... [2018-11-23 13:09:45,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5686f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:09:45, skipping insertion in model container [2018-11-23 13:09:45,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:44" (2/3) ... [2018-11-23 13:09:45,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5686f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:09:45, skipping insertion in model container [2018-11-23 13:09:45,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:45" (3/3) ... [2018-11-23 13:09:45,752 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call_true-termination.i [2018-11-23 13:09:45,761 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:09:45,767 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:09:45,783 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:09:45,815 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:09:45,816 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:09:45,816 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:09:45,817 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:09:45,817 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:09:45,817 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:09:45,817 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:09:45,818 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:09:45,818 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:09:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-23 13:09:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:09:45,845 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:45,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:45,848 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:45,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:45,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1277279000, now seen corresponding path program 1 times [2018-11-23 13:09:45,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:45,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:45,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:45,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:45,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:46,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {56#true} call ULTIMATE.init(); {56#true} is VALID [2018-11-23 13:09:46,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#true} assume true; {56#true} is VALID [2018-11-23 13:09:46,113 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {56#true} {56#true} #132#return; {56#true} is VALID [2018-11-23 13:09:46,113 INFO L256 TraceCheckUtils]: 3: Hoare triple {56#true} call #t~ret12 := main(); {56#true} is VALID [2018-11-23 13:09:46,114 INFO L273 TraceCheckUtils]: 4: Hoare triple {56#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {56#true} is VALID [2018-11-23 13:09:46,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {56#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {56#true} is VALID [2018-11-23 13:09:46,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {56#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {56#true} is VALID [2018-11-23 13:09:46,115 INFO L273 TraceCheckUtils]: 7: Hoare triple {56#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {56#true} is VALID [2018-11-23 13:09:46,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {56#true} assume ~urilen~0 > 0; {56#true} is VALID [2018-11-23 13:09:46,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {56#true} assume ~tokenlen~0 > 0; {56#true} is VALID [2018-11-23 13:09:46,116 INFO L273 TraceCheckUtils]: 10: Hoare triple {56#true} assume ~scheme~0 >= 0; {56#true} is VALID [2018-11-23 13:09:46,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {56#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {58#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2018-11-23 13:09:46,118 INFO L256 TraceCheckUtils]: 12: Hoare triple {58#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {59#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:46,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {59#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {60#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:09:46,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {60#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {57#false} is VALID [2018-11-23 13:09:46,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {57#false} assume !false; {57#false} is VALID [2018-11-23 13:09:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:46,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:09:46,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:09:46,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 13:09:46,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:46,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:09:46,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:46,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:09:46,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:09:46,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:09:46,278 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 5 states. [2018-11-23 13:09:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:47,909 INFO L93 Difference]: Finished difference Result 111 states and 206 transitions. [2018-11-23 13:09:47,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:09:47,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 13:09:47,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:09:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2018-11-23 13:09:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:09:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2018-11-23 13:09:47,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 206 transitions. [2018-11-23 13:09:48,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:48,411 INFO L225 Difference]: With dead ends: 111 [2018-11-23 13:09:48,411 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 13:09:48,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:09:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 13:09:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-11-23 13:09:48,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:48,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 56 states. [2018-11-23 13:09:48,495 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 56 states. [2018-11-23 13:09:48,495 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 56 states. [2018-11-23 13:09:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:48,505 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2018-11-23 13:09:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-11-23 13:09:48,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:48,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:48,509 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 63 states. [2018-11-23 13:09:48,509 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 63 states. [2018-11-23 13:09:48,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:48,516 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2018-11-23 13:09:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-11-23 13:09:48,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:48,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:48,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:48,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 13:09:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2018-11-23 13:09:48,532 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 16 [2018-11-23 13:09:48,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:48,532 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2018-11-23 13:09:48,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:09:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2018-11-23 13:09:48,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:09:48,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:48,535 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:48,535 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:48,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:48,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1256946511, now seen corresponding path program 1 times [2018-11-23 13:09:48,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:48,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:48,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:48,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:48,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:48,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {443#true} call ULTIMATE.init(); {443#true} is VALID [2018-11-23 13:09:48,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {443#true} assume true; {443#true} is VALID [2018-11-23 13:09:48,704 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {443#true} {443#true} #132#return; {443#true} is VALID [2018-11-23 13:09:48,705 INFO L256 TraceCheckUtils]: 3: Hoare triple {443#true} call #t~ret12 := main(); {443#true} is VALID [2018-11-23 13:09:48,705 INFO L273 TraceCheckUtils]: 4: Hoare triple {443#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {443#true} is VALID [2018-11-23 13:09:48,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {443#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {443#true} is VALID [2018-11-23 13:09:48,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {443#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {443#true} is VALID [2018-11-23 13:09:48,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {443#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {443#true} is VALID [2018-11-23 13:09:48,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {443#true} assume ~urilen~0 > 0; {443#true} is VALID [2018-11-23 13:09:48,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {443#true} assume ~tokenlen~0 > 0; {443#true} is VALID [2018-11-23 13:09:48,708 INFO L273 TraceCheckUtils]: 10: Hoare triple {443#true} assume ~scheme~0 >= 0; {445#(<= 0 main_~scheme~0)} is VALID [2018-11-23 13:09:48,711 INFO L273 TraceCheckUtils]: 11: Hoare triple {445#(<= 0 main_~scheme~0)} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {446#(<= 1 main_~cp~0)} is VALID [2018-11-23 13:09:48,711 INFO L256 TraceCheckUtils]: 12: Hoare triple {446#(<= 1 main_~cp~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {443#true} is VALID [2018-11-23 13:09:48,713 INFO L273 TraceCheckUtils]: 13: Hoare triple {443#true} ~cond := #in~cond; {447#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:48,715 INFO L273 TraceCheckUtils]: 14: Hoare triple {447#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:48,722 INFO L273 TraceCheckUtils]: 15: Hoare triple {448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:48,724 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {448#(not (= |__VERIFIER_assert_#in~cond| 0))} {446#(<= 1 main_~cp~0)} #136#return; {446#(<= 1 main_~cp~0)} is VALID [2018-11-23 13:09:48,724 INFO L256 TraceCheckUtils]: 17: Hoare triple {446#(<= 1 main_~cp~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:48,726 INFO L273 TraceCheckUtils]: 18: Hoare triple {448#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {449#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:09:48,726 INFO L273 TraceCheckUtils]: 19: Hoare triple {449#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {444#false} is VALID [2018-11-23 13:09:48,726 INFO L273 TraceCheckUtils]: 20: Hoare triple {444#false} assume !false; {444#false} is VALID [2018-11-23 13:09:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:48,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:48,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:48,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:48,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:48,998 INFO L256 TraceCheckUtils]: 0: Hoare triple {443#true} call ULTIMATE.init(); {443#true} is VALID [2018-11-23 13:09:48,998 INFO L273 TraceCheckUtils]: 1: Hoare triple {443#true} assume true; {443#true} is VALID [2018-11-23 13:09:48,999 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {443#true} {443#true} #132#return; {443#true} is VALID [2018-11-23 13:09:48,999 INFO L256 TraceCheckUtils]: 3: Hoare triple {443#true} call #t~ret12 := main(); {443#true} is VALID [2018-11-23 13:09:48,999 INFO L273 TraceCheckUtils]: 4: Hoare triple {443#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {443#true} is VALID [2018-11-23 13:09:49,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {443#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {443#true} is VALID [2018-11-23 13:09:49,001 INFO L273 TraceCheckUtils]: 6: Hoare triple {443#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {443#true} is VALID [2018-11-23 13:09:49,001 INFO L273 TraceCheckUtils]: 7: Hoare triple {443#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {443#true} is VALID [2018-11-23 13:09:49,001 INFO L273 TraceCheckUtils]: 8: Hoare triple {443#true} assume ~urilen~0 > 0; {443#true} is VALID [2018-11-23 13:09:49,001 INFO L273 TraceCheckUtils]: 9: Hoare triple {443#true} assume ~tokenlen~0 > 0; {443#true} is VALID [2018-11-23 13:09:49,002 INFO L273 TraceCheckUtils]: 10: Hoare triple {443#true} assume ~scheme~0 >= 0; {445#(<= 0 main_~scheme~0)} is VALID [2018-11-23 13:09:49,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {445#(<= 0 main_~scheme~0)} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {446#(<= 1 main_~cp~0)} is VALID [2018-11-23 13:09:49,003 INFO L256 TraceCheckUtils]: 12: Hoare triple {446#(<= 1 main_~cp~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {443#true} is VALID [2018-11-23 13:09:49,003 INFO L273 TraceCheckUtils]: 13: Hoare triple {443#true} ~cond := #in~cond; {443#true} is VALID [2018-11-23 13:09:49,003 INFO L273 TraceCheckUtils]: 14: Hoare triple {443#true} assume !(0 == ~cond); {443#true} is VALID [2018-11-23 13:09:49,004 INFO L273 TraceCheckUtils]: 15: Hoare triple {443#true} assume true; {443#true} is VALID [2018-11-23 13:09:49,007 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {443#true} {446#(<= 1 main_~cp~0)} #136#return; {446#(<= 1 main_~cp~0)} is VALID [2018-11-23 13:09:49,008 INFO L256 TraceCheckUtils]: 17: Hoare triple {446#(<= 1 main_~cp~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {504#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:49,008 INFO L273 TraceCheckUtils]: 18: Hoare triple {504#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {508#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:09:49,009 INFO L273 TraceCheckUtils]: 19: Hoare triple {508#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {444#false} is VALID [2018-11-23 13:09:49,009 INFO L273 TraceCheckUtils]: 20: Hoare triple {444#false} assume !false; {444#false} is VALID [2018-11-23 13:09:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:49,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:09:49,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-23 13:09:49,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-23 13:09:49,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:49,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:09:49,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:49,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:09:49,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:09:49,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:09:49,122 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 9 states. [2018-11-23 13:09:50,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:50,634 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2018-11-23 13:09:50,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:09:50,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-23 13:09:50,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:09:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2018-11-23 13:09:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:09:50,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2018-11-23 13:09:50,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 73 transitions. [2018-11-23 13:09:50,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:50,788 INFO L225 Difference]: With dead ends: 62 [2018-11-23 13:09:50,788 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 13:09:50,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:09:50,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 13:09:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 13:09:50,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:50,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-23 13:09:50,883 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 13:09:50,884 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 13:09:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:50,890 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2018-11-23 13:09:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2018-11-23 13:09:50,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:50,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:50,892 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 13:09:50,892 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 13:09:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:50,897 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2018-11-23 13:09:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2018-11-23 13:09:50,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:50,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:50,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:50,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:09:50,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2018-11-23 13:09:50,905 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 21 [2018-11-23 13:09:50,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:50,905 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2018-11-23 13:09:50,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:09:50,905 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2018-11-23 13:09:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 13:09:50,907 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:50,907 INFO L402 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] [2018-11-23 13:09:50,908 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:50,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:50,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2038837229, now seen corresponding path program 1 times [2018-11-23 13:09:50,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:50,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:50,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:50,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:50,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:50,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2018-11-23 13:09:50,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2018-11-23 13:09:50,984 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #132#return; {822#true} is VALID [2018-11-23 13:09:50,984 INFO L256 TraceCheckUtils]: 3: Hoare triple {822#true} call #t~ret12 := main(); {822#true} is VALID [2018-11-23 13:09:50,985 INFO L273 TraceCheckUtils]: 4: Hoare triple {822#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {822#true} is VALID [2018-11-23 13:09:50,985 INFO L273 TraceCheckUtils]: 5: Hoare triple {822#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {822#true} is VALID [2018-11-23 13:09:50,985 INFO L273 TraceCheckUtils]: 6: Hoare triple {822#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {822#true} is VALID [2018-11-23 13:09:50,986 INFO L273 TraceCheckUtils]: 7: Hoare triple {822#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {822#true} is VALID [2018-11-23 13:09:50,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {822#true} assume ~urilen~0 > 0; {822#true} is VALID [2018-11-23 13:09:50,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {822#true} assume ~tokenlen~0 > 0; {822#true} is VALID [2018-11-23 13:09:50,986 INFO L273 TraceCheckUtils]: 10: Hoare triple {822#true} assume ~scheme~0 >= 0; {822#true} is VALID [2018-11-23 13:09:50,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {822#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {822#true} is VALID [2018-11-23 13:09:50,987 INFO L256 TraceCheckUtils]: 12: Hoare triple {822#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {822#true} is VALID [2018-11-23 13:09:50,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2018-11-23 13:09:50,987 INFO L273 TraceCheckUtils]: 14: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2018-11-23 13:09:50,988 INFO L273 TraceCheckUtils]: 15: Hoare triple {822#true} assume true; {822#true} is VALID [2018-11-23 13:09:50,990 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {822#true} {822#true} #136#return; {822#true} is VALID [2018-11-23 13:09:50,990 INFO L256 TraceCheckUtils]: 17: Hoare triple {822#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {822#true} is VALID [2018-11-23 13:09:50,991 INFO L273 TraceCheckUtils]: 18: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2018-11-23 13:09:50,991 INFO L273 TraceCheckUtils]: 19: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2018-11-23 13:09:50,991 INFO L273 TraceCheckUtils]: 20: Hoare triple {822#true} assume true; {822#true} is VALID [2018-11-23 13:09:50,992 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {822#true} {822#true} #138#return; {822#true} is VALID [2018-11-23 13:09:50,992 INFO L273 TraceCheckUtils]: 22: Hoare triple {822#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {822#true} is VALID [2018-11-23 13:09:50,992 INFO L273 TraceCheckUtils]: 23: Hoare triple {822#true} assume 0 != #t~nondet4;havoc #t~nondet4; {822#true} is VALID [2018-11-23 13:09:50,993 INFO L256 TraceCheckUtils]: 24: Hoare triple {822#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {822#true} is VALID [2018-11-23 13:09:50,993 INFO L273 TraceCheckUtils]: 25: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2018-11-23 13:09:50,993 INFO L273 TraceCheckUtils]: 26: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2018-11-23 13:09:50,994 INFO L273 TraceCheckUtils]: 27: Hoare triple {822#true} assume true; {822#true} is VALID [2018-11-23 13:09:50,994 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {822#true} {822#true} #140#return; {822#true} is VALID [2018-11-23 13:09:50,994 INFO L256 TraceCheckUtils]: 29: Hoare triple {822#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {822#true} is VALID [2018-11-23 13:09:50,996 INFO L273 TraceCheckUtils]: 30: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2018-11-23 13:09:50,997 INFO L273 TraceCheckUtils]: 31: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2018-11-23 13:09:50,997 INFO L273 TraceCheckUtils]: 32: Hoare triple {822#true} assume true; {822#true} is VALID [2018-11-23 13:09:50,998 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {822#true} {822#true} #142#return; {822#true} is VALID [2018-11-23 13:09:50,998 INFO L273 TraceCheckUtils]: 34: Hoare triple {822#true} assume !(~cp~0 != ~urilen~0 - 1); {824#(= main_~urilen~0 (+ main_~cp~0 1))} is VALID [2018-11-23 13:09:50,999 INFO L256 TraceCheckUtils]: 35: Hoare triple {824#(= main_~urilen~0 (+ main_~cp~0 1))} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {822#true} is VALID [2018-11-23 13:09:50,999 INFO L273 TraceCheckUtils]: 36: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2018-11-23 13:09:50,999 INFO L273 TraceCheckUtils]: 37: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2018-11-23 13:09:50,999 INFO L273 TraceCheckUtils]: 38: Hoare triple {822#true} assume true; {822#true} is VALID [2018-11-23 13:09:51,003 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {822#true} {824#(= main_~urilen~0 (+ main_~cp~0 1))} #148#return; {824#(= main_~urilen~0 (+ main_~cp~0 1))} is VALID [2018-11-23 13:09:51,003 INFO L256 TraceCheckUtils]: 40: Hoare triple {824#(= main_~urilen~0 (+ main_~cp~0 1))} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {822#true} is VALID [2018-11-23 13:09:51,003 INFO L273 TraceCheckUtils]: 41: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2018-11-23 13:09:51,003 INFO L273 TraceCheckUtils]: 42: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2018-11-23 13:09:51,004 INFO L273 TraceCheckUtils]: 43: Hoare triple {822#true} assume true; {822#true} is VALID [2018-11-23 13:09:51,005 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {822#true} {824#(= main_~urilen~0 (+ main_~cp~0 1))} #150#return; {824#(= main_~urilen~0 (+ main_~cp~0 1))} is VALID [2018-11-23 13:09:51,005 INFO L273 TraceCheckUtils]: 45: Hoare triple {824#(= main_~urilen~0 (+ main_~cp~0 1))} assume !(~cp~0 == ~urilen~0 - 1); {823#false} is VALID [2018-11-23 13:09:51,005 INFO L256 TraceCheckUtils]: 46: Hoare triple {823#false} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {823#false} is VALID [2018-11-23 13:09:51,006 INFO L273 TraceCheckUtils]: 47: Hoare triple {823#false} ~cond := #in~cond; {823#false} is VALID [2018-11-23 13:09:51,006 INFO L273 TraceCheckUtils]: 48: Hoare triple {823#false} assume 0 == ~cond; {823#false} is VALID [2018-11-23 13:09:51,006 INFO L273 TraceCheckUtils]: 49: Hoare triple {823#false} assume !false; {823#false} is VALID [2018-11-23 13:09:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:09:51,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:09:51,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:09:51,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-23 13:09:51,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:51,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:09:51,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:51,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:09:51,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:09:51,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:09:51,063 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand 3 states. [2018-11-23 13:09:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:51,354 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2018-11-23 13:09:51,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:09:51,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-23 13:09:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:09:51,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2018-11-23 13:09:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:09:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2018-11-23 13:09:51,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2018-11-23 13:09:51,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:51,561 INFO L225 Difference]: With dead ends: 89 [2018-11-23 13:09:51,562 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 13:09:51,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:09:51,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 13:09:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 13:09:51,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:51,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-23 13:09:51,669 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 13:09:51,669 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 13:09:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:51,675 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2018-11-23 13:09:51,675 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2018-11-23 13:09:51,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:51,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:51,676 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 13:09:51,677 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 13:09:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:51,682 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2018-11-23 13:09:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2018-11-23 13:09:51,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:51,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:51,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:51,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:09:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2018-11-23 13:09:51,688 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 50 [2018-11-23 13:09:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:51,688 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2018-11-23 13:09:51,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:09:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2018-11-23 13:09:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 13:09:51,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:51,690 INFO L402 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] [2018-11-23 13:09:51,690 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:51,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:51,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1689114790, now seen corresponding path program 1 times [2018-11-23 13:09:51,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:51,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:51,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:51,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:51,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:51,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {1171#true} call ULTIMATE.init(); {1171#true} is VALID [2018-11-23 13:09:51,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 13:09:51,848 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1171#true} {1171#true} #132#return; {1171#true} is VALID [2018-11-23 13:09:51,848 INFO L256 TraceCheckUtils]: 3: Hoare triple {1171#true} call #t~ret12 := main(); {1171#true} is VALID [2018-11-23 13:09:51,848 INFO L273 TraceCheckUtils]: 4: Hoare triple {1171#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {1171#true} is VALID [2018-11-23 13:09:51,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {1171#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1171#true} is VALID [2018-11-23 13:09:51,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {1171#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1171#true} is VALID [2018-11-23 13:09:51,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {1171#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1171#true} is VALID [2018-11-23 13:09:51,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {1171#true} assume ~urilen~0 > 0; {1171#true} is VALID [2018-11-23 13:09:51,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {1171#true} assume ~tokenlen~0 > 0; {1171#true} is VALID [2018-11-23 13:09:51,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {1171#true} assume ~scheme~0 >= 0; {1171#true} is VALID [2018-11-23 13:09:51,851 INFO L273 TraceCheckUtils]: 11: Hoare triple {1171#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1171#true} is VALID [2018-11-23 13:09:51,851 INFO L256 TraceCheckUtils]: 12: Hoare triple {1171#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1171#true} is VALID [2018-11-23 13:09:51,865 INFO L273 TraceCheckUtils]: 13: Hoare triple {1171#true} ~cond := #in~cond; {1173#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:51,866 INFO L273 TraceCheckUtils]: 14: Hoare triple {1173#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:51,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {1174#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:51,867 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1174#(not (= |__VERIFIER_assert_#in~cond| 0))} {1171#true} #136#return; {1171#true} is VALID [2018-11-23 13:09:51,867 INFO L256 TraceCheckUtils]: 17: Hoare triple {1171#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1171#true} is VALID [2018-11-23 13:09:51,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {1171#true} ~cond := #in~cond; {1171#true} is VALID [2018-11-23 13:09:51,868 INFO L273 TraceCheckUtils]: 19: Hoare triple {1171#true} assume !(0 == ~cond); {1171#true} is VALID [2018-11-23 13:09:51,868 INFO L273 TraceCheckUtils]: 20: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 13:09:51,868 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1171#true} {1171#true} #138#return; {1171#true} is VALID [2018-11-23 13:09:51,869 INFO L273 TraceCheckUtils]: 22: Hoare triple {1171#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1171#true} is VALID [2018-11-23 13:09:51,869 INFO L273 TraceCheckUtils]: 23: Hoare triple {1171#true} assume 0 != #t~nondet4;havoc #t~nondet4; {1171#true} is VALID [2018-11-23 13:09:51,869 INFO L256 TraceCheckUtils]: 24: Hoare triple {1171#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1171#true} is VALID [2018-11-23 13:09:51,871 INFO L273 TraceCheckUtils]: 25: Hoare triple {1171#true} ~cond := #in~cond; {1173#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:51,871 INFO L273 TraceCheckUtils]: 26: Hoare triple {1173#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:51,873 INFO L273 TraceCheckUtils]: 27: Hoare triple {1174#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:51,875 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1174#(not (= |__VERIFIER_assert_#in~cond| 0))} {1171#true} #140#return; {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2018-11-23 13:09:51,875 INFO L256 TraceCheckUtils]: 29: Hoare triple {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1171#true} is VALID [2018-11-23 13:09:51,875 INFO L273 TraceCheckUtils]: 30: Hoare triple {1171#true} ~cond := #in~cond; {1171#true} is VALID [2018-11-23 13:09:51,875 INFO L273 TraceCheckUtils]: 31: Hoare triple {1171#true} assume !(0 == ~cond); {1171#true} is VALID [2018-11-23 13:09:51,875 INFO L273 TraceCheckUtils]: 32: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 13:09:51,877 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1171#true} {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} #142#return; {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2018-11-23 13:09:51,877 INFO L273 TraceCheckUtils]: 34: Hoare triple {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} is VALID [2018-11-23 13:09:51,879 INFO L273 TraceCheckUtils]: 35: Hoare triple {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} is VALID [2018-11-23 13:09:51,879 INFO L256 TraceCheckUtils]: 36: Hoare triple {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1171#true} is VALID [2018-11-23 13:09:51,879 INFO L273 TraceCheckUtils]: 37: Hoare triple {1171#true} ~cond := #in~cond; {1171#true} is VALID [2018-11-23 13:09:51,879 INFO L273 TraceCheckUtils]: 38: Hoare triple {1171#true} assume !(0 == ~cond); {1171#true} is VALID [2018-11-23 13:09:51,880 INFO L273 TraceCheckUtils]: 39: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 13:09:51,880 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1171#true} {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} #148#return; {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} is VALID [2018-11-23 13:09:51,881 INFO L256 TraceCheckUtils]: 41: Hoare triple {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1171#true} is VALID [2018-11-23 13:09:51,881 INFO L273 TraceCheckUtils]: 42: Hoare triple {1171#true} ~cond := #in~cond; {1171#true} is VALID [2018-11-23 13:09:51,881 INFO L273 TraceCheckUtils]: 43: Hoare triple {1171#true} assume !(0 == ~cond); {1171#true} is VALID [2018-11-23 13:09:51,881 INFO L273 TraceCheckUtils]: 44: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 13:09:51,883 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1171#true} {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} #150#return; {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} is VALID [2018-11-23 13:09:51,885 INFO L273 TraceCheckUtils]: 46: Hoare triple {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} assume !(~cp~0 == ~urilen~0 - 1); {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} is VALID [2018-11-23 13:09:51,888 INFO L256 TraceCheckUtils]: 47: Hoare triple {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:51,888 INFO L273 TraceCheckUtils]: 48: Hoare triple {1174#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1177#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:09:51,890 INFO L273 TraceCheckUtils]: 49: Hoare triple {1177#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1172#false} is VALID [2018-11-23 13:09:51,890 INFO L273 TraceCheckUtils]: 50: Hoare triple {1172#false} assume !false; {1172#false} is VALID [2018-11-23 13:09:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 13:09:51,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:51,894 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:51,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:51,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:52,267 INFO L256 TraceCheckUtils]: 0: Hoare triple {1171#true} call ULTIMATE.init(); {1171#true} is VALID [2018-11-23 13:09:52,268 INFO L273 TraceCheckUtils]: 1: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 13:09:52,268 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1171#true} {1171#true} #132#return; {1171#true} is VALID [2018-11-23 13:09:52,269 INFO L256 TraceCheckUtils]: 3: Hoare triple {1171#true} call #t~ret12 := main(); {1171#true} is VALID [2018-11-23 13:09:52,269 INFO L273 TraceCheckUtils]: 4: Hoare triple {1171#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {1171#true} is VALID [2018-11-23 13:09:52,269 INFO L273 TraceCheckUtils]: 5: Hoare triple {1171#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1171#true} is VALID [2018-11-23 13:09:52,270 INFO L273 TraceCheckUtils]: 6: Hoare triple {1171#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1171#true} is VALID [2018-11-23 13:09:52,270 INFO L273 TraceCheckUtils]: 7: Hoare triple {1171#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1171#true} is VALID [2018-11-23 13:09:52,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {1171#true} assume ~urilen~0 > 0; {1171#true} is VALID [2018-11-23 13:09:52,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {1171#true} assume ~tokenlen~0 > 0; {1171#true} is VALID [2018-11-23 13:09:52,271 INFO L273 TraceCheckUtils]: 10: Hoare triple {1171#true} assume ~scheme~0 >= 0; {1171#true} is VALID [2018-11-23 13:09:52,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {1171#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2018-11-23 13:09:52,272 INFO L256 TraceCheckUtils]: 12: Hoare triple {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1171#true} is VALID [2018-11-23 13:09:52,272 INFO L273 TraceCheckUtils]: 13: Hoare triple {1171#true} ~cond := #in~cond; {1171#true} is VALID [2018-11-23 13:09:52,272 INFO L273 TraceCheckUtils]: 14: Hoare triple {1171#true} assume !(0 == ~cond); {1171#true} is VALID [2018-11-23 13:09:52,273 INFO L273 TraceCheckUtils]: 15: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 13:09:52,273 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1171#true} {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} #136#return; {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2018-11-23 13:09:52,274 INFO L256 TraceCheckUtils]: 17: Hoare triple {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1171#true} is VALID [2018-11-23 13:09:52,274 INFO L273 TraceCheckUtils]: 18: Hoare triple {1171#true} ~cond := #in~cond; {1171#true} is VALID [2018-11-23 13:09:52,274 INFO L273 TraceCheckUtils]: 19: Hoare triple {1171#true} assume !(0 == ~cond); {1171#true} is VALID [2018-11-23 13:09:52,274 INFO L273 TraceCheckUtils]: 20: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 13:09:52,275 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1171#true} {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} #138#return; {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2018-11-23 13:09:52,275 INFO L273 TraceCheckUtils]: 22: Hoare triple {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2018-11-23 13:09:52,276 INFO L273 TraceCheckUtils]: 23: Hoare triple {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} assume 0 != #t~nondet4;havoc #t~nondet4; {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2018-11-23 13:09:52,276 INFO L256 TraceCheckUtils]: 24: Hoare triple {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1171#true} is VALID [2018-11-23 13:09:52,276 INFO L273 TraceCheckUtils]: 25: Hoare triple {1171#true} ~cond := #in~cond; {1171#true} is VALID [2018-11-23 13:09:52,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {1171#true} assume !(0 == ~cond); {1171#true} is VALID [2018-11-23 13:09:52,277 INFO L273 TraceCheckUtils]: 27: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 13:09:52,277 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1171#true} {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} #140#return; {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2018-11-23 13:09:52,277 INFO L256 TraceCheckUtils]: 29: Hoare triple {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1171#true} is VALID [2018-11-23 13:09:52,278 INFO L273 TraceCheckUtils]: 30: Hoare triple {1171#true} ~cond := #in~cond; {1171#true} is VALID [2018-11-23 13:09:52,278 INFO L273 TraceCheckUtils]: 31: Hoare triple {1171#true} assume !(0 == ~cond); {1171#true} is VALID [2018-11-23 13:09:52,278 INFO L273 TraceCheckUtils]: 32: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 13:09:52,279 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1171#true} {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} #142#return; {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2018-11-23 13:09:52,280 INFO L273 TraceCheckUtils]: 34: Hoare triple {1175#(<= (+ main_~cp~0 1) main_~urilen~0)} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} is VALID [2018-11-23 13:09:52,281 INFO L273 TraceCheckUtils]: 35: Hoare triple {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} is VALID [2018-11-23 13:09:52,281 INFO L256 TraceCheckUtils]: 36: Hoare triple {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1171#true} is VALID [2018-11-23 13:09:52,282 INFO L273 TraceCheckUtils]: 37: Hoare triple {1171#true} ~cond := #in~cond; {1171#true} is VALID [2018-11-23 13:09:52,282 INFO L273 TraceCheckUtils]: 38: Hoare triple {1171#true} assume !(0 == ~cond); {1171#true} is VALID [2018-11-23 13:09:52,282 INFO L273 TraceCheckUtils]: 39: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 13:09:52,283 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1171#true} {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} #148#return; {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} is VALID [2018-11-23 13:09:52,284 INFO L256 TraceCheckUtils]: 41: Hoare triple {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1171#true} is VALID [2018-11-23 13:09:52,284 INFO L273 TraceCheckUtils]: 42: Hoare triple {1171#true} ~cond := #in~cond; {1171#true} is VALID [2018-11-23 13:09:52,284 INFO L273 TraceCheckUtils]: 43: Hoare triple {1171#true} assume !(0 == ~cond); {1171#true} is VALID [2018-11-23 13:09:52,285 INFO L273 TraceCheckUtils]: 44: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 13:09:52,286 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1171#true} {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} #150#return; {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} is VALID [2018-11-23 13:09:52,286 INFO L273 TraceCheckUtils]: 46: Hoare triple {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} assume !(~cp~0 == ~urilen~0 - 1); {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} is VALID [2018-11-23 13:09:52,287 INFO L256 TraceCheckUtils]: 47: Hoare triple {1176#(<= (+ main_~cp~0 2) main_~urilen~0)} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1322#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:52,288 INFO L273 TraceCheckUtils]: 48: Hoare triple {1322#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1326#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:09:52,288 INFO L273 TraceCheckUtils]: 49: Hoare triple {1326#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1172#false} is VALID [2018-11-23 13:09:52,288 INFO L273 TraceCheckUtils]: 50: Hoare triple {1172#false} assume !false; {1172#false} is VALID [2018-11-23 13:09:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:09:52,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:09:52,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-23 13:09:52,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-23 13:09:52,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:52,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:09:52,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:52,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:09:52,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:09:52,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:09:52,396 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 9 states. [2018-11-23 13:09:53,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:53,553 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2018-11-23 13:09:53,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:09:53,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-23 13:09:53,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:09:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2018-11-23 13:09:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:09:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2018-11-23 13:09:53,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 73 transitions. [2018-11-23 13:09:53,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:53,702 INFO L225 Difference]: With dead ends: 67 [2018-11-23 13:09:53,704 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 13:09:53,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:09:53,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 13:09:53,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-11-23 13:09:53,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:53,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 64 states. [2018-11-23 13:09:53,808 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 64 states. [2018-11-23 13:09:53,808 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 64 states. [2018-11-23 13:09:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:53,813 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2018-11-23 13:09:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2018-11-23 13:09:53,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:53,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:53,814 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 65 states. [2018-11-23 13:09:53,814 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 65 states. [2018-11-23 13:09:53,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:53,818 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2018-11-23 13:09:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2018-11-23 13:09:53,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:53,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:53,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:53,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 13:09:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2018-11-23 13:09:53,823 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 51 [2018-11-23 13:09:53,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:53,823 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2018-11-23 13:09:53,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:09:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2018-11-23 13:09:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 13:09:53,826 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:53,826 INFO L402 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] [2018-11-23 13:09:53,826 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:53,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:53,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1728052911, now seen corresponding path program 1 times [2018-11-23 13:09:53,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:53,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:53,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:53,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:53,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:53,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {1660#true} call ULTIMATE.init(); {1660#true} is VALID [2018-11-23 13:09:53,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:53,979 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1660#true} {1660#true} #132#return; {1660#true} is VALID [2018-11-23 13:09:53,979 INFO L256 TraceCheckUtils]: 3: Hoare triple {1660#true} call #t~ret12 := main(); {1660#true} is VALID [2018-11-23 13:09:53,979 INFO L273 TraceCheckUtils]: 4: Hoare triple {1660#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {1660#true} is VALID [2018-11-23 13:09:53,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {1660#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1660#true} is VALID [2018-11-23 13:09:53,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {1660#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1660#true} is VALID [2018-11-23 13:09:53,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {1660#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1660#true} is VALID [2018-11-23 13:09:53,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {1660#true} assume ~urilen~0 > 0; {1660#true} is VALID [2018-11-23 13:09:53,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {1660#true} assume ~tokenlen~0 > 0; {1660#true} is VALID [2018-11-23 13:09:53,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {1660#true} assume ~scheme~0 >= 0; {1660#true} is VALID [2018-11-23 13:09:53,981 INFO L273 TraceCheckUtils]: 11: Hoare triple {1660#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1660#true} is VALID [2018-11-23 13:09:53,981 INFO L256 TraceCheckUtils]: 12: Hoare triple {1660#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:53,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {1660#true} ~cond := #in~cond; {1662#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:53,982 INFO L273 TraceCheckUtils]: 14: Hoare triple {1662#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1663#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:53,983 INFO L273 TraceCheckUtils]: 15: Hoare triple {1663#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1663#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:53,983 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1663#(not (= |__VERIFIER_assert_#in~cond| 0))} {1660#true} #136#return; {1660#true} is VALID [2018-11-23 13:09:53,983 INFO L256 TraceCheckUtils]: 17: Hoare triple {1660#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:53,983 INFO L273 TraceCheckUtils]: 18: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:53,984 INFO L273 TraceCheckUtils]: 19: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:53,984 INFO L273 TraceCheckUtils]: 20: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:53,984 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1660#true} {1660#true} #138#return; {1660#true} is VALID [2018-11-23 13:09:53,984 INFO L273 TraceCheckUtils]: 22: Hoare triple {1660#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1660#true} is VALID [2018-11-23 13:09:53,984 INFO L273 TraceCheckUtils]: 23: Hoare triple {1660#true} assume 0 != #t~nondet4;havoc #t~nondet4; {1660#true} is VALID [2018-11-23 13:09:53,985 INFO L256 TraceCheckUtils]: 24: Hoare triple {1660#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:53,985 INFO L273 TraceCheckUtils]: 25: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:53,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:53,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:53,986 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1660#true} {1660#true} #140#return; {1660#true} is VALID [2018-11-23 13:09:53,986 INFO L256 TraceCheckUtils]: 29: Hoare triple {1660#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:53,986 INFO L273 TraceCheckUtils]: 30: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:53,986 INFO L273 TraceCheckUtils]: 31: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:53,987 INFO L273 TraceCheckUtils]: 32: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:53,987 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1660#true} {1660#true} #142#return; {1660#true} is VALID [2018-11-23 13:09:53,987 INFO L273 TraceCheckUtils]: 34: Hoare triple {1660#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1660#true} is VALID [2018-11-23 13:09:53,987 INFO L273 TraceCheckUtils]: 35: Hoare triple {1660#true} assume 0 != #t~nondet5;havoc #t~nondet5; {1660#true} is VALID [2018-11-23 13:09:53,987 INFO L256 TraceCheckUtils]: 36: Hoare triple {1660#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:53,987 INFO L273 TraceCheckUtils]: 37: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:53,988 INFO L273 TraceCheckUtils]: 38: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:53,988 INFO L273 TraceCheckUtils]: 39: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:53,988 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1660#true} {1660#true} #148#return; {1660#true} is VALID [2018-11-23 13:09:53,988 INFO L256 TraceCheckUtils]: 41: Hoare triple {1660#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:53,989 INFO L273 TraceCheckUtils]: 42: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:53,989 INFO L273 TraceCheckUtils]: 43: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:53,989 INFO L273 TraceCheckUtils]: 44: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:53,989 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1660#true} {1660#true} #150#return; {1660#true} is VALID [2018-11-23 13:09:53,990 INFO L273 TraceCheckUtils]: 46: Hoare triple {1660#true} assume !(~cp~0 == ~urilen~0 - 1); {1660#true} is VALID [2018-11-23 13:09:53,990 INFO L256 TraceCheckUtils]: 47: Hoare triple {1660#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:53,990 INFO L273 TraceCheckUtils]: 48: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:53,990 INFO L273 TraceCheckUtils]: 49: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:53,990 INFO L273 TraceCheckUtils]: 50: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:53,991 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1660#true} {1660#true} #152#return; {1660#true} is VALID [2018-11-23 13:09:53,991 INFO L256 TraceCheckUtils]: 52: Hoare triple {1660#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:53,991 INFO L273 TraceCheckUtils]: 53: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:53,991 INFO L273 TraceCheckUtils]: 54: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:53,992 INFO L273 TraceCheckUtils]: 55: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:53,992 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {1660#true} {1660#true} #154#return; {1660#true} is VALID [2018-11-23 13:09:53,992 INFO L273 TraceCheckUtils]: 57: Hoare triple {1660#true} assume !(1 + ~cp~0 == ~urilen~0 - 1);#t~pre7 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre7;~scheme~0 := ~cp~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1660#true} is VALID [2018-11-23 13:09:53,992 INFO L273 TraceCheckUtils]: 58: Hoare triple {1660#true} assume 0 != #t~nondet8;havoc #t~nondet8;~c~0 := 0; {1660#true} is VALID [2018-11-23 13:09:53,993 INFO L256 TraceCheckUtils]: 59: Hoare triple {1660#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:53,993 INFO L273 TraceCheckUtils]: 60: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:53,993 INFO L273 TraceCheckUtils]: 61: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:53,993 INFO L273 TraceCheckUtils]: 62: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:53,994 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {1660#true} {1660#true} #156#return; {1660#true} is VALID [2018-11-23 13:09:53,994 INFO L256 TraceCheckUtils]: 64: Hoare triple {1660#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:53,994 INFO L273 TraceCheckUtils]: 65: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:53,994 INFO L273 TraceCheckUtils]: 66: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:53,994 INFO L273 TraceCheckUtils]: 67: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:53,995 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {1660#true} {1660#true} #158#return; {1660#true} is VALID [2018-11-23 13:09:54,016 INFO L273 TraceCheckUtils]: 69: Hoare triple {1660#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2018-11-23 13:09:54,016 INFO L256 TraceCheckUtils]: 70: Hoare triple {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:54,016 INFO L273 TraceCheckUtils]: 71: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:54,017 INFO L273 TraceCheckUtils]: 72: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:54,017 INFO L273 TraceCheckUtils]: 73: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:54,026 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {1660#true} {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} #160#return; {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2018-11-23 13:09:54,026 INFO L256 TraceCheckUtils]: 75: Hoare triple {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:54,026 INFO L273 TraceCheckUtils]: 76: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:54,027 INFO L273 TraceCheckUtils]: 77: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:54,027 INFO L273 TraceCheckUtils]: 78: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:54,035 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {1660#true} {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} #162#return; {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2018-11-23 13:09:54,036 INFO L273 TraceCheckUtils]: 80: Hoare triple {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2018-11-23 13:09:54,037 INFO L273 TraceCheckUtils]: 81: Hoare triple {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume 0 != #t~nondet9;havoc #t~nondet9;#t~pre10 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre10; {1665#(<= (+ main_~c~0 1) main_~tokenlen~0)} is VALID [2018-11-23 13:09:54,044 INFO L256 TraceCheckUtils]: 82: Hoare triple {1665#(<= (+ main_~c~0 1) main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {1663#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:54,045 INFO L273 TraceCheckUtils]: 83: Hoare triple {1663#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1666#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:09:54,045 INFO L273 TraceCheckUtils]: 84: Hoare triple {1666#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1661#false} is VALID [2018-11-23 13:09:54,045 INFO L273 TraceCheckUtils]: 85: Hoare triple {1661#false} assume !false; {1661#false} is VALID [2018-11-23 13:09:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 23 proven. 34 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-23 13:09:54,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:54,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:54,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:54,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:54,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {1660#true} call ULTIMATE.init(); {1660#true} is VALID [2018-11-23 13:09:54,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:54,246 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1660#true} {1660#true} #132#return; {1660#true} is VALID [2018-11-23 13:09:54,246 INFO L256 TraceCheckUtils]: 3: Hoare triple {1660#true} call #t~ret12 := main(); {1660#true} is VALID [2018-11-23 13:09:54,247 INFO L273 TraceCheckUtils]: 4: Hoare triple {1660#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {1660#true} is VALID [2018-11-23 13:09:54,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {1660#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1660#true} is VALID [2018-11-23 13:09:54,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {1660#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1660#true} is VALID [2018-11-23 13:09:54,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {1660#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1660#true} is VALID [2018-11-23 13:09:54,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {1660#true} assume ~urilen~0 > 0; {1660#true} is VALID [2018-11-23 13:09:54,248 INFO L273 TraceCheckUtils]: 9: Hoare triple {1660#true} assume ~tokenlen~0 > 0; {1660#true} is VALID [2018-11-23 13:09:54,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {1660#true} assume ~scheme~0 >= 0; {1660#true} is VALID [2018-11-23 13:09:54,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {1660#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1660#true} is VALID [2018-11-23 13:09:54,248 INFO L256 TraceCheckUtils]: 12: Hoare triple {1660#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:54,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:54,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:54,249 INFO L273 TraceCheckUtils]: 15: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:54,249 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1660#true} {1660#true} #136#return; {1660#true} is VALID [2018-11-23 13:09:54,249 INFO L256 TraceCheckUtils]: 17: Hoare triple {1660#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:54,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:54,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:54,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:54,250 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1660#true} {1660#true} #138#return; {1660#true} is VALID [2018-11-23 13:09:54,250 INFO L273 TraceCheckUtils]: 22: Hoare triple {1660#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1660#true} is VALID [2018-11-23 13:09:54,250 INFO L273 TraceCheckUtils]: 23: Hoare triple {1660#true} assume 0 != #t~nondet4;havoc #t~nondet4; {1660#true} is VALID [2018-11-23 13:09:54,250 INFO L256 TraceCheckUtils]: 24: Hoare triple {1660#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:54,251 INFO L273 TraceCheckUtils]: 25: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:54,251 INFO L273 TraceCheckUtils]: 26: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:54,251 INFO L273 TraceCheckUtils]: 27: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:54,251 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1660#true} {1660#true} #140#return; {1660#true} is VALID [2018-11-23 13:09:54,251 INFO L256 TraceCheckUtils]: 29: Hoare triple {1660#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:54,251 INFO L273 TraceCheckUtils]: 30: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:54,252 INFO L273 TraceCheckUtils]: 31: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:54,252 INFO L273 TraceCheckUtils]: 32: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:54,252 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1660#true} {1660#true} #142#return; {1660#true} is VALID [2018-11-23 13:09:54,252 INFO L273 TraceCheckUtils]: 34: Hoare triple {1660#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1660#true} is VALID [2018-11-23 13:09:54,252 INFO L273 TraceCheckUtils]: 35: Hoare triple {1660#true} assume 0 != #t~nondet5;havoc #t~nondet5; {1660#true} is VALID [2018-11-23 13:09:54,253 INFO L256 TraceCheckUtils]: 36: Hoare triple {1660#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:54,253 INFO L273 TraceCheckUtils]: 37: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:54,253 INFO L273 TraceCheckUtils]: 38: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:54,253 INFO L273 TraceCheckUtils]: 39: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:54,254 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1660#true} {1660#true} #148#return; {1660#true} is VALID [2018-11-23 13:09:54,254 INFO L256 TraceCheckUtils]: 41: Hoare triple {1660#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:54,254 INFO L273 TraceCheckUtils]: 42: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:54,254 INFO L273 TraceCheckUtils]: 43: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:54,254 INFO L273 TraceCheckUtils]: 44: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:54,255 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1660#true} {1660#true} #150#return; {1660#true} is VALID [2018-11-23 13:09:54,255 INFO L273 TraceCheckUtils]: 46: Hoare triple {1660#true} assume !(~cp~0 == ~urilen~0 - 1); {1660#true} is VALID [2018-11-23 13:09:54,255 INFO L256 TraceCheckUtils]: 47: Hoare triple {1660#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:54,255 INFO L273 TraceCheckUtils]: 48: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:54,255 INFO L273 TraceCheckUtils]: 49: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:54,255 INFO L273 TraceCheckUtils]: 50: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:54,256 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1660#true} {1660#true} #152#return; {1660#true} is VALID [2018-11-23 13:09:54,256 INFO L256 TraceCheckUtils]: 52: Hoare triple {1660#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:54,256 INFO L273 TraceCheckUtils]: 53: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:54,256 INFO L273 TraceCheckUtils]: 54: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:54,256 INFO L273 TraceCheckUtils]: 55: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:54,257 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {1660#true} {1660#true} #154#return; {1660#true} is VALID [2018-11-23 13:09:54,257 INFO L273 TraceCheckUtils]: 57: Hoare triple {1660#true} assume !(1 + ~cp~0 == ~urilen~0 - 1);#t~pre7 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre7;~scheme~0 := ~cp~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1660#true} is VALID [2018-11-23 13:09:54,257 INFO L273 TraceCheckUtils]: 58: Hoare triple {1660#true} assume 0 != #t~nondet8;havoc #t~nondet8;~c~0 := 0; {1660#true} is VALID [2018-11-23 13:09:54,257 INFO L256 TraceCheckUtils]: 59: Hoare triple {1660#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:54,257 INFO L273 TraceCheckUtils]: 60: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:54,257 INFO L273 TraceCheckUtils]: 61: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:54,257 INFO L273 TraceCheckUtils]: 62: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:54,258 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {1660#true} {1660#true} #156#return; {1660#true} is VALID [2018-11-23 13:09:54,258 INFO L256 TraceCheckUtils]: 64: Hoare triple {1660#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:54,258 INFO L273 TraceCheckUtils]: 65: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:54,258 INFO L273 TraceCheckUtils]: 66: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:54,258 INFO L273 TraceCheckUtils]: 67: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:54,259 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {1660#true} {1660#true} #158#return; {1660#true} is VALID [2018-11-23 13:09:54,266 INFO L273 TraceCheckUtils]: 69: Hoare triple {1660#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2018-11-23 13:09:54,266 INFO L256 TraceCheckUtils]: 70: Hoare triple {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:54,266 INFO L273 TraceCheckUtils]: 71: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:54,266 INFO L273 TraceCheckUtils]: 72: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:54,266 INFO L273 TraceCheckUtils]: 73: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:54,269 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {1660#true} {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} #160#return; {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2018-11-23 13:09:54,269 INFO L256 TraceCheckUtils]: 75: Hoare triple {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1660#true} is VALID [2018-11-23 13:09:54,269 INFO L273 TraceCheckUtils]: 76: Hoare triple {1660#true} ~cond := #in~cond; {1660#true} is VALID [2018-11-23 13:09:54,269 INFO L273 TraceCheckUtils]: 77: Hoare triple {1660#true} assume !(0 == ~cond); {1660#true} is VALID [2018-11-23 13:09:54,269 INFO L273 TraceCheckUtils]: 78: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:09:54,276 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {1660#true} {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} #162#return; {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2018-11-23 13:09:54,276 INFO L273 TraceCheckUtils]: 80: Hoare triple {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2018-11-23 13:09:54,278 INFO L273 TraceCheckUtils]: 81: Hoare triple {1664#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume 0 != #t~nondet9;havoc #t~nondet9;#t~pre10 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre10; {1665#(<= (+ main_~c~0 1) main_~tokenlen~0)} is VALID [2018-11-23 13:09:54,281 INFO L256 TraceCheckUtils]: 82: Hoare triple {1665#(<= (+ main_~c~0 1) main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {1916#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:54,281 INFO L273 TraceCheckUtils]: 83: Hoare triple {1916#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1920#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:09:54,283 INFO L273 TraceCheckUtils]: 84: Hoare triple {1920#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1661#false} is VALID [2018-11-23 13:09:54,283 INFO L273 TraceCheckUtils]: 85: Hoare triple {1661#false} assume !false; {1661#false} is VALID [2018-11-23 13:09:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-23 13:09:54,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:09:54,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-23 13:09:54,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-11-23 13:09:54,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:54,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:09:54,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:54,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:09:54,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:09:54,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:09:54,376 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 9 states. [2018-11-23 13:09:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:55,659 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2018-11-23 13:09:55,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:09:55,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-11-23 13:09:55,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:09:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2018-11-23 13:09:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:09:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2018-11-23 13:09:55,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 75 transitions. [2018-11-23 13:09:55,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:55,814 INFO L225 Difference]: With dead ends: 73 [2018-11-23 13:09:55,814 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 13:09:55,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:09:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 13:09:55,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2018-11-23 13:09:55,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:55,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 68 states. [2018-11-23 13:09:55,889 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 68 states. [2018-11-23 13:09:55,889 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 68 states. [2018-11-23 13:09:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:55,894 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2018-11-23 13:09:55,894 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2018-11-23 13:09:55,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:55,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:55,895 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 71 states. [2018-11-23 13:09:55,895 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 71 states. [2018-11-23 13:09:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:55,898 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2018-11-23 13:09:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2018-11-23 13:09:55,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:55,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:55,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:55,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 13:09:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2018-11-23 13:09:55,903 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 86 [2018-11-23 13:09:55,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:55,903 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2018-11-23 13:09:55,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:09:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-11-23 13:09:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 13:09:55,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:55,907 INFO L402 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] [2018-11-23 13:09:55,907 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:55,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:55,907 INFO L82 PathProgramCache]: Analyzing trace with hash -733340726, now seen corresponding path program 1 times [2018-11-23 13:09:55,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:55,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:55,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:55,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:55,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:56,076 INFO L256 TraceCheckUtils]: 0: Hoare triple {2279#true} call ULTIMATE.init(); {2279#true} is VALID [2018-11-23 13:09:56,077 INFO L273 TraceCheckUtils]: 1: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,077 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2279#true} {2279#true} #132#return; {2279#true} is VALID [2018-11-23 13:09:56,078 INFO L256 TraceCheckUtils]: 3: Hoare triple {2279#true} call #t~ret12 := main(); {2279#true} is VALID [2018-11-23 13:09:56,078 INFO L273 TraceCheckUtils]: 4: Hoare triple {2279#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {2279#true} is VALID [2018-11-23 13:09:56,078 INFO L273 TraceCheckUtils]: 5: Hoare triple {2279#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {2279#true} is VALID [2018-11-23 13:09:56,079 INFO L273 TraceCheckUtils]: 6: Hoare triple {2279#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {2279#true} is VALID [2018-11-23 13:09:56,079 INFO L273 TraceCheckUtils]: 7: Hoare triple {2279#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {2279#true} is VALID [2018-11-23 13:09:56,079 INFO L273 TraceCheckUtils]: 8: Hoare triple {2279#true} assume ~urilen~0 > 0; {2279#true} is VALID [2018-11-23 13:09:56,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {2279#true} assume ~tokenlen~0 > 0; {2279#true} is VALID [2018-11-23 13:09:56,080 INFO L273 TraceCheckUtils]: 10: Hoare triple {2279#true} assume ~scheme~0 >= 0; {2279#true} is VALID [2018-11-23 13:09:56,080 INFO L273 TraceCheckUtils]: 11: Hoare triple {2279#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {2279#true} is VALID [2018-11-23 13:09:56,080 INFO L256 TraceCheckUtils]: 12: Hoare triple {2279#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {2279#true} ~cond := #in~cond; {2281#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:56,083 INFO L273 TraceCheckUtils]: 14: Hoare triple {2281#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {2282#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:56,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {2282#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2282#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:56,083 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2282#(not (= |__VERIFIER_assert_#in~cond| 0))} {2279#true} #136#return; {2279#true} is VALID [2018-11-23 13:09:56,084 INFO L256 TraceCheckUtils]: 17: Hoare triple {2279#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,084 INFO L273 TraceCheckUtils]: 20: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,084 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2279#true} {2279#true} #138#return; {2279#true} is VALID [2018-11-23 13:09:56,084 INFO L273 TraceCheckUtils]: 22: Hoare triple {2279#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2279#true} is VALID [2018-11-23 13:09:56,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {2279#true} assume 0 != #t~nondet4;havoc #t~nondet4; {2279#true} is VALID [2018-11-23 13:09:56,085 INFO L256 TraceCheckUtils]: 24: Hoare triple {2279#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,085 INFO L273 TraceCheckUtils]: 25: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,085 INFO L273 TraceCheckUtils]: 26: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,085 INFO L273 TraceCheckUtils]: 27: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,085 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2279#true} {2279#true} #140#return; {2279#true} is VALID [2018-11-23 13:09:56,085 INFO L256 TraceCheckUtils]: 29: Hoare triple {2279#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,086 INFO L273 TraceCheckUtils]: 30: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,086 INFO L273 TraceCheckUtils]: 31: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,086 INFO L273 TraceCheckUtils]: 32: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,086 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2279#true} {2279#true} #142#return; {2279#true} is VALID [2018-11-23 13:09:56,086 INFO L273 TraceCheckUtils]: 34: Hoare triple {2279#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2279#true} is VALID [2018-11-23 13:09:56,086 INFO L273 TraceCheckUtils]: 35: Hoare triple {2279#true} assume 0 != #t~nondet5;havoc #t~nondet5; {2279#true} is VALID [2018-11-23 13:09:56,086 INFO L256 TraceCheckUtils]: 36: Hoare triple {2279#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,087 INFO L273 TraceCheckUtils]: 37: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,087 INFO L273 TraceCheckUtils]: 38: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,087 INFO L273 TraceCheckUtils]: 39: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,087 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2279#true} {2279#true} #148#return; {2279#true} is VALID [2018-11-23 13:09:56,087 INFO L256 TraceCheckUtils]: 41: Hoare triple {2279#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,087 INFO L273 TraceCheckUtils]: 42: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,087 INFO L273 TraceCheckUtils]: 43: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,088 INFO L273 TraceCheckUtils]: 44: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,088 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2279#true} {2279#true} #150#return; {2279#true} is VALID [2018-11-23 13:09:56,088 INFO L273 TraceCheckUtils]: 46: Hoare triple {2279#true} assume !(~cp~0 == ~urilen~0 - 1); {2279#true} is VALID [2018-11-23 13:09:56,088 INFO L256 TraceCheckUtils]: 47: Hoare triple {2279#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,088 INFO L273 TraceCheckUtils]: 48: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,088 INFO L273 TraceCheckUtils]: 49: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,088 INFO L273 TraceCheckUtils]: 50: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,088 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2279#true} {2279#true} #152#return; {2279#true} is VALID [2018-11-23 13:09:56,089 INFO L256 TraceCheckUtils]: 52: Hoare triple {2279#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,089 INFO L273 TraceCheckUtils]: 53: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,089 INFO L273 TraceCheckUtils]: 54: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,089 INFO L273 TraceCheckUtils]: 55: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,089 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {2279#true} {2279#true} #154#return; {2279#true} is VALID [2018-11-23 13:09:56,090 INFO L273 TraceCheckUtils]: 57: Hoare triple {2279#true} assume !(1 + ~cp~0 == ~urilen~0 - 1);#t~pre7 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre7;~scheme~0 := ~cp~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2279#true} is VALID [2018-11-23 13:09:56,097 INFO L273 TraceCheckUtils]: 58: Hoare triple {2279#true} assume 0 != #t~nondet8;havoc #t~nondet8;~c~0 := 0; {2283#(= main_~c~0 0)} is VALID [2018-11-23 13:09:56,098 INFO L256 TraceCheckUtils]: 59: Hoare triple {2283#(= main_~c~0 0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,098 INFO L273 TraceCheckUtils]: 60: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,098 INFO L273 TraceCheckUtils]: 61: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,098 INFO L273 TraceCheckUtils]: 62: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,099 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {2279#true} {2283#(= main_~c~0 0)} #156#return; {2283#(= main_~c~0 0)} is VALID [2018-11-23 13:09:56,099 INFO L256 TraceCheckUtils]: 64: Hoare triple {2283#(= main_~c~0 0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,099 INFO L273 TraceCheckUtils]: 65: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,099 INFO L273 TraceCheckUtils]: 66: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,099 INFO L273 TraceCheckUtils]: 67: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,100 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {2279#true} {2283#(= main_~c~0 0)} #158#return; {2283#(= main_~c~0 0)} is VALID [2018-11-23 13:09:56,100 INFO L273 TraceCheckUtils]: 69: Hoare triple {2283#(= main_~c~0 0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {2283#(= main_~c~0 0)} is VALID [2018-11-23 13:09:56,100 INFO L256 TraceCheckUtils]: 70: Hoare triple {2283#(= main_~c~0 0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,100 INFO L273 TraceCheckUtils]: 71: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,100 INFO L273 TraceCheckUtils]: 72: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,101 INFO L273 TraceCheckUtils]: 73: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,101 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {2279#true} {2283#(= main_~c~0 0)} #160#return; {2283#(= main_~c~0 0)} is VALID [2018-11-23 13:09:56,101 INFO L256 TraceCheckUtils]: 75: Hoare triple {2283#(= main_~c~0 0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,101 INFO L273 TraceCheckUtils]: 76: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,102 INFO L273 TraceCheckUtils]: 77: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,102 INFO L273 TraceCheckUtils]: 78: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,108 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {2279#true} {2283#(= main_~c~0 0)} #162#return; {2283#(= main_~c~0 0)} is VALID [2018-11-23 13:09:56,108 INFO L273 TraceCheckUtils]: 80: Hoare triple {2283#(= main_~c~0 0)} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {2283#(= main_~c~0 0)} is VALID [2018-11-23 13:09:56,109 INFO L273 TraceCheckUtils]: 81: Hoare triple {2283#(= main_~c~0 0)} assume 0 != #t~nondet9;havoc #t~nondet9;#t~pre10 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre10; {2284#(<= 1 main_~c~0)} is VALID [2018-11-23 13:09:56,109 INFO L256 TraceCheckUtils]: 82: Hoare triple {2284#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,109 INFO L273 TraceCheckUtils]: 83: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,109 INFO L273 TraceCheckUtils]: 84: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,109 INFO L273 TraceCheckUtils]: 85: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,110 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {2279#true} {2284#(<= 1 main_~c~0)} #164#return; {2284#(<= 1 main_~c~0)} is VALID [2018-11-23 13:09:56,111 INFO L256 TraceCheckUtils]: 87: Hoare triple {2284#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {2282#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:56,111 INFO L273 TraceCheckUtils]: 88: Hoare triple {2282#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2285#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:09:56,111 INFO L273 TraceCheckUtils]: 89: Hoare triple {2285#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2280#false} is VALID [2018-11-23 13:09:56,112 INFO L273 TraceCheckUtils]: 90: Hoare triple {2280#false} assume !false; {2280#false} is VALID [2018-11-23 13:09:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 25 proven. 37 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-23 13:09:56,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:56,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:56,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:56,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:56,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {2279#true} call ULTIMATE.init(); {2279#true} is VALID [2018-11-23 13:09:56,494 INFO L273 TraceCheckUtils]: 1: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,494 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2279#true} {2279#true} #132#return; {2279#true} is VALID [2018-11-23 13:09:56,495 INFO L256 TraceCheckUtils]: 3: Hoare triple {2279#true} call #t~ret12 := main(); {2279#true} is VALID [2018-11-23 13:09:56,495 INFO L273 TraceCheckUtils]: 4: Hoare triple {2279#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {2279#true} is VALID [2018-11-23 13:09:56,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {2279#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {2279#true} is VALID [2018-11-23 13:09:56,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {2279#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {2279#true} is VALID [2018-11-23 13:09:56,496 INFO L273 TraceCheckUtils]: 7: Hoare triple {2279#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {2279#true} is VALID [2018-11-23 13:09:56,496 INFO L273 TraceCheckUtils]: 8: Hoare triple {2279#true} assume ~urilen~0 > 0; {2279#true} is VALID [2018-11-23 13:09:56,496 INFO L273 TraceCheckUtils]: 9: Hoare triple {2279#true} assume ~tokenlen~0 > 0; {2279#true} is VALID [2018-11-23 13:09:56,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {2279#true} assume ~scheme~0 >= 0; {2279#true} is VALID [2018-11-23 13:09:56,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {2279#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {2279#true} is VALID [2018-11-23 13:09:56,497 INFO L256 TraceCheckUtils]: 12: Hoare triple {2279#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,497 INFO L273 TraceCheckUtils]: 13: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,497 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2279#true} {2279#true} #136#return; {2279#true} is VALID [2018-11-23 13:09:56,497 INFO L256 TraceCheckUtils]: 17: Hoare triple {2279#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,498 INFO L273 TraceCheckUtils]: 19: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,498 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2279#true} {2279#true} #138#return; {2279#true} is VALID [2018-11-23 13:09:56,498 INFO L273 TraceCheckUtils]: 22: Hoare triple {2279#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2279#true} is VALID [2018-11-23 13:09:56,498 INFO L273 TraceCheckUtils]: 23: Hoare triple {2279#true} assume 0 != #t~nondet4;havoc #t~nondet4; {2279#true} is VALID [2018-11-23 13:09:56,498 INFO L256 TraceCheckUtils]: 24: Hoare triple {2279#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,499 INFO L273 TraceCheckUtils]: 25: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,499 INFO L273 TraceCheckUtils]: 26: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,499 INFO L273 TraceCheckUtils]: 27: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,499 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2279#true} {2279#true} #140#return; {2279#true} is VALID [2018-11-23 13:09:56,499 INFO L256 TraceCheckUtils]: 29: Hoare triple {2279#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,499 INFO L273 TraceCheckUtils]: 30: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,499 INFO L273 TraceCheckUtils]: 31: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,499 INFO L273 TraceCheckUtils]: 32: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,500 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2279#true} {2279#true} #142#return; {2279#true} is VALID [2018-11-23 13:09:56,500 INFO L273 TraceCheckUtils]: 34: Hoare triple {2279#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2279#true} is VALID [2018-11-23 13:09:56,500 INFO L273 TraceCheckUtils]: 35: Hoare triple {2279#true} assume 0 != #t~nondet5;havoc #t~nondet5; {2279#true} is VALID [2018-11-23 13:09:56,500 INFO L256 TraceCheckUtils]: 36: Hoare triple {2279#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,500 INFO L273 TraceCheckUtils]: 37: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,500 INFO L273 TraceCheckUtils]: 38: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,501 INFO L273 TraceCheckUtils]: 39: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,501 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2279#true} {2279#true} #148#return; {2279#true} is VALID [2018-11-23 13:09:56,501 INFO L256 TraceCheckUtils]: 41: Hoare triple {2279#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,501 INFO L273 TraceCheckUtils]: 42: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,501 INFO L273 TraceCheckUtils]: 43: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,502 INFO L273 TraceCheckUtils]: 44: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,502 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2279#true} {2279#true} #150#return; {2279#true} is VALID [2018-11-23 13:09:56,502 INFO L273 TraceCheckUtils]: 46: Hoare triple {2279#true} assume !(~cp~0 == ~urilen~0 - 1); {2279#true} is VALID [2018-11-23 13:09:56,502 INFO L256 TraceCheckUtils]: 47: Hoare triple {2279#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,502 INFO L273 TraceCheckUtils]: 48: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,503 INFO L273 TraceCheckUtils]: 49: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,503 INFO L273 TraceCheckUtils]: 50: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,503 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2279#true} {2279#true} #152#return; {2279#true} is VALID [2018-11-23 13:09:56,503 INFO L256 TraceCheckUtils]: 52: Hoare triple {2279#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,503 INFO L273 TraceCheckUtils]: 53: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,504 INFO L273 TraceCheckUtils]: 54: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,504 INFO L273 TraceCheckUtils]: 55: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,504 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {2279#true} {2279#true} #154#return; {2279#true} is VALID [2018-11-23 13:09:56,504 INFO L273 TraceCheckUtils]: 57: Hoare triple {2279#true} assume !(1 + ~cp~0 == ~urilen~0 - 1);#t~pre7 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre7;~scheme~0 := ~cp~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2279#true} is VALID [2018-11-23 13:09:56,516 INFO L273 TraceCheckUtils]: 58: Hoare triple {2279#true} assume 0 != #t~nondet8;havoc #t~nondet8;~c~0 := 0; {2463#(<= 0 main_~c~0)} is VALID [2018-11-23 13:09:56,516 INFO L256 TraceCheckUtils]: 59: Hoare triple {2463#(<= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,517 INFO L273 TraceCheckUtils]: 60: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,517 INFO L273 TraceCheckUtils]: 61: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,517 INFO L273 TraceCheckUtils]: 62: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,518 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {2279#true} {2463#(<= 0 main_~c~0)} #156#return; {2463#(<= 0 main_~c~0)} is VALID [2018-11-23 13:09:56,518 INFO L256 TraceCheckUtils]: 64: Hoare triple {2463#(<= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,518 INFO L273 TraceCheckUtils]: 65: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,518 INFO L273 TraceCheckUtils]: 66: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,518 INFO L273 TraceCheckUtils]: 67: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,519 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {2279#true} {2463#(<= 0 main_~c~0)} #158#return; {2463#(<= 0 main_~c~0)} is VALID [2018-11-23 13:09:56,519 INFO L273 TraceCheckUtils]: 69: Hoare triple {2463#(<= 0 main_~c~0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {2463#(<= 0 main_~c~0)} is VALID [2018-11-23 13:09:56,519 INFO L256 TraceCheckUtils]: 70: Hoare triple {2463#(<= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,519 INFO L273 TraceCheckUtils]: 71: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,519 INFO L273 TraceCheckUtils]: 72: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,520 INFO L273 TraceCheckUtils]: 73: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,520 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {2279#true} {2463#(<= 0 main_~c~0)} #160#return; {2463#(<= 0 main_~c~0)} is VALID [2018-11-23 13:09:56,521 INFO L256 TraceCheckUtils]: 75: Hoare triple {2463#(<= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,521 INFO L273 TraceCheckUtils]: 76: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,521 INFO L273 TraceCheckUtils]: 77: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,521 INFO L273 TraceCheckUtils]: 78: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,527 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {2279#true} {2463#(<= 0 main_~c~0)} #162#return; {2463#(<= 0 main_~c~0)} is VALID [2018-11-23 13:09:56,528 INFO L273 TraceCheckUtils]: 80: Hoare triple {2463#(<= 0 main_~c~0)} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {2463#(<= 0 main_~c~0)} is VALID [2018-11-23 13:09:56,529 INFO L273 TraceCheckUtils]: 81: Hoare triple {2463#(<= 0 main_~c~0)} assume 0 != #t~nondet9;havoc #t~nondet9;#t~pre10 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre10; {2284#(<= 1 main_~c~0)} is VALID [2018-11-23 13:09:56,529 INFO L256 TraceCheckUtils]: 82: Hoare triple {2284#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {2279#true} is VALID [2018-11-23 13:09:56,529 INFO L273 TraceCheckUtils]: 83: Hoare triple {2279#true} ~cond := #in~cond; {2279#true} is VALID [2018-11-23 13:09:56,529 INFO L273 TraceCheckUtils]: 84: Hoare triple {2279#true} assume !(0 == ~cond); {2279#true} is VALID [2018-11-23 13:09:56,529 INFO L273 TraceCheckUtils]: 85: Hoare triple {2279#true} assume true; {2279#true} is VALID [2018-11-23 13:09:56,531 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {2279#true} {2284#(<= 1 main_~c~0)} #164#return; {2284#(<= 1 main_~c~0)} is VALID [2018-11-23 13:09:56,531 INFO L256 TraceCheckUtils]: 87: Hoare triple {2284#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {2551#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:56,533 INFO L273 TraceCheckUtils]: 88: Hoare triple {2551#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2555#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:09:56,533 INFO L273 TraceCheckUtils]: 89: Hoare triple {2555#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2280#false} is VALID [2018-11-23 13:09:56,533 INFO L273 TraceCheckUtils]: 90: Hoare triple {2280#false} assume !false; {2280#false} is VALID [2018-11-23 13:09:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-23 13:09:56,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:09:56,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2018-11-23 13:09:56,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2018-11-23 13:09:56,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:56,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:09:56,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:56,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:09:56,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:09:56,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:09:56,731 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand 10 states. [2018-11-23 13:09:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:58,040 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2018-11-23 13:09:58,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:09:58,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2018-11-23 13:09:58,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:09:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-23 13:09:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:09:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-23 13:09:58,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2018-11-23 13:09:58,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:58,152 INFO L225 Difference]: With dead ends: 74 [2018-11-23 13:09:58,153 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:09:58,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:09:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:09:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:09:58,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:58,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:58,156 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:58,156 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:58,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:58,157 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:09:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:58,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:58,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:58,157 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:58,157 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:58,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:58,158 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:09:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:58,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:58,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:58,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:58,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:09:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:09:58,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2018-11-23 13:09:58,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:58,160 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:09:58,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:09:58,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:58,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:58,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:09:58,801 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:09:58,801 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:09:58,801 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:09:58,801 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:09:58,802 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:09:58,802 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:09:58,802 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 69) no Hoare annotation was computed. [2018-11-23 13:09:58,802 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-23 13:09:58,802 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-23 13:09:58,802 INFO L444 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-23 13:09:58,802 INFO L444 ceAbstractionStarter]: At program point L28-1(line 28) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-23 13:09:58,802 INFO L444 ceAbstractionStarter]: At program point L53(line 53) the Hoare annotation is: (let ((.cse0 (<= 1 main_~cp~0)) (.cse1 (<= 0 main_~scheme~0)) (.cse2 (<= (+ main_~cp~0 2) main_~urilen~0)) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 1 main_~c~0) .cse2 .cse3))) [2018-11-23 13:09:58,802 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-23 13:09:58,802 INFO L444 ceAbstractionStarter]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse0 (<= 1 main_~cp~0)) (.cse1 (<= 0 main_~scheme~0)) (.cse2 (<= (+ main_~cp~0 2) main_~urilen~0)) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 1 main_~c~0) .cse2 .cse3))) [2018-11-23 13:09:58,803 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-23 13:09:58,803 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-23 13:09:58,803 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-23 13:09:58,803 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 11 69) no Hoare annotation was computed. [2018-11-23 13:09:58,803 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 69) no Hoare annotation was computed. [2018-11-23 13:09:58,803 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 66) no Hoare annotation was computed. [2018-11-23 13:09:58,803 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 69) the Hoare annotation is: true [2018-11-23 13:09:58,803 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 61) no Hoare annotation was computed. [2018-11-23 13:09:58,803 INFO L448 ceAbstractionStarter]: For program point L22(lines 11 69) no Hoare annotation was computed. [2018-11-23 13:09:58,803 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 55 61) no Hoare annotation was computed. [2018-11-23 13:09:58,804 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 65) no Hoare annotation was computed. [2018-11-23 13:09:58,804 INFO L444 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (<= 1 main_~cp~0)) (.cse1 (<= 0 main_~scheme~0))) (or (and (= main_~urilen~0 (+ main_~cp~0 1)) .cse0 .cse1) (and .cse0 .cse1 (<= (+ main_~cp~0 2) main_~urilen~0)))) [2018-11-23 13:09:58,804 INFO L444 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-23 13:09:58,804 INFO L444 ceAbstractionStarter]: At program point L31-1(line 31) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-23 13:09:58,804 INFO L448 ceAbstractionStarter]: For program point L23(lines 11 69) no Hoare annotation was computed. [2018-11-23 13:09:58,804 INFO L448 ceAbstractionStarter]: For program point L40(lines 30 66) no Hoare annotation was computed. [2018-11-23 13:09:58,804 INFO L444 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= 1 main_~c~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-23 13:09:58,804 INFO L444 ceAbstractionStarter]: At program point L57-1(line 57) the Hoare annotation is: (and (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= 1 main_~c~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-23 13:09:58,805 INFO L444 ceAbstractionStarter]: At program point L49(line 49) the Hoare annotation is: (and (<= 1 main_~cp~0) (= main_~c~0 0) (<= 0 main_~scheme~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-23 13:09:58,805 INFO L444 ceAbstractionStarter]: At program point L49-1(line 49) the Hoare annotation is: (and (<= 1 main_~cp~0) (= main_~c~0 0) (<= 0 main_~scheme~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-23 13:09:58,805 INFO L444 ceAbstractionStarter]: At program point L33-1(lines 32 38) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-23 13:09:58,805 INFO L444 ceAbstractionStarter]: At program point L33-2(lines 33 38) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-23 13:09:58,805 INFO L444 ceAbstractionStarter]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= 1 main_~c~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-23 13:09:58,805 INFO L444 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-23 13:09:58,805 INFO L444 ceAbstractionStarter]: At program point L42-1(line 42) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-23 13:09:58,805 INFO L451 ceAbstractionStarter]: At program point L67(lines 11 69) the Hoare annotation is: true [2018-11-23 13:09:58,806 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-23 13:09:58,806 INFO L444 ceAbstractionStarter]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= 1 main_~c~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-23 13:09:58,806 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-23 13:09:58,806 INFO L444 ceAbstractionStarter]: At program point L51-1(lines 50 63) the Hoare annotation is: (let ((.cse0 (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)))) (or (and (= main_~c~0 0) .cse0) (and .cse0 (<= 1 main_~c~0)))) [2018-11-23 13:09:58,806 INFO L448 ceAbstractionStarter]: For program point L43(lines 30 66) no Hoare annotation was computed. [2018-11-23 13:09:58,806 INFO L444 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-23 13:09:58,806 INFO L444 ceAbstractionStarter]: At program point L35-1(line 35) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= 0 main_~scheme~0) (<= (+ main_~cp~0 2) main_~urilen~0)) [2018-11-23 13:09:58,806 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:09:58,806 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:09:58,806 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:09:58,806 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:09:58,807 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:09:58,807 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:09:58,808 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:09:58,808 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:09:58,808 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:09:58,808 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:09:58,808 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:09:58,809 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:09:58,809 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:09:58,809 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:09:58,809 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:09:58,809 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:09:58,809 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:09:58,809 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:09:58,809 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:09:58,809 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:09:58,809 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:09:58,809 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:09:58,809 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:09:58,809 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 13:09:58,809 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 13:09:58,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,810 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,811 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,811 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,811 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,811 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,811 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:09:58,811 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:09:58,811 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 13:09:58,811 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 13:09:58,812 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-23 13:09:58,812 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-23 13:09:58,812 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-23 13:09:58,812 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 13:09:58,812 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 13:09:58,812 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 13:09:58,812 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-23 13:09:58,812 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-23 13:09:58,813 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-23 13:09:58,813 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-11-23 13:09:58,813 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-11-23 13:09:58,814 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-23 13:09:58,814 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-23 13:09:58,814 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-23 13:09:58,814 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-23 13:09:58,814 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:09:58,814 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-23 13:09:58,814 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-23 13:09:58,814 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-23 13:09:58,814 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-23 13:09:58,814 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-11-23 13:09:58,814 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-11-23 13:09:58,814 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-11-23 13:09:58,814 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-11-23 13:09:58,815 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 13:09:58,815 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 13:09:58,815 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 13:09:58,815 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 13:09:58,815 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. [2018-11-23 13:09:58,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:09:58 BoogieIcfgContainer [2018-11-23 13:09:58,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:09:58,828 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:09:58,828 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:09:58,828 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:09:58,830 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:45" (3/4) ... [2018-11-23 13:09:58,833 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:09:58,838 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:09:58,839 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:09:58,839 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:09:58,844 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 13:09:58,845 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 13:09:58,845 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:09:58,920 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:09:58,920 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:09:58,922 INFO L168 Benchmark]: Toolchain (without parser) took 14734.70 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:58,923 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:58,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:58,924 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:58,925 INFO L168 Benchmark]: Boogie Preprocessor took 32.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:58,925 INFO L168 Benchmark]: RCFGBuilder took 1136.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -763.0 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:58,925 INFO L168 Benchmark]: TraceAbstraction took 13082.15 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 275.3 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -321.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:58,926 INFO L168 Benchmark]: Witness Printer took 91.99 ms. Allocated memory is still 2.6 GB. Free memory is still 2.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:58,928 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 362.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 23.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1136.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -763.0 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13082.15 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 275.3 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -321.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Witness Printer took 91.99 ms. Allocated memory is still 2.6 GB. Free memory is still 2.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 50]: Loop Invariant Derived loop invariant: (c == 0 && (1 <= cp && cp + 1 <= urilen) && 0 <= scheme) || (((1 <= cp && cp + 1 <= urilen) && 0 <= scheme) && 1 <= c) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (1 <= cp && cp + 1 <= urilen) && 0 <= scheme - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 1 error locations. SAFE Result, 13.0s OverallTime, 6 OverallIterations, 14 TraceHistogramMax, 8.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 328 SDtfs, 112 SDslu, 1066 SDs, 0 SdLazy, 878 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 255 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 76 PreInvPairs, 104 NumberOfFragments, 376 HoareAnnotationTreeSize, 76 FomulaSimplifications, 123 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 26 FomulaSimplificationsInter, 78 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 564 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 554 ConstructedInterpolants, 0 QuantifiedInterpolants, 55274 SizeOfPredicates, 10 NumberOfNonLiveVariables, 522 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 1377/1472 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...